Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

1122 · Feb 202419922001200920172026
8 results for AGOP

The paper explains spikes in training loss as catapults, improving feature learning and generalization.

problem Understanding and improving the training process of neural networks.
method Analysis of training loss spikes in SGD, empirical evidence of catapults, and demonstration of AGOP alignment.
result Catapults in training loss promote feature learning and better generalization.

AGOP from KRR recovers central subspace in fewer samples than needed for prediction.

problem Recovering low-dimensional structure in multi-index polynomial functions.
method Fit kernel ridge regression and compute AGOP from the fitted predictor.
result AGOP's top rr eigenspace recovers the central subspace in ndp+δn \asymp d^{p+δ} samples.

RFM reduces feature space for linear models, improving sparse recovery.

problem Sparse linear regression and low-rank matrix recovery.
method Recursive Feature Machines (RFM) that alternates between reweighting feature vectors by AGOP and learning prediction function.
result RFM generalizes IRLS and outperforms deep linear networks.

Gradient descent aligns neural feature matrices with pre-activation tangent features.

problem Understanding neural feature learning mechanisms.
method Analytical proof of alignment between weight matrices and pre-activation tangent features.
result Derivative alignment occurs almost surely in high-dimensional settings.

Recursive Feature Machines show grokking in modular arithmetic without neural networks.

problem Grokking in modular arithmetic tasks.
method Recursive Feature Machines (RFM) with Average Gradient Outer Product (AGOP).
result RFM and neural networks learn block-circulant features to solve modular arithmetic.

Breaking symmetry in training data is key for generalization in feature learning kernels.

problem Grokking in algebraic tasks, where models perform well on training but fail on unseen data.
method Used Recursive Feature Machine (RFM) with AGOP to learn task-relevant features, breaking symmetry in training data.
result Generalization occurs only when symmetry in the training set is broken, and RFM generalizes by recovering underlying invariance group action.