Imagen de Portada

Bandit Convex Optimisation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Lattimore, Tor
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Online Newton Method for Bandit Convex Optimisation
por: Fokkema, Hidde, et al.
Publicado: (2024)

A Passivity-Based Method for Accelerated Convex Optimisation
por: Cho, Namhoon, et al.
Publicado: (2023)

A Lyapunov Analysis of Softmax Policy Gradient for Stochastic Bandits
por: Lattimore, Tor
Publicado: (2026)

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
por: Zhan, Jingxin, et al.
Publicado: (2025)

A Diffusion Analysis of Policy Gradient for Stochastic Bandits
por: Lattimore, Tor
Publicado: (2026)

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

Are Convex Optimization Curves Convex?
por: Barzilai, Guy, et al.
Publicado: (2025)

Monotone Optimisation with Learned Projections
por: Rashwan, Ahmed, et al.
Publicado: (2026)

Bayesian Optimisation: Which Constraints Matter?
por: Lin, Xietao Wang, et al.
Publicado: (2025)

Principled Bayesian Optimisation in Collaboration with Human Experts
por: Xu, Wenjie, et al.
Publicado: (2024)

Imitation Learning for Combinatorial Optimisation under Uncertainty
por: Gawas, Prakash, et al.
Publicado: (2026)

An Asynchronous Decentralised Optimisation Algorithm for Nonconvex Problems
por: Mafakheri, Behnam, et al.
Publicado: (2025)

Contextual Bandits with Budgeted Information Reveal
por: Gan, Kyra, et al.
Publicado: (2023)

Decentralized Contextual Bandits with Network Adaptivity
por: Deng, Chuyun, et al.
Publicado: (2025)

The Safety-Privacy Tradeoff in Linear Bandits
por: Zibaie, Arghavan, et al.
Publicado: (2025)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
por: Dahal, Hari, et al.
Publicado: (2023)

Learning to Sparsify Stochastic Linear Bandits
por: Wang, Zhengmiao, et al.
Publicado: (2026)

Tight Rates for Bandit Control Beyond Quadratics
por: Sun, Y. Jennifer, et al.
Publicado: (2024)

Sharper Guarantees for Misspecified Kernelized Bandit Optimization
por: Maran, Davide, et al.
Publicado: (2026)

Combinatorial Causal Bandits without Graph Skeleton
por: Feng, Shi, et al.
Publicado: (2023)

Bandit Allocational Instability
por: Chen, Yilun, et al.
Publicado: (2026)

Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings
por: Markou, Evan, et al.
Publicado: (2025)

Feel-Good Thompson Sampling for Contextual Dueling Bandits
por: Li, Xuheng, et al.
Publicado: (2024)

Multi-User Contextual Cascading Bandits for Personalized Recommendation
por: Park, Jiho, et al.
Publicado: (2025)

Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
por: Yahmed, Ahmed Ben, et al.
Publicado: (2025)

Low-Complexity Algorithm for Restless Bandits with Imperfect Observations
por: Liu, Keqin, et al.
Publicado: (2021)

The Price of Adaptivity in Stochastic Convex Optimization
por: Carmon, Yair, et al.
Publicado: (2024)

Stochastic Difference-of-Convex Optimization with Momentum
por: Chayti, El Mahdi, et al.
Publicado: (2025)

Online Convex Optimization with Unbounded Memory
por: Kumar, Raunak, et al.
Publicado: (2022)

Astral Space: Convex Analysis at Infinity
por: Dudík, Miroslav, et al.
Publicado: (2022)

Smooth Quasar-Convex Optimization with Constraints
por: Martínez-Rubio, David
Publicado: (2025)

Unconstrained Robust Online Convex Optimization
por: Zhang, Jiujia, et al.
Publicado: (2025)

Explore-then-Commit for Nonstationary Linear Bandits with Latent Dynamics
por: Choi, Sunmook, et al.
Publicado: (2025)

Weakly Convex Regularisers for Inverse Problems: Convergence of Critical Points and Primal-Dual Optimisation
por: Shumaylov, Zakhar, et al.
Publicado: (2024)

Variance-Aware Feel-Good Thompson Sampling for Contextual Bandits
por: Li, Xuheng, et al.
Publicado: (2025)

Signature Approach for Contextual Bandits with Nonlinear and Path-dependent Rewards
por: Guo, Xin, et al.
Publicado: (2026)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
por: Di, Qiwei, et al.
Publicado: (2023)

Optimal Rates for Robust Stochastic Convex Optimization
por: Gao, Changyu, et al.
Publicado: (2024)

Shuffling Momentum Gradient Algorithm for Convex Optimization
por: Tran, Trang H., et al.
Publicado: (2024)

Online Convex Optimization with Memory and Limited Predictions
por: Wang, Zhengmiao, et al.
Publicado: (2024)