Pointwise confidence estimation in the non-linear ℓ2-regularized least squares
Not on the map. Why?
Abstract (arXiv)
We consider a high-probability non-asymptotic confidence estimation in the ℓ2-regularized non-linear least-squares setting with fixed design. In particular, we study confidence estimation for local minimizers of the regularized training loss. We show a pointwise confidence bound, meaning that it holds for the prediction on any given fixed test input x. Importantly, the proposed confidence bound scales with similarity of the test input to the training data in the implicit feature space of the predictor (for instance, becoming very large when the test input lies far outside of the training data). This desirable last feature is captured by the weighted norm involving the inverse-Hessian matrix of the objective function, which is a generalized version of its counterpart in the linear setting, xtop Cov-1 x. Our generalized result can be regarded as a non-asymptotic counterpart of the classical confidence interval based on asymptotic normality of the MLE estimator. We propose an efficient method for computing the weighted norm, which only mildly exceeds the cost of a gradient computation of the loss function. Finally, we complement our analysis with empirical evidence showing that the proposed confidence bound provides better coverage/width trade-off compared to a confidence estimation by bootstrapping, which is a gold-standard method in many applications involving non-linear predictors such as neural networks.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 28 of its 58 references that are in the map. First posted on arXiv 8 Jun 2025.
Builds on
28 of 58 references.
References · 28
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 724
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 659
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
- 2016Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Lojasiewicz Conditioncited by 539
- 2016Deep Exploration via Bootstrapped DQNcited by 527
- 2014OpenML: networked science in machine learningcited by 526
- 2015An Introduction to Matrix Concentration Inequalitiescited by 397
- 2017On Kernelized Multi-armed Banditscited by 352
- 2013Learning to Optimize Via Posterior Samplingcited by 256
16 more
- 2020Model-Based Reinforcement Learning with Value-Targeted Regressioncited by 234
- 2018Randomized Prior Functions for Deep Reinforcement Learningcited by 219
- 2020A Simple Convergence Proof of Adam and Adagradcited by 171
- 2021Epistemic Neural Networkscited by 120
- 2017Stability and Generalization of Learning Algorithms that Converge to Global Optimacited by 100
- 2023Convergence of Adam Under Relaxed Assumptionscited by 99
- 2018Practical Contextual Bandits with Regression Oraclescited by 93
- 2019Sharper bounds for uniformly stable algorithmscited by 93
- 2019Approximate Inference Turns Deep Networks into Gaussian Processescited by 89
- 2019'In-Between' Uncertainty in Bayesian Neural Networkscited by 80
- 2019Stochastic gradient Markov chain Monte Carlocited by 56
- 2022A Framework and Benchmark for Deep Batch Active Learning for Regressioncited by 49
- 2022Adapting the Linearised Laplace Model Evidence for Modern Deep Learningcited by 29
- 2021Proxy Convexity: A Unified Framework for the Analysis of Neural Networks Trained by Gradient Descentcited by 21
- 2022Ensembles for Uncertainty Estimation: Benefits of Prior Functions and Bootstrappingcited by 19
- 2018Distribution-Free Uncertainty Quantification for Kernel Methods by Gradient Perturbationscited by 9
Built on by
Citing papers per year: 2026: 1.
1 paper.