Image de couverture de livre

Bandit Convex Optimization with Gradient Prediction Adaptivity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wang, Shuche, Barik, Adarsh, Tan, Vincent Y. F.
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Mirror Descent-Based Algorithm for Corruption-Tolerant Distributed Gradient Descent
par: Wang, Shuche, et autres
Publié: (2024)

Parameter-free Algorithms for the Stochastically Extended Adversarial Model
par: Wang, Shuche, et autres
Publié: (2025)

p-Mean Regret for Stochastic Bandits
par: Krishna, Anand, et autres
Publié: (2024)

Optimal Clustering with Bandit Feedback
par: Yang, Junwen, et autres
Publié: (2022)

Indexed Minimum Empirical Divergence-Based Algorithms for Linear Bandits
par: Bian, Jie, et autres
Publié: (2024)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
par: Yang, Junwen, et autres
Publié: (2024)

Optimal Best Arm Identification with Fixed Confidence in Restless Bandits
par: Karthik, P. N., et autres
Publié: (2023)

Quantum-Enhanced Neural Contextual Bandit Algorithms
par: Huang, Yuqi, et autres
Publié: (2026)

On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits
par: Hou, Yunlong, et autres
Publié: (2026)

Almost Minimax Optimal Best Arm Identification in Piecewise Stationary Linear Bandits
par: Hou, Yunlong, et autres
Publié: (2024)

LEARN: An Invex Loss for Outlier Oblivious Robust Online Optimization
par: Barik, Adarsh, et autres
Publié: (2024)

A General Framework for Clustering and Distribution Matching with Bandit Feedback
par: Yavas, Recep Can, et autres
Publié: (2024)

Best Arm Identification with Minimal Regret
par: Yang, Junwen, et autres
Publié: (2024)

A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval
par: Barik, Adarsh, et autres
Publié: (2024)

On the Exponential Convergence for Offline RLHF with Pairwise Comparisons
par: Chen, Zhirui, et autres
Publié: (2024)

Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget
par: Bian, Jie, et autres
Publié: (2025)

Avoiding the Price of Adaptivity: Inference in Linear Contextual Bandits via Stability
par: Praharaj, Samya, et autres
Publié: (2025)

Almost Asymptotically Optimal Active Clustering Through Pairwise Observations
par: Teo, Rachel S. Y., et autres
Publié: (2026)

Best Arm Identification with Possibly Biased Offline Data
par: Yang, Le, et autres
Publié: (2025)

Influence Maximization via Graph Neural Bandits
par: Feng, Yuting, et autres
Publié: (2024)

Transformers Provably Learn Directed Acyclic Graphs via Kernel-Guided Mutual Information
par: Cheng, Yuan, et autres
Publié: (2025)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
par: Liu, Yujie, et autres
Publié: (2025)

Conversational Dueling Bandits in Generalized Linear Models
par: Yang, Shuhua, et autres
Publié: (2024)

Restless Linear Bandits
par: Khaleghi, Azadeh
Publié: (2024)

Characterizing the Accuracy-Communication-Privacy Trade-off in Distributed Stochastic Convex Optimization
par: Salgia, Sudeep, et autres
Publié: (2025)

ODELoRA: Training Low-Rank Adaptation by Solving Ordinary Differential Equations
par: Gao, Yihang, et autres
Publié: (2026)

Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization
par: Gao, Yihang, et autres
Publié: (2025)

Batched Kernelized Bandits: Refinements and Extensions
par: Ma, Chenkai, et autres
Publié: (2026)

Optimal Arm Elimination Algorithms for Combinatorial Bandits
par: Wen, Yuxiao, et autres
Publié: (2025)

Lower Bounds for Time-Varying Kernelized Bandits
par: Cai, Xu, et autres
Publié: (2024)

A Modularized Framework for Piecewise-Stationary Restless Bandits
par: Li, Kuan-Ta, et autres
Publié: (2026)

Competing Bandits in Matching Markets via Super Stability
par: Basu, Soumya
Publié: (2025)

Quantile Multi-Armed Bandits with 1-bit Feedback
par: Lau, Ivan, et autres
Publié: (2025)

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
par: Li, Zihan, et autres
Publié: (2022)

Online Clustering of Data Sequences with Bandit Information
par: Chandran, G Dhinesh, et autres
Publié: (2025)

Fixed-Budget Differentially Private Best Arm Identification
par: Chen, Zhirui, et autres
Publié: (2024)

Optimal Multi-Objective Best Arm Identification with Fixed Confidence
par: Chen, Zhirui, et autres
Publié: (2025)

Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
par: Panda, Subhodip, et autres
Publié: (2026)

Spectrum Prediction in the Fractional Fourier Domain with Adaptive Filtering
par: Qin, Yanghao, et autres
Publié: (2025)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
par: Tajdini, Artin, et autres
Publié: (2025)