Cover Image

Tight Regret Bounds for Bayesian Optimization in One Dimension

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Scarlett, Jonathan
Format:	Preprint
Published:	2018
Subjects:	Machine Learning Information Theory Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
by: Zamir, Guy, et al.
Published: (2026)

Linear regression with overparameterized linear neural networks: Tight upper and lower bounds for implicit $\ell^1$-regularization
by: Matt, Hannes, et al.
Published: (2025)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
by: Li, Zihan, et al.
Published: (2022)

Wasserstein Distributionally Robust Estimation in High Dimensions: Performance Analysis and Optimal Hyperparameter Tuning
by: Aolaritei, Liviu, et al.
Published: (2022)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
by: Liu, Yujie, et al.
Published: (2025)

A Neural Network Algorithm for KL Divergence Estimation with Quantitative Error Bounds
by: Foss, Mikil, et al.
Published: (2025)

A Soft Inducement Framework for Incentive-Aided Steering of No-Regret Players
by: Yorulmaz, Asrin Efe, et al.
Published: (2025)

Geometry, Computation, and Optimality in Stochastic Optimization
by: Cheng, Chen, et al.
Published: (2019)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
by: Tajdini, Artin, et al.
Published: (2025)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
by: Shen, Wei, et al.
Published: (2023)

A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimization
by: Shen, Wei, et al.
Published: (2025)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
by: Yu, Qian, et al.
Published: (2024)

Tight Generalization Bounds for Noiseless Inverse Optimization
by: Fatemi, Pouria, et al.
Published: (2026)

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

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

Symmetric Rank-One Quasi-Newton Methods for Deep Learning Using Cubic Regularization
by: Ranganath, Aditya, et al.
Published: (2025)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation
by: Cui, Chengyu, et al.
Published: (2026)

Recovering Simultaneously Structured Data via Non-Convex Iteratively Reweighted Least Squares
by: Kümmerle, Christian, et al.
Published: (2023)

Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries
by: Ling, Shuyang
Published: (2021)

On the Robustness of Cross-Concentrated Sampling for Matrix Completion
by: Cai, HanQin, et al.
Published: (2024)

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2024)

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis
by: Zurek, Matthew, et al.
Published: (2024)

Variational Inference on the Boolean Hypercube with the Quantum Entropy
by: Beyler, Eliot, et al.
Published: (2024)

Span-Based Optimal Sample Complexity for Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2023)

A Dual Basis Approach for Structured Robust Euclidean Distance Geometry
by: Kundu, Chandra, et al.
Published: (2025)

Structured Sampling for Robust Euclidean Distance Geometry
by: Kundu, Chandra, et al.
Published: (2024)

The augmented NLP bound for maximum-entropy remote sampling
by: Ponte, Gabriel, et al.
Published: (2026)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
by: Zurek, Matthew, et al.
Published: (2025)

More is Less: Inducing Sparsity via Overparameterization
by: Chou, Hung-Hsu, et al.
Published: (2021)

On the Convergence Analysis of Muon
by: Shen, Wei, et al.
Published: (2025)

Adversarial Water-Filling: Theory, Algorithms and Foundation Model
by: Tong, Xindi, et al.
Published: (2026)

Group Projected Subspace Pursuit for Block Sparse Signal Reconstruction: Convergence Analysis and Applications
by: He, Roy Y., et al.
Published: (2024)

Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
by: Zurek, Matthew, et al.
Published: (2025)

MLorc: Momentum Low-rank Compression for Memory Efficient Large Language Model Adaptation
by: Shen, Wei, et al.
Published: (2025)

One if by Land, Two if by Sea, Three if by Four Seas, and More to Come -- Values of Perception, Prediction, Communication, and Common Sense in Decision Making
by: Xu, Aolin
Published: (2025)

Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
by: Sahinoglu, Emre, et al.
Published: (2025)

Reinforcement Learning and Regret Bounds for Admission Control
by: Weber, Lucas, et al.
Published: (2024)

Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization
by: Luo, Yuetian, et al.
Published: (2021)