Unified Precision-Guaranteed Stopping Rules for Contextual Learning
Fuente:
arXiv
Saved in:
| Main Authors: | Ding, Mingrui, Zhao, Qiuhong, Gao, Siyang, Dong, Jing |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Learning to Stop: Deep Learning for Mean Field Optimal Stopping
by: Magnino, Lorenzo, et al.
Published: (2024)
by: Magnino, Lorenzo, et al.
Published: (2024)
Early Stopping in Contextual Bandits and Inferences
by: Cui, Zihan
Published: (2025)
by: Cui, Zihan
Published: (2025)
Deep Learning for the Multiple Optimal Stopping Problem
by: Laurière, Mathieu, et al.
Published: (2025)
by: Laurière, Mathieu, et al.
Published: (2025)
Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences
by: Aolaritei, Liviu, et al.
Published: (2025)
by: Aolaritei, Liviu, et al.
Published: (2025)
Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
by: Crawshaw, Michael, et al.
Published: (2025)
by: Crawshaw, Michael, et al.
Published: (2025)
On Performance Guarantees for Federated Learning with Personalized Constraints
by: Ebrahimi, Mohammadjavad, et al.
Published: (2026)
by: Ebrahimi, Mohammadjavad, et al.
Published: (2026)
Memory-Reduced Meta-Learning with Guaranteed Convergence
by: Yang, Honglin, et al.
Published: (2024)
by: Yang, Honglin, et al.
Published: (2024)
Towards Robust Learning to Optimize with Theoretical Guarantees
by: Song, Qingyu, et al.
Published: (2025)
by: Song, Qingyu, et al.
Published: (2025)
Nonlinear Stochastic Gradient Descent and Heavy-tailed Noise: A Unified Framework and High-probability Guarantees
by: Armacki, Aleksandar, et al.
Published: (2024)
by: Armacki, Aleksandar, et al.
Published: (2024)
Safe Reinforcement Learning for Constrained Markov Decision Processes with Stochastic Stopping Time
by: Mazumdar, Abhijit, et al.
Published: (2024)
by: Mazumdar, Abhijit, et al.
Published: (2024)
Learning Over-Relaxation Policies for ADMM with Convergence Guarantees
by: Lin, Junan, et al.
Published: (2026)
by: Lin, Junan, et al.
Published: (2026)
Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees
by: Ovalle, Daniel, et al.
Published: (2025)
by: Ovalle, Daniel, et al.
Published: (2025)
Data-Driven Performance Guarantees for Classical and Learned Optimizers
by: Sambharya, Rajiv, et al.
Published: (2024)
by: Sambharya, Rajiv, et al.
Published: (2024)
A Unified Approach to Extract Interpretable Rules from Tree Ensembles via Integer Programming
by: Bonasera, Lorenzo, et al.
Published: (2024)
by: Bonasera, Lorenzo, et al.
Published: (2024)
Accelerating Optimization via Differentiable Stopping Time
by: Xie, Zhonglin, et al.
Published: (2025)
by: Xie, Zhonglin, et al.
Published: (2025)
Learning Neural Contracting Dynamics: Extended Linearization and Global Guarantees
by: Jaffe, Sean, et al.
Published: (2024)
by: Jaffe, Sean, et al.
Published: (2024)
Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming
by: Cheng, Hongyu, et al.
Published: (2025)
by: Cheng, Hongyu, et al.
Published: (2025)
A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees
by: Zhou, Yuhao, et al.
Published: (2025)
by: Zhou, Yuhao, et al.
Published: (2025)
Adaptive Algorithms with Sharp Convergence Rates for Stochastic Hierarchical Optimization
by: Gong, Xiaochuan, et al.
Published: (2025)
by: Gong, Xiaochuan, et al.
Published: (2025)
Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence Analysis
by: Hao, Jie, et al.
Published: (2024)
by: Hao, Jie, et al.
Published: (2024)
A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness
by: Gong, Xiaochuan, et al.
Published: (2024)
by: Gong, Xiaochuan, et al.
Published: (2024)
An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness
by: Gong, Xiaochuan, et al.
Published: (2024)
by: Gong, Xiaochuan, et al.
Published: (2024)
On the Convergence of Adam-Type Algorithm for Bilevel Optimization under Unbounded Smoothness
by: Gong, Xiaochuan, et al.
Published: (2025)
by: Gong, Xiaochuan, et al.
Published: (2025)
Feel-Good Thompson Sampling for Contextual Dueling Bandits
by: Li, Xuheng, et al.
Published: (2024)
by: Li, Xuheng, et al.
Published: (2024)
Best Arm Identification with LLM Judges and Limited Human
by: Ao, Ruicheng, et al.
Published: (2026)
by: Ao, Ruicheng, et al.
Published: (2026)
Learning to Optimize for Mixed-Integer Non-linear Programming with Feasibility Guarantees
by: Tang, Bo, et al.
Published: (2024)
by: Tang, Bo, et al.
Published: (2024)
QLABGrad: a Hyperparameter-Free and Convergence-Guaranteed Scheme for Deep Learning
by: Fu, Minghan, et al.
Published: (2023)
by: Fu, Minghan, et al.
Published: (2023)
Learning-to-Optimize with PAC-Bayesian Guarantees: Theoretical Considerations and Practical Implementation
by: Sucker, Michael, et al.
Published: (2024)
by: Sucker, Michael, et al.
Published: (2024)
Greedy Low-Rank Gradient Compression for Distributed Learning with Convergence Guarantees
by: Chen, Chuyan, et al.
Published: (2025)
by: Chen, Chuyan, et al.
Published: (2025)
A New First-Order Meta-Learning Algorithm with Convergence Guarantees
by: Chayti, El Mahdi, et al.
Published: (2024)
by: Chayti, El Mahdi, et al.
Published: (2024)
Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimization
by: Jiang, Ruichen, et al.
Published: (2026)
by: Jiang, Ruichen, et al.
Published: (2026)
Negative Imaginary Neural ODEs: Learning to Control Mechanical Systems with Stability Guarantees
by: Shi, Kanghong, et al.
Published: (2025)
by: Shi, Kanghong, et al.
Published: (2025)
Learning-Based Optimal Control with Performance Guarantees for Unknown Systems with Latent States
by: Lefringhausen, Robert, et al.
Published: (2023)
by: Lefringhausen, Robert, et al.
Published: (2023)
Active Learning For Contextual Linear Optimization: A Margin-Based Approach
by: Liu, Mo, et al.
Published: (2023)
by: Liu, Mo, et al.
Published: (2023)
On the Reliability Limits of LLM-Based Multi-Agent Planning
by: Ao, Ruicheng, et al.
Published: (2026)
by: Ao, Ruicheng, et al.
Published: (2026)
Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
by: Di, Qiwei, et al.
Published: (2023)
by: Di, Qiwei, et al.
Published: (2023)
Bilevel Optimization with Lower-Level Uniform Convexity: Theory and Algorithm
by: Wu, Yuman, et al.
Published: (2026)
by: Wu, Yuman, et al.
Published: (2026)
Data-driven Piecewise Affine Decision Rules for Stochastic Programming with Covariate Information
by: Zhang, Yiyang, et al.
Published: (2023)
by: Zhang, Yiyang, et al.
Published: (2023)
Harnessing Unimodality in Semiparametric Contextual Pricing via Oracle Price Map Learning
by: Fan, Yingying, et al.
Published: (2026)
by: Fan, Yingying, et al.
Published: (2026)
Sharper Guarantees for Misspecified Kernelized Bandit Optimization
by: Maran, Davide, et al.
Published: (2026)
by: Maran, Davide, et al.
Published: (2026)
Similar Items
-
Learning to Stop: Deep Learning for Mean Field Optimal Stopping
by: Magnino, Lorenzo, et al.
Published: (2024) -
Early Stopping in Contextual Bandits and Inferences
by: Cui, Zihan
Published: (2025) -
Deep Learning for the Multiple Optimal Stopping Problem
by: Laurière, Mathieu, et al.
Published: (2025) -
Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences
by: Aolaritei, Liviu, et al.
Published: (2025) -
Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
by: Crawshaw, Michael, et al.
Published: (2025)