Copertina

Online Newton Method for Bandit Convex Optimisation

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Fokkema, Hidde, van der Hoeven, Dirk, Lattimore, Tor, Mayo, Jack J.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Bandit Convex Optimisation
di: Lattimore, Tor
Pubblicazione: (2024)

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

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

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

Inference of Online Newton Methods with Nesterov's Accelerated Sketching
di: Wang, Haoxuan, et al.
Pubblicazione: (2026)

Online Learning Guided Quasi-Newton Methods with Global Non-Asymptotic Convergence
di: Jiang, Ruichen, et al.
Pubblicazione: (2024)

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

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
di: Sachs, Sarah, et al.
Pubblicazione: (2023)

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

Unconstrained Robust Online Convex Optimization
di: Zhang, Jiujia, et al.
Pubblicazione: (2025)

Stochastic Newton Proximal Extragradient Method
di: Jiang, Ruichen, et al.
Pubblicazione: (2024)

Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton Methods
di: Jiang, Ruichen, et al.
Pubblicazione: (2024)

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

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

Online Convex Optimization with a Separation Oracle
di: Mhammedi, Zakaria
Pubblicazione: (2024)

Online Covariance Matrix Estimation in Sketched Newton Methods
di: Kuang, Wei, et al.
Pubblicazione: (2025)

Sharpened Lazy Incremental Quasi-Newton Method
di: Lahoti, Aakash, et al.
Pubblicazione: (2023)

Online Non-Stationary Stochastic Quasar-Convex Optimization
di: Pun, Yuen-Man, et al.
Pubblicazione: (2024)

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

Tight Bounds for Online Convex Optimization with Adversarial Constraints
di: Sinha, Abhishek, et al.
Pubblicazione: (2024)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
di: Lekeufack, Jordan, et al.
Pubblicazione: (2024)

Constrained Online Convex Optimization with Polyak Feasibility Steps
di: Hutchinson, Spencer, et al.
Pubblicazione: (2025)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
di: Sinha, Abhishek, et al.
Pubblicazione: (2023)

Learning-Augmented Decentralized Online Convex Optimization in Networks
di: Li, Pengfei, et al.
Pubblicazione: (2023)

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

Distributed Online Convex Optimization with Nonseparable Costs and Constraints
di: Pan, Zhaoye, et al.
Pubblicazione: (2026)

Online (Non-)Convex Learning via Tempered Optimism
di: Haddouche, Maxime, et al.
Pubblicazione: (2023)

Incremental Gauss--Newton Methods with Superlinear Convergence Rates
di: Zhou, Zhiling, et al.
Pubblicazione: (2024)

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

DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback
di: Xiong, Guojun, et al.
Pubblicazione: (2024)

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
di: Hihat, Massil, et al.
Pubblicazione: (2023)

Projection-Free Online Convex Optimization with Time-Varying Constraints
di: Garber, Dan, et al.
Pubblicazione: (2024)

Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
di: Hutchinson, Spencer, et al.
Pubblicazione: (2024)

Universal Online Convex Optimization with $1$ Projection per Round
di: Yang, Wenhao, et al.
Pubblicazione: (2024)

Universal Online Convex Optimization Meets Second-order Bounds
di: Zhang, Lijun, et al.
Pubblicazione: (2021)

Projection-free Online Learning over Strongly Convex Sets
di: Wan, Yuanyu, et al.
Pubblicazione: (2020)

Bayesian Optimization for Non-Convex Two-Stage Stochastic Optimization Problems
di: Buckingham, Jack M., et al.
Pubblicazione: (2024)

Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates
di: Liu, Zhuanghua, et al.
Pubblicazione: (2024)

Higher-Order Newton Methods with Polynomial Work per Iteration
di: Ahmadi, Amir Ali, et al.
Pubblicazione: (2023)

A Smoothing Newton Method for Rank-one Matrix Recovery
di: Maunu, Tyler, et al.
Pubblicazione: (2025)