Image de couverture de livre

Bandit Convex Optimisation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Lattimore, Tor
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Newton Method for Bandit Convex Optimisation
par: Fokkema, Hidde, et autres
Publié: (2024)

A Passivity-Based Method for Accelerated Convex Optimisation
par: Cho, Namhoon, et autres
Publié: (2023)

A Lyapunov Analysis of Softmax Policy Gradient for Stochastic Bandits
par: Lattimore, Tor
Publié: (2026)

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
par: Zhan, Jingxin, et autres
Publié: (2025)

A Diffusion Analysis of Policy Gradient for Stochastic Bandits
par: Lattimore, Tor
Publié: (2026)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
par: Barakat, Anas, et autres
Publié: (2026)

Are Convex Optimization Curves Convex?
par: Barzilai, Guy, et autres
Publié: (2025)

Monotone Optimisation with Learned Projections
par: Rashwan, Ahmed, et autres
Publié: (2026)

Bayesian Optimisation: Which Constraints Matter?
par: Lin, Xietao Wang, et autres
Publié: (2025)

Principled Bayesian Optimisation in Collaboration with Human Experts
par: Xu, Wenjie, et autres
Publié: (2024)

Imitation Learning for Combinatorial Optimisation under Uncertainty
par: Gawas, Prakash, et autres
Publié: (2026)

An Asynchronous Decentralised Optimisation Algorithm for Nonconvex Problems
par: Mafakheri, Behnam, et autres
Publié: (2025)

Contextual Bandits with Budgeted Information Reveal
par: Gan, Kyra, et autres
Publié: (2023)

Decentralized Contextual Bandits with Network Adaptivity
par: Deng, Chuyun, et autres
Publié: (2025)

The Safety-Privacy Tradeoff in Linear Bandits
par: Zibaie, Arghavan, et autres
Publié: (2025)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
par: Dahal, Hari, et autres
Publié: (2023)

Learning to Sparsify Stochastic Linear Bandits
par: Wang, Zhengmiao, et autres
Publié: (2026)

Tight Rates for Bandit Control Beyond Quadratics
par: Sun, Y. Jennifer, et autres
Publié: (2024)

Sharper Guarantees for Misspecified Kernelized Bandit Optimization
par: Maran, Davide, et autres
Publié: (2026)

Combinatorial Causal Bandits without Graph Skeleton
par: Feng, Shi, et autres
Publié: (2023)

Bandit Allocational Instability
par: Chen, Yilun, et autres
Publié: (2026)

Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings
par: Markou, Evan, et autres
Publié: (2025)

Feel-Good Thompson Sampling for Contextual Dueling Bandits
par: Li, Xuheng, et autres
Publié: (2024)

Multi-User Contextual Cascading Bandits for Personalized Recommendation
par: Park, Jiho, et autres
Publié: (2025)

Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
par: Yahmed, Ahmed Ben, et autres
Publié: (2025)

Low-Complexity Algorithm for Restless Bandits with Imperfect Observations
par: Liu, Keqin, et autres
Publié: (2021)

The Price of Adaptivity in Stochastic Convex Optimization
par: Carmon, Yair, et autres
Publié: (2024)

Stochastic Difference-of-Convex Optimization with Momentum
par: Chayti, El Mahdi, et autres
Publié: (2025)

Online Convex Optimization with Unbounded Memory
par: Kumar, Raunak, et autres
Publié: (2022)

Astral Space: Convex Analysis at Infinity
par: Dudík, Miroslav, et autres
Publié: (2022)

Smooth Quasar-Convex Optimization with Constraints
par: Martínez-Rubio, David
Publié: (2025)

Unconstrained Robust Online Convex Optimization
par: Zhang, Jiujia, et autres
Publié: (2025)

Explore-then-Commit for Nonstationary Linear Bandits with Latent Dynamics
par: Choi, Sunmook, et autres
Publié: (2025)

Weakly Convex Regularisers for Inverse Problems: Convergence of Critical Points and Primal-Dual Optimisation
par: Shumaylov, Zakhar, et autres
Publié: (2024)

Variance-Aware Feel-Good Thompson Sampling for Contextual Bandits
par: Li, Xuheng, et autres
Publié: (2025)

Signature Approach for Contextual Bandits with Nonlinear and Path-dependent Rewards
par: Guo, Xin, et autres
Publié: (2026)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
par: Di, Qiwei, et autres
Publié: (2023)

Optimal Rates for Robust Stochastic Convex Optimization
par: Gao, Changyu, et autres
Publié: (2024)

Shuffling Momentum Gradient Algorithm for Convex Optimization
par: Tran, Trang H., et autres
Publié: (2024)

Online Convex Optimization with Memory and Limited Predictions
par: Wang, Zhengmiao, et autres
Publié: (2024)