Copertina

Convex SGD: Generalization Without Early Stopping

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Hendrickx, Julien, Olshevsky, Alex
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Statistics Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Failures and Successes of Cross-Validation for Early-Stopped Gradient Descent
di: Patil, Pratik, et al.
Pubblicazione: (2024)

Sharp Risk Bounds for Early-Stopping in Gaussian Linear Regression
di: Wegel, Tobias, et al.
Pubblicazione: (2025)

Random Matrix Theory of Early-Stopped Gradient Flow: A Transient BBP Scenario
di: Coeurdoux, Florentin, et al.
Pubblicazione: (2026)

Sharp Generalization for Nonparametric Regression in Interpolation Space by Over-Parameterized Neural Networks Trained with Preconditioned Gradient Descent and Early Stopping
di: Yang, Yingzhen, et al.
Pubblicazione: (2024)

Factor Augmented High-Dimensional SGD
di: Li, Shubo, et al.
Pubblicazione: (2026)

Early Stopping in Contextual Bandits and Inferences
di: Cui, Zihan
Pubblicazione: (2025)

On Regularization via Early Stopping for Least Squares Regression
di: Sonthalia, Rishi, et al.
Pubblicazione: (2024)

Estimating Generalization Performance Along the Trajectory of Proximal SGD in Robust Regression
di: Tan, Kai, et al.
Pubblicazione: (2024)

Smoothed SGD for quantiles: Bahadur representation and Gaussian approximation
di: Chen, Likai, et al.
Pubblicazione: (2025)

Generalization Bounds and Stopping Rules for Learning with Self-Selected Data
di: Rodemann, Julian, et al.
Pubblicazione: (2025)

SGD with Dependent Data: Optimal Estimation, Regret, and Inference
di: Shen, Yinan, et al.
Pubblicazione: (2026)

Statistical Inference for Linear Functionals of Online Least-squares SGD when $t \gtrsim d^{1+δ}$
di: Agrawalla, Bhavya, et al.
Pubblicazione: (2025)

Online Covariance Estimation in Averaged SGD: Improved Batch-Mean Rates and Minimax Optimality via Trajectory Regression
di: Ni, Yijin, et al.
Pubblicazione: (2026)

AdaDPIGU: Differentially Private SGD with Adaptive Clipping and Importance-Based Gradient Updates for Deep Neural Networks
di: Zhang, Huiqi, et al.
Pubblicazione: (2025)

On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds
di: Agrawal, Shubhada, et al.
Pubblicazione: (2025)

High-dimensional Limit of SGD for Diagonal Linear Networks
di: Malaxechebarría, Begoña García, et al.
Pubblicazione: (2026)

Convex Distance Operator Transport: A Convex and Geometry-Preserving Formulation
di: Chung, Junhyoung, et al.
Pubblicazione: (2026)

Max-Linear Regression by Convex Programming
di: Kim, Seonho, et al.
Pubblicazione: (2021)

Convex Regression in Multidimensions: Suboptimality of Least Squares Estimators
di: Kur, Gil, et al.
Pubblicazione: (2020)

Generalizing while preserving monotonicity in comparison-based preference learning models
di: Fageot, Julien, et al.
Pubblicazione: (2025)

Privacy of SGD under Gaussian or Heavy-Tailed Noise: Guarantees without Gradient Clipping
di: Şimşekli, Umut, et al.
Pubblicazione: (2024)

Optimal community detection in dense bipartite graphs
di: Chhor, Julien, et al.
Pubblicazione: (2025)

Minimax optimal submatrix detection: Sharp non-asymptotic rates
di: Knight, Parker, et al.
Pubblicazione: (2026)

Statistical Inference for Linear Functionals of Online SGD in High-dimensional Linear Regression
di: Agrawalla, Bhavya, et al.
Pubblicazione: (2023)

Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences
di: Aolaritei, Liviu, et al.
Pubblicazione: (2025)

High-dimensional scaling limits and fluctuations of online least-squares SGD with smooth covariance
di: Balasubramanian, Krishnakumar, et al.
Pubblicazione: (2023)

A Piecewise Lyapunov Analysis of Sub-quadratic SGD: Applications to Robust and Quantile Regression
di: Zhang, Yixuan, et al.
Pubblicazione: (2025)

Sharp One-Dimensional Sub-Gaussian Comparison in Convex Order
di: Zhang, Yihan
Pubblicazione: (2026)

Can SGD Select Good Fishermen? Local Convergence under Self-Selection Biases and Beyond
di: Kalavasis, Alkis, et al.
Pubblicazione: (2025)

Early stopping and polynomial smoothing in regression with reproducing kernels
di: Averyanov, Yaroslav, et al.
Pubblicazione: (2020)

Monotone Curve Estimation via Convex Duality
di: Lim, Tongseok, et al.
Pubblicazione: (2025)

Generating Rectifiable Measures through Neural Networks
di: Riegler, Erwin, et al.
Pubblicazione: (2024)

Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits
di: Zhou, Julien, et al.
Pubblicazione: (2024)

Ratio Covers of Convex Sets and Optimal Mixture Density Estimation
di: Compton, Spencer, et al.
Pubblicazione: (2026)

Convex Clustering Redefined: Robust Learning with the Median of Means Estimator
di: De, Sourav, et al.
Pubblicazione: (2025)

Probabilistic Guarantees of Stochastic Recursive Gradient in Non-Convex Finite Sum Problems
di: Zhong, Yanjie, et al.
Pubblicazione: (2024)

Hyper Input Convex Neural Networks for Shape Constrained Learning and Optimal Transport
di: Hundrieser, Shayan, et al.
Pubblicazione: (2026)

In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies
di: Kook, Yunbum, et al.
Pubblicazione: (2024)

Addressing pitfalls in implicit unobserved confounding synthesis using explicit block hierarchical ancestral sampling
di: Sun, Xudong, et al.
Pubblicazione: (2025)

Early-stopped aggregation: Adaptive inference with computational efficiency
di: Ohn, Ilsang, et al.
Pubblicazione: (2026)