arXiv:2609. 13040v1 Announce Type: new Abstract: We study loss-based filtering for finite-sum optimization with a subset of corrupted component functions whose gradients may be highly unreliable.
arXiv:2505.13299v2 Announce Type: replace-cross Abstract: This paper considers the estimation of quantiles via a smoothed version of the stochastic gradient descent (SGD) algorithm. By smoothing the...
Bilevel optimization (BLO) is fundamental to hierarchical decision-making but suffers from critical instability under heavy-tailed stochastic noise. Existing variance-reduction techniques typically rely on myopic magnitude checks, which fail to distinguish informative geometric signals from impulsive outliers.
Occupancy-based Quantile Risk Control (OQRC) is a new method that extends conformal risk control to quantile-based risk measures. It partitions the loss space using ordered calibration losses, estimates the distribution of test losses in each bin, and upper-bounds the risk by the maximum loss per bin. The approach guarantees finite-sample validity, achieving tight risk control bounds that converge at a rate of σ(n^{-1/2}) and reducing the risk gap by up to 78.64% in experiments.
arXiv:2606. 28652v1 Announce Type: cross Abstract: Online high-dimensional regression requires algorithms that can update sequentially while preserving structural sparsity.
The paper introduces a distributionally robust method for learning hyperparameters of first‑order convex optimization algorithms. By minimizing a Wasserstein‑robust performance estimation problem over a dataset of problem instances, the approach interpolates between classical learning‑to‑optimize (L2O) and worst‑case PEP design. The authors solve the resulting problem with stochastic gradient descent, provide high‑probability risk bounds, and demonstrate that the learned algorithms outperform both worst‑case optimal and vanilla L2O baselines on logistic regression, LASSO, and linear programming tasks.
Occupancy-based Quantile Risk Control (OQRC) is a new method that extends conformal risk control to quantile-based risk measures while avoiding excessive conservatism and providing rigorous finite-sample guarantees. It works by partitioning the loss space using ordered calibration losses, estimating the distribution of test losses in each bin, and bounding the risk by the maximum loss in each bin. The authors prove that OQRC achieves tight risk control bounds with a finite-sample guarantee that converges at a rate of π(n−½), and experiments show it can reduce the risk gap by up to 78.64% on common benchmarks.
arXiv:2603. 05774v2 Announce Type: replace Abstract: This paper addresses the distributed stochastic minimax optimization problem subject to stochastic constraints.
arXiv:2609.24929v1 Announce Type: cross Abstract: In this paper, we study nonasymptotic $L^p$ error bounds for interval length and conditional coverage in split conformalized quantile regression (CQR...
arXiv:2601. 18115v2 Announce Type: replace Abstract: We study the problem of learning a single neuron under standard squared loss in the presence of arbitrary label noise and group-level distributional shifts, for a broad family of covariate distributions.
arXiv:2505.20817v3 Announce Type: replace-cross Abstract: Gradient clipping is widely used in language-model training to control heavy-tailed gradient noise and can improve convergence guarantees ove...
arXiv:2407. 04900v2 Announce Type: replace Abstract: Numerous existing studies have examined the performance of Sample Average Approximation (SAA) in the fundamental newsvendor problem.
arXiv:2606. 00265v1 Announce Type: cross Abstract: We study quantile regression in an extrapolation regime where the covariate takes unusually large values.