Skip to content

Estimating Population-Risk Curves Along Nonconvex Gradient Flows from the Training Sample

Aug 2026 · 0 citations
Mathematics Computer Science

TL;DR

Direct first-order jackknife cancellation and exact-LOO concentration control deletion-to-full risk transfer and fluctuation, respectively, completing recovery of the conditional population-risk curve are estimated.

Abstract

We estimate the conditional population-risk curve of a realized smooth nonconvex gradient flow from the training sample. Flow approximate leave-one-out (Flow-ALO) propagates a deletion response and evaluates omitted observations at approximate deleted paths. The risk-curve error decomposes into response approximation, exact-LOO fluctuation, and deletion-to-full risk transfer. On each fixed finite horizon, bounded centered training-loss gradients, a one-sided Hessian lower bound, locally Lipschitz Hessians, and a strict tube-closure condition yield an explicit $(n-1)^{-2}$ bound for the deletion-response error. Bounded evaluation-loss gradients transfer the deletion-response bound to the score without requiring the Hessian to be invertible. Direct first-order jackknife cancellation and exact-LOO concentration control deletion-to-full risk transfer and fluctuation, respectively, completing recovery of the conditional population-risk curve. For bounded smooth two-layer mean-field networks training both layers, the score-error bound is uniform in width.

View source

Similar papers

Preprint Aug 2026

Generalization Error Estimation for Primal--Dual Algorithms in Non-Smooth Regression

A general recursive framework that includes the Chambolle--Pock algorithm and related primal--dual splitting methods is developed, which proves finite-sample guarantees for both estimators and establishes a matched-Gaussian universality result beyond Gaussian designs.

Kai Tan, Pierre C. Bellec · 0 citations
Sep 2026

Contextual Conditional Value-at-Risk: Estimation and Optimization

This work exploits the Rockafellar–Uryasev representation to formulate both contextual CVaR estimation and optimization as optimization problems involving conditional expectations, and develops a unified data-driven predict-then-optimize framework.

Heng Luo, Ni-Fei Lin, L. J. Hong · 0 citations
Preprint Sep 2026

Gradient-Free Methods for Stochastic Convex Optimization with Stochastic Functional Constraints

We develop accelerated gradient-free methods for stochastic convex optimization with constraints defined by expectations. Our batched primal-dual sliding method uses two-point evaluations sharing a random sample and guarantees expected objective error and expected maximum constraint violation at most $\varepsilon$. It...

Vadim Abronin, A. Gasnikov, D. Dvinskikh · 0 citations
#machine learning Preprint Sep 2026

Exact information accounting for SGD methods

As an alternative to the standard geometric analyses, we give an exact, information-theoretic analysis of stochastic gradient descent (SGD) and its variants. We show that a preconditioned SGD step is the posterior-mean update of a Gaussian Bayes model, and that its one-step regret splits into an intrinsic-time cost and...

Akshay Balsubramani · 0 citations
#machine learning Preprint Oct 2026

The Curvature of Regret in Contextual Linear Optimization

Decision-focused learning for linear optimization is complicated by the discontinuity of the optimizer, where small cost errors may leave the decision unchanged or move it to a different vertex. We show that this non-smooth pointwise behavior becomes locally quadratic after averaging over the data distribution, and we...

Konstantinos Ziliaskopoulos, A. Vinel, Alice E. Smith · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.