Gradient descent inference in empirical risk minimization
From MaRDI portal
Cites work
- A leave-one-out approach to approximate message passing
- A modern maximum-likelihood theory for high-dimensional logistic regression
- Acceleration of Stochastic Approximation by Averaging
- Approximate message passing algorithms for rotationally invariant matrices
- Confidence Intervals and Hypothesis Testing for High-Dimensional Regression
- Debiasing convex regularized estimators and interval estimation in linear models
- Dynamical mean-field theory and aging dynamics
- Entrywise dynamics and universality of general first order methods
- Finite Sample Analysis of Approximate Message Passing Algorithms
- High dimensional robust M-estimation: asymptotic variance via approximate message passing
- High-dimensional scaling limits and fluctuations of online least-squares SGD with smooth covariance
- High‐dimensional limit theorems for SGD: Effective dynamics and critical scaling
- Hitting the high-dimensional notes: an ODE for SGD learning dynamics on GLMs and multi-index models
- Hypothesis Testing in High-Dimensional Regression Under the Gaussian Random Design Model: Asymptotic Theory
- Mean field asymptotics in high-dimensional statistics: from exact results to efficient algorithms
- Noisy linear inverse problems under convex constraints: exact risk asymptotics in high dimensions
- Observable adjustments in single-index models for regularized M-estimators with bounded p/n
- On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators
- Online bootstrap confidence intervals for the stochastic gradient descent estimator
- Online Covariance Matrix Estimation in Stochastic Gradient Descent
- Online stochastic gradient descent on non-convex losses from high-dimensional inference
- Out-of-equilibrium dynamical mean-field equations for the perceptron model
- Precise Error Analysis of Regularized <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math> </inline-formula>-Estimators in High Dimensions
- Rigorous dynamical mean field theory for stochastic gradient descent methods
- Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
- State evolution for approximate message passing with non-separable functions
- State evolution for general approximate message passing algorithms, with applications to spatial coupling
- Statistical inference for model parameters in stochastic gradient descent
- The distribution of the Lasso: uniform control over sparse balls and adaptive parameter tuning
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- The effective noise of stochastic gradient descent
- The Lasso with general Gaussian designs with applications to hypothesis testing
- The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled Chi-square
- Universality in polytope phase transitions and message passing algorithms
- Universality of regularized regression estimators in high dimensions
- Weak convergence and empirical processes. With applications to statistics
This page was built for publication: Gradient descent inference in empirical risk minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289796)
