Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tran-The, Hung, Gupta, Sunil, Rana, Santu, Ha, Huong, Venkatesh, Svetha
Format:	Preprint
Published:	2020
Subjects:	Machine Learning Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bayesian Optimistic Optimisation with Exponentially Decaying Regret
by: Tran-The, Hung, et al.
Published: (2021)

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

Trading Convergence Rate with Computational Budget in High Dimensional Bayesian Optimization
by: Tran-The, Hung, et al.
Published: (2019)

Novel Kernel Models and Exact Representor Theory for Neural Networks Beyond the Over-Parameterized Regime
by: Shilton, Alistair, et al.
Published: (2024)

Enhanced Bayesian Optimization via Preferential Modeling of Abstract Properties
by: A V, Arun Kumar, et al.
Published: (2024)

Efficient Symmetry-Aware Materials Generation via Hierarchical Generative Flow Networks
by: Nguyen, Tri Minh, et al.
Published: (2024)

Tight Regret Bounds for Bayesian Optimization in One Dimension
by: Scarlett, Jonathan
Published: (2018)

Score-based Integrated Gradient for Root Cause Explanations of Outliers
by: Nguyen, Phuoc, et al.
Published: (2026)

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

Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal
by: Ziomek, Juliusz, et al.
Published: (2024)

Online Prediction of Stochastic Sequences with High Probability Regret Bounds
by: Frey, Matthias, et al.
Published: (2026)

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

Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality
by: Bongole, Raghav, et al.
Published: (2024)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)

Stable Hadamard Memory: Revitalizing Memory-Augmented Agents for Reinforcement Learning
by: Le, Hung, et al.
Published: (2024)

Order Optimal Regret Bounds for Sharpe Ratio Optimization under Thompson Sampling
by: Shah, Mohammad Taha, et al.
Published: (2025)

Federated Domain Generalization with Latent Space Inversion
by: Palakkadavath, Ragja, et al.
Published: (2025)

Continual Fine-Tuning of Large Language Models via Program Memory
by: Le, Hung, et al.
Published: (2026)

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

Revisiting the Dataset Bias Problem from a Statistical Perspective
by: Do, Kien, et al.
Published: (2024)

No-Regret Bayesian Recommendation to Homogeneous Users
by: Feng, Yiding, et al.
Published: (2022)

Composite Concept Extraction through Backdooring
by: Ghosh, Banibrata, et al.
Published: (2024)

Adaptive Acquisition Selection for Bayesian Optimization with Large Language Models
by: Ngo, Giang, et al.
Published: (2026)

Matrix Completion in Group Testing: Bounds and Simulations
by: Tran, Trung-Khang, et al.
Published: (2025)

Bayesian Optimization for Unknown Cost-Varying Variable Subsets with No-Regret Costs
by: Hoang, Vu Viet, et al.
Published: (2024)

Provably Efficient Bayesian Optimization with Unknown Gaussian Process Hyperparameter Estimation
by: Ha, Huong, et al.
Published: (2023)

A DPI-PAC-Bayesian Framework for Generalization Bounds
by: Guan, Muhan, et al.
Published: (2025)

On the Regret of Coded Caching with Adversarial Requests
by: Nayak, Anupam, et al.
Published: (2024)

Best Arm Identification with Minimal Regret
by: Yang, Junwen, et al.
Published: (2024)

The Geometric Cost of Normalization: Affine Bounds on the Bayesian Complexity of Neural Networks
by: Chun, Sungbae
Published: (2026)

Game of Coding With an Unknown Adversary
by: Akbarinodehi, Hanzaleh, et al.
Published: (2025)

Towards A Unified PAC-Bayesian Framework for Norm-based Generalization Bounds
by: Yi, Xinping, et al.
Published: (2026)

The Conditional Regret-Capacity Theorem for Batch Universal Prediction
by: Bondaschi, Marco, et al.
Published: (2025)

Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
by: Panda, Subhodip, et al.
Published: (2026)

Complexity as Advantage: A Regret-Based Perspective on Emergent Structure
by: Naparstek, Oshri
Published: (2025)

On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy
by: Jia, Zeyu, et al.
Published: (2025)

An Empirical Study on Ensemble-Based Transfer Learning Bayesian Optimisation with Mixed Variable Types
by: Trinkle, Natasha, et al.
Published: (2026)

Learning from Many and Adapting to the Unknown in Open-set Test Streams
by: Zhang, Xiao, et al.
Published: (2026)

Age Optimal Sampling for Unreliable Channels under Unknown Channel Statistics
by: He, Hongyi, et al.
Published: (2024)

Generating Realistic Tabular Data with Large Language Models
by: Nguyen, Dang, et al.
Published: (2024)