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 · Mar 202419922001200920172026
9 results for near-interpolators

Near-interpolating models grow norms quickly, affecting generalization.

problem Understanding the trade-off between interpolation and generalization in near-interpolating models.
method Random matrix theory and eigendecay analysis of data covariance matrix.
result Near-interpolating models exhibit rapid norm growth and worse generalization trade-offs.

Study reveals phase transition in neural networks near interpolation.

problem Understanding generalization and learning transitions in neural networks.
method Effective theory for approximating Bayes-optimal generalisation error.
result Unveils a discontinuous phase transition between universal and specialisation phases.

Statistical mechanics explains learning in large neural networks near interpolation.

problem Understanding the learning dynamics of large neural networks near interpolation.
method Statistical physics analysis of a two-layer network with generic weight distribution and activation function.
result Learning transitions and feature learning emerge as the number of data increases.

The study finds that memorization is necessary or harmful depending on the prior distribution and noise level.

problem The impact of memorization on generalization in overparameterized models.
method An overparameterized linear model with general priors in a Bayesian setup.
result Explicit conditions for optimal generalization based on the prior distribution and noise level.

Study optimizes linear regression analysis for high-dimensional settings.

problem Understanding high-dimensional linear regression with interpolation and regularization.
method Localized uniform convergence analysis of optimistic rates for linear regression.
result Recover guarantees for ridge and LASSO regression under random designs.

Lower bound proves ridgeless regression performs poorly near interpolation threshold.

problem Proving performance of ridgeless regression near interpolation threshold.
method Distribution-independent lower bound for mean squared error in noisy ridgeless linear regression.
result Lower bound implies ridgeless regression performs poorly near interpolation threshold.

New ridge regression bounds for high-dimensional data without proportional growth.

problem Moving beyond proportional asymptotics in high-dimensional statistics.
method Revisits ridge regression on i.i.d. data, allowing high-dimensional or infinite-dimensional feature vectors.
result Establishes non-asymptotic bounds approximating bias and variance of ridge regression.

The paper analyzes the performance of random feature regression in high dimensions.

problem Understanding how model complexity and generalization depend on the number of parameters and sample size.
method Investigates random feature ridge regression (RFRR) and compares it to kernel ridge regression (KRR).
result RFRR exhibits a trade-off between approximation and generalization power, with a double descent phenomenon at a specific point.