REVIEW 2 cited by
Limitations of the Empirical Fisher Approximation for Natural Gradient Descent
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Natural gradient descent, which preconditions a gradient descent update with the Fisher information matrix of the underlying statistical model, is a way to capture partial second-order information. Several highly visible works have advocated an approximation known as the empirical Fisher, drawing connections between approximate second-order methods and heuristics like Adam. We dispute this argument by showing that the empirical Fisher---unlike the Fisher---does not generally capture second-order information. We further argue that the conditions under which the empirical Fisher approaches the Fisher (and the Hessian) are unlikely to be met in practice, and that, even on simple optimization problems, the pathologies of the empirical Fisher can have undesirable effects.
Forward citations
Cited by 2 Pith papers
-
Towards Efficient Reasoning in LLM-Based Recommender Systems via Model Merging
REAM merges slow- and fast-thinking recommender models at the per-attention-head level, cutting reasoning length by up to 24.3% while preserving rating accuracy.
-
Model-Preserving Adaptive Rounding
YAQA, a Kronecker-factored adaptive rounding method, reduces quantization KL by about 30 percent over LDLQ/GPTQ and gives conditional bounds on the Hessian quadratic error.
Discussion (0). Continue with ORCID to comment.