Papers › M-FAC: Efficient Matrix-Free Approximations of Second-Order Information

M-FAC: Efficient Matrix-Free Approximations of Second-Order Information

7 Jul 2021NeurIPS 2021 12arXiv:2107.03356archive 2025-07-28

Elias Frantar, Eldar Kurtic, Dan Alistarh

Efficiently approximating local curvature information of the loss function is a key tool for optimization and compression of deep neural networks. Yet, most existing methods to approximate second-order information have high computational or storage costs, which can limit their practicality. In this work, we investigate matrix-free, linear-time approaches for estimating Inverse-Hessian Vector Products (IHVPs) for the case when the Hessian can be approximated as a sum of rank-one matrices, as in the classic approximation of the Hessian by the empirical Fisher matrix. We propose two new algorithms as part of a framework called M-FAC: the first algorithm is tailored towards network compression and can compute the IHVP for dimension d, if the Hessian is given as a sum of m rank-one matrices, using O(dm²) precomputation, O(dm) cost for computing the IHVP, and query cost O(m) for any single element of the inverse Hessian. The second algorithm targets an optimization setting, where we wish to compute the product between the inverse Hessian, estimated over a sliding window of optimization steps, and a given gradient direction, as required for preconditioned SGD. We give an algorithm with cost O(dm + m²) for computing the IHVP and O(dm + m³) for adding or removing any gradient from the sliding window. These two algorithms yield state-of-the-art results for network pruning and optimization with lower computational overhead relative to existing second-order methods. Implementations are available at [9] and [17].

PaperPDFConference PDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Syntology holds a reference implementation of M-FAC, generated from the paper text (not the authors' code), at level 3 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='M-FAC') (how to connect); the free check have('2107.03356') needs no token.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 14 code samples harvested from 2 repositories linked to this paper: 7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified. Where Syntology's instrument failed: 3 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 6 samples from 1 repository, 4 ran (1 with no instrument failure; 3 where Syntology's instrument failed); community (archive-listed): 8 samples from 1 repository, 3 ran (3 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 4 of the 7 samples that ran have no recorded date.

IST-DASLab/M-FAC officialmentioned in papermentioned on GitHubpytorchSyntology: 6 samples, 4 ran (3 instrument-failed) · 2 unverified report
ist-daslab/efcp mentioned on GitHubjaxSyntology: 8 samples, 3 ran (0 instrument-failed) · 5 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

14 samples harvested: 7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

4ran · honoured contract
3ran · our draft was wrong
7unverified

Licence: 0 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

IST-DASLab/M-FAC official repository 6 samples, 4 ran (3 instrument-failed) · 2 unverified
batch_mvp prun.py ran · our draft was wrong fingerprinted MIT (permissive) · 8050b1947cc48db8 · report fixture: signature A:Tensor/3/float, B:Tensor/2/float · returned Tensor · level recorded, date not recorded
batch_vmp prun.py ran · our draft was wrong fingerprinted MIT (permissive) · 19650f5d1f338d8a · report fixture: signature A:Tensor/2/float, B:Tensor/2/float · returned Tensor · level recorded, date not recorded
batch_dot prun.py ran · our draft was wrong fingerprinted MIT (permissive) · 87ccd31d3ec472fd · report fixture: signature A:Tensor/2/float, B:Tensor/2/float · returned Tensor · level recorded, date not recorded
test in 377 papers main_optim.py ran · honoured contract MIT (permissive) · c1bbbadad5c3cdcf · report fixture: signature model:callable/0/?, data:list/1/tuple, batch_size:int/0/int · returned float · level recorded, date not recorded
HInvFastUpMulti optim.py unverified MIT (permissive) · 289ba747a6543b4b · report
MFAC optim.py unverified MIT (permissive) · dadfb3e97237d010 · report
ist-daslab/efcp community (archive-listed) 8 samples, 3 ran (0 instrument-failed) · 5 unverified
get_gradients optimizers/dense/MFAC.py ran · honoured contract Apache-2.0 (permissive) · 3cb7ad181b8a381b · report fixture: signature params:list/1/dict · returned Tensor · level recorded 2026-09-22
get_weights in 34 papers optimizers/dense/MFAC.py ran · honoured contract Apache-2.0 (permissive) · d0a95782e972077b · report fixture: signature params:list/1/dict · returned Tensor · level recorded 2026-09-22
norm in 120 papers
census: 23 implementations from 26 papers, 15 distinct outputs across 6 buckets, one shared input per bucket this sample: bucket 1 of 6, arg 1: rank 2, kind float, dtype float32
optimizers/dense/MFAC.py ran · honoured contract fingerprinted Apache-2.0 (permissive) · 79cfb98e536acac6 · report fixture: signature v:Tensor/2/float · returned Tensor · level recorded 2026-09-22
DenseMFAC optimizers/dense/MFAC.py unverified Apache-2.0 (permissive) · 7290388bb1e94558 · report
HInvFastUpMulti optimizers/dense/MFAC.py unverified Apache-2.0 (permissive) · 80db31a3a92821b5 · report
get_first_device optimizers/dense/MFAC.py unverified Apache-2.0 (permissive) · 1f9104c9660aeb24 · report
get_gpus optimizers/dense/MFAC.py unverified Apache-2.0 (permissive) · 08f4dde70db58de8 · report
update_model in 7 papers optimizers/dense/MFAC.py unverified Apache-2.0 (permissive) · c2dc9537f5e560fa · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another. Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.

3 assemblies on this paper: 2 harvested, 1 generated, listed in 2 groups (siblings lifted in one batch form one group).

generated Assembly for M-FAC (graph method: M-FAC), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 3; 4 property tests passed on both).

label matches by construction: the code was generated for this method (not judged by a model)

  1. compute_d_and_b_matrices entry · level 3 · ran · violated contract · 5e8fdf96d37152b903cae0d85a3bdeaab469f8c15b3d194519962bd27e65d3f0

2 sibling assemblies for M-FAC (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for M-FAC (graph method: M-FAC). 8 bricks; individually on a fixture: 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. DenseMFAC entry · level 0 · unverified · 7290388bb1e94558
  2. HInvFastUpMulti helper · level 0 · unverified · 80db31a3a92821b5
  3. get_first_device helper · level 0 · unverified · 1f9104c9660aeb24
  4. get_gpus helper · level 0 · unverified · 08f4dde70db58de8
  5. get_gradients helper · level 1 · ran · honoured contract · 3cb7ad181b8a381b
  6. get_weights helper · level 1 · ran · honoured contract · d0a95782e972077b
  7. update_model helper · level 0 · unverified · c2dc9537f5e560fa
  8. norm helper · level 1 · ran · honoured contract · 79cfb98e536acac6

harvested Assembly for M-FAC (graph method: M-FAC). 2 bricks; individually on a fixture: 0 ran · 2 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. MFAC entry · level 0 · unverified · dadfb3e97237d010
  2. HInvFastUpMulti helper · level 0 · unverified · 289ba747a6543b4b

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2107.03356") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Network PruningSecond-order methods

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

PruningSGD

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections