Image de couverture de livre

Online Newton Method for Bandit Convex Optimisation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fokkema, Hidde, van der Hoeven, Dirk, Lattimore, Tor, Mayo, Jack J.
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

Bandit Convex Optimisation
par: Lattimore, Tor
Publié: (2024)

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

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

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

Inference of Online Newton Methods with Nesterov's Accelerated Sketching
par: Wang, Haoxuan, et autres
Publié: (2026)

Online Learning Guided Quasi-Newton Methods with Global Non-Asymptotic Convergence
par: Jiang, Ruichen, et autres
Publié: (2024)

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

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
par: Sachs, Sarah, et autres
Publié: (2023)

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

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

Stochastic Newton Proximal Extragradient Method
par: Jiang, Ruichen, et autres
Publié: (2024)

Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton Methods
par: Jiang, Ruichen, et autres
Publié: (2024)

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

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

Online Convex Optimization with a Separation Oracle
par: Mhammedi, Zakaria
Publié: (2024)

Online Covariance Matrix Estimation in Sketched Newton Methods
par: Kuang, Wei, et autres
Publié: (2025)

Sharpened Lazy Incremental Quasi-Newton Method
par: Lahoti, Aakash, et autres
Publié: (2023)

Online Non-Stationary Stochastic Quasar-Convex Optimization
par: Pun, Yuen-Man, et autres
Publié: (2024)

Safe Online Convex Optimization with Multi-Point Feedback
par: Hutchinson, Spencer, et autres
Publié: (2024)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
par: Sinha, Abhishek, et autres
Publié: (2024)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
par: Lekeufack, Jordan, et autres
Publié: (2024)

Constrained Online Convex Optimization with Polyak Feasibility Steps
par: Hutchinson, Spencer, et autres
Publié: (2025)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
par: Sinha, Abhishek, et autres
Publié: (2023)

Learning-Augmented Decentralized Online Convex Optimization in Networks
par: Li, Pengfei, et autres
Publié: (2023)

Small Gradient Norm Regret for Online Convex Optimization
par: Gao, Wenzhi, et autres
Publié: (2026)

Distributed Online Convex Optimization with Nonseparable Costs and Constraints
par: Pan, Zhaoye, et autres
Publié: (2026)

Online (Non-)Convex Learning via Tempered Optimism
par: Haddouche, Maxime, et autres
Publié: (2023)

Incremental Gauss--Newton Methods with Superlinear Convergence Rates
par: Zhou, Zhiling, et autres
Publié: (2024)

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

DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback
par: Xiong, Guojun, et autres
Publié: (2024)

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
par: Hihat, Massil, et autres
Publié: (2023)

Projection-Free Online Convex Optimization with Time-Varying Constraints
par: Garber, Dan, et autres
Publié: (2024)

Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
par: Hutchinson, Spencer, et autres
Publié: (2024)

Universal Online Convex Optimization with $1$ Projection per Round
par: Yang, Wenhao, et autres
Publié: (2024)

Universal Online Convex Optimization Meets Second-order Bounds
par: Zhang, Lijun, et autres
Publié: (2021)

Projection-free Online Learning over Strongly Convex Sets
par: Wan, Yuanyu, et autres
Publié: (2020)

Bayesian Optimization for Non-Convex Two-Stage Stochastic Optimization Problems
par: Buckingham, Jack M., et autres
Publié: (2024)

Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates
par: Liu, Zhuanghua, et autres
Publié: (2024)

Higher-Order Newton Methods with Polynomial Work per Iteration
par: Ahmadi, Amir Ali, et autres
Publié: (2023)

A Smoothing Newton Method for Rank-one Matrix Recovery
par: Maunu, Tyler, et autres
Publié: (2025)