Imagen de Portada

Optimal High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Ye, Haishan
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Improved Regret for Bandit Convex Optimization with Delayed Feedback
por: Wan, Yuanyu, et al.
Publicado: (2024)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
por: Barakat, Anas, et al.
Publicado: (2026)

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
por: Hua, Youqing, et al.
Publicado: (2024)

Alternating Regret for Online Convex Optimization
por: Hait, Soumita, et al.
Publicado: (2025)

Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications
por: Yang, Sifan, et al.
Publicado: (2026)

Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
por: Lancewicki, Tal, et al.
Publicado: (2025)

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
por: Cassel, Asaf, et al.
Publicado: (2024)

Optimal Regret for Policy Optimization in Contextual Bandits
por: Levy, Orin, et al.
Publicado: (2026)

Stochastic Online Instrumental Variable Regression: Regrets for Endogeneity and Bandit Feedback
por: Della Vecchia, Riccardo, et al.
Publicado: (2023)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
por: Ba, Wenjia, et al.
Publicado: (2021)

Safe Online Convex Optimization with Multi-Point Feedback
por: Hutchinson, Spencer, et al.
Publicado: (2024)

Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously
por: Pasteris, Stephen, et al.
Publicado: (2024)

Optimal Regret for Single Index Bandits
por: Dey, Devdan, et al.
Publicado: (2026)

Small Gradient Norm Regret for Online Convex Optimization
por: Gao, Wenzhi, et al.
Publicado: (2026)

Information Capacity Regret Bounds for Bandits with Mediator Feedback
por: Eldowa, Khaled, et al.
Publicado: (2024)

Near-Optimal Regret in Adversarial Kernel Bandits
por: Zhang, Yu-Jie, et al.
Publicado: (2026)

Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting
por: Yang, Sifan, et al.
Publicado: (2025)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
por: Ye, Zichun, et al.
Publicado: (2025)

Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback
por: Schlisselberg, Ofir, et al.
Publicado: (2025)

Online Prediction of Stochastic Sequences with High Probability Regret Bounds
por: Frey, Matthias, et al.
Publicado: (2026)

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
por: Zhao, Peng, et al.
Publicado: (2021)

Discounted Online Convex Optimization: Uniform Regret Across a Continuous Interval
por: Yang, Wenhao, et al.
Publicado: (2025)

Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
por: Supantha, Subhamon, et al.
Publicado: (2025)

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
por: Lee, Joongkyu, et al.
Publicado: (2024)

Adaptivity and Universality: Problem-dependent Universal Regret for Online Convex Optimization
por: Zhao, Peng, et al.
Publicado: (2025)

Exploiting Curvature in Online Convex Optimization with Delayed Feedback
por: Qiu, Hao, et al.
Publicado: (2025)

Bayesian Optimization from Human Feedback: Near-Optimal Regret Bounds
por: Kayal, Aya, et al.
Publicado: (2025)

Near-Optimal Distributed Minimax Optimization under the Second-Order Similarity
por: Zhou, Qihao, et al.
Publicado: (2024)

Optimal-Point Variance Reduction For Bayesian Optimization With Regret Guarantee
por: Takeno, Shion
Publicado: (2026)

Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms
por: Tatlı, Meltem, et al.
Publicado: (2025)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
por: Jia, Tingkai, et al.
Publicado: (2026)

Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
por: Liu, Zijian
Publicado: (2025)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
por: Réveillard, William, et al.
Publicado: (2025)

On the Optimal Regret of Locally Private Linear Contextual Bandit
por: Li, Jiachun, et al.
Publicado: (2024)

Adaptive Regret for Bandits Made Possible: Two Queries Suffice
por: Lu, Zhou, et al.
Publicado: (2024)

Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
por: Levy, Orin, et al.
Publicado: (2025)

Structure-Dependent Regret and Constraint Violation Bounds for Online Convex Optimization with Time-Varying Constraints
por: Liu, Xiufeng, et al.
Publicado: (2026)

Decentralized Online Convex Optimization with Unknown Feedback Delays
por: Qiu, Hao, et al.
Publicado: (2026)

On the Minimax Regret in Online Ranking with Top-k Feedback
por: Zhang, Mingyuan, et al.
Publicado: (2023)

Optimal Clustering with Bandit Feedback
por: Yang, Junwen, et al.
Publicado: (2022)