Cover Image

Sharper Guarantees for Misspecified Kernelized Bandit Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Maran, Davide, Szepesvári, Csaba
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Simultaneous Learning and Optimization via Misspecified Saddle Point Problems
by: Ahmadi, Mohammad Mahdi, et al.
Published: (2025)

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

Mitigating Covariate Shift in Misspecified Regression with Applications to Reinforcement Learning
by: Amortila, Philip, et al.
Published: (2024)

Shuffling the Data, Stretching the Step-size: Sharper Bias in constant step-size SGD
by: Emmanouilidis, Konstantinos, et al.
Published: (2026)

Towards Robust Learning to Optimize with Theoretical Guarantees
by: Song, Qingyu, et al.
Published: (2025)

Scalable Kernel Inverse Optimization
by: Long, Youyuan, et al.
Published: (2024)

Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees
by: Xiao, Nachuan, et al.
Published: (2023)

Stochastic Compositional Minimax Optimization with Provable Convergence Guarantees
by: Deng, Yuyang, et al.
Published: (2024)

Data-Driven Performance Guarantees for Classical and Learned Optimizers
by: Sambharya, Rajiv, et al.
Published: (2024)

Subspace Optimization for Large Language Models with Convergence Guarantees
by: He, Yutong, et al.
Published: (2024)

On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimization
by: Kornowski, Guy, et al.
Published: (2024)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
by: Zhang, Liang, et al.
Published: (2023)

FSNet: Feasibility-Seeking Neural Network for Constrained Optimization with Guarantees
by: Nguyen, Hoang T., et al.
Published: (2025)

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)

Learning to Optimize for Mixed-Integer Non-linear Programming with Feasibility Guarantees
by: Tang, Bo, et al.
Published: (2024)

Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms
by: Li, Yuchen, et al.
Published: (2024)

Learning-to-Optimize with PAC-Bayesian Guarantees: Theoretical Considerations and Practical Implementation
by: Sucker, Michael, et al.
Published: (2024)

Bayesian Optimization by Kernel Regression and Density-based Exploration
by: Zhu, Tansheng, et al.
Published: (2025)

Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimization
by: Jiang, Ruichen, et al.
Published: (2026)

Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees
by: Smith, Chandler, et al.
Published: (2024)

A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees
by: Zhou, Yuhao, et al.
Published: (2025)

Bandit Convex Optimisation
by: Lattimore, Tor
Published: (2024)

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
by: Hua, Youqing, et al.
Published: (2024)

BARK: A Fully Bayesian Tree Kernel for Black-box Optimization
by: Boyne, Toby, et al.
Published: (2025)

Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees
by: de Vazelhes, William, et al.
Published: (2025)

Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance
by: Zhang, Qi, et al.
Published: (2024)

Optimization and Generalization Guarantees for Weight Normalization
by: Cisneros-Velarde, Pedro, et al.
Published: (2024)

Rate Analysis of Coupled Distributed Stochastic Approximation for Misspecified Optimization
by: Yang, Yaqun, et al.
Published: (2024)

Safe Time-Varying Optimization based on Gaussian Processes with Spatio-Temporal Kernel
by: Li, Jialin, et al.
Published: (2024)

From PowerSGD to PowerSGD+: Low-Rank Gradient Compression for Distributed Optimization with Convergence Guarantees
by: Xie, Shengping, et al.
Published: (2025)

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

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

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

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

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

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

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

Global Optimization of Gaussian Process Acquisition Functions Using a Piecewise-Linear Kernel Approximation
by: Xie, Yilin, et al.
Published: (2024)

Bandit Allocational Instability
by: Chen, Yilun, et al.
Published: (2026)

On Performance Guarantees for Federated Learning with Personalized Constraints
by: Ebrahimi, Mohammadjavad, et al.
Published: (2026)