atlas

Research map / Graph learning / Graph algorithms and clustering

Moccasin: Efficient Tensor Rematerialization for Neural Networks

ICML 2023 · Graph learning › Graph algorithms and clustering · approach: Neural combinatorial optimization on graphs · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use Moccasin's retention-interval CP formulation instead of Checkmate MILPMemory-constrained rematerialization optimization · Mid-sized graphs where both methods return feasible solutionssolve time: up to an order-of-magnitude less solve timeHelped
Use Moccasin instead of Checkmate MILPRL G2, M=132,156 · RL G2, M=132,156TDI (%): 0.9 -> 0.9No clear effect
Use Moccasin instead of Checkmate MILPRL G2, M=132,156 · RL G2, M=132,156solve time: 685.1 -> 55.0Helped
Use LP relaxation followed by rounding instead of the full Checkmate MILPCheckmate rematerialization optimization · RL G2, M=132,156TDI (%): 0.9 -> 93.0Hurt
Use Moccasin instead of Checkmate MILPRandom layered and real-world graphs with more than 250 nodes · Large graphsfinding a feasible solutionHelped
Use LP relaxation followed by roundingCheckmate rematerialization optimization · Most evaluated graphsmemory-budget feasibilityHurt
Limit each node to at most 2 rematerializations/retention intervals (ablation)Moccasin · Evaluated computation graphssolution qualityNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy