Image de couverture de livre

Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jun, Kwang-Sung, Kim, Jungtaek
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits
par: Lee, Junghyun, et autres
Publié: (2024)

Beyond Regrets: Geometric Metrics for Bayesian Optimization
par: Kim, Jungtaek
Publié: (2024)

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
par: Lee, Junghyun, et autres
Publié: (2023)

Density Ratio Estimation-based Bayesian Optimization with Semi-Supervised Learning
par: Kim, Jungtaek
Publié: (2023)

Minimum Empirical Divergence for Sub-Gaussian Linear Bandits
par: Balagopalan, Kapilan, et autres
Publié: (2024)

Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits
par: Jang, Kyoungseok, et autres
Publié: (2024)

Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards
par: Qin, Hao, et autres
Publié: (2023)

Nearly Optimal Active Preference Learning and Its Application to LLM Alignment
par: Zhao, Yao, et autres
Publié: (2026)

Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
par: Huang, Ziyi, et autres
Publié: (2024)

Learning Explainable Dense Reward Shapes via Bayesian Optimization
par: Koo, Ryan, et autres
Publié: (2025)

Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezing
par: Ryu, J. Jon, et autres
Publié: (2025)

Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles
par: Kim, Jung-hun, et autres
Publié: (2017)

Linear Bandits with Non-i.i.d. Noise
par: Abélès, Baptiste, et autres
Publié: (2025)

Generalized Linear Bandits with Limited Adaptivity
par: Sawarni, Ayush, et autres
Publié: (2024)

Generalized Neural Sorting Networks with Error-Free Differentiable Swap Functions
par: Kim, Jungtaek, et autres
Publié: (2023)

Fixed Confidence Best Arm Identification in the Bayesian Setting
par: Jang, Kyoungseok, et autres
Publié: (2024)

Transformers in the Dark: Navigating Unknown Search Spaces via Bandit Feedback
par: Kim, Jungtaek, et autres
Publié: (2026)

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
par: Jin, Tianyuan, et autres
Publié: (2024)

Adaptive Experimentation When You Can't Experiment
par: Zhao, Yao, et autres
Publié: (2024)

Second-Order Bounds for [0,1]-Valued Regression via Betting Loss
par: Li, Yinan, et autres
Publié: (2025)

HAVER: Instance-Dependent Error Bounds for Maximum Mean Estimation and Applications to Q-Learning and Monte Carlo Tree Search
par: Nguyen, Tuan Ngo, et autres
Publié: (2024)

Towards Noise-Resilient Quantum Multi-Armed and Stochastic Linear Bandits
par: Chen, Zhuoyue, et autres
Publié: (2026)

Combinatorial Bandit Bayesian Optimization for Tensor Outputs
par: Huang, Jingru, et autres
Publié: (2026)

Adaptive Sample Sharing for Multi Agent Linear Bandits
par: Cherkaoui, Hamza, et autres
Publié: (2023)

Bandit Pareto Set Identification in a Multi-Output Linear Model
par: Kone, Cyrille, et autres
Publié: (2025)

LinearAPT: An Adaptive Algorithm for the Fixed-Budget Thresholding Linear Bandit Problem
par: Wu, Yun-Ang, et autres
Publié: (2024)

Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits
par: Iwazaki, Shogo
Publié: (2025)

Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting
par: Yang, Sifan, et autres
Publié: (2025)

Quantum Non-Linear Bandit Optimization
par: Siam, Zakaria Shams, et autres
Publié: (2025)

Weighted Sequential Bayesian Inference for Non-Stationary Linear Contextual Bandits
par: Werge, Nicklas, et autres
Publié: (2023)

On the Power of Adaptivity for $\varepsilon$-Best Arm Identification in Linear Bandits
par: Maiti, Arnab, et autres
Publié: (2026)

Budget-Aware Sequential Brick Assembly with Efficient Constraint Satisfaction
par: Ahn, Seokjun, et autres
Publié: (2022)

Efficient Matroid Bandit Linear Optimization Leveraging Unimodality
par: Delage, Aurélien, et autres
Publié: (2025)

Linear Bandits with Partially Observable Features
par: Kim, Wonyoung, et autres
Publié: (2025)

HyperArm Bandit Optimization: A Novel approach to Hyperparameter Optimization and an Analysis of Bandit Algorithms in Stochastic and Adversarial Settings
par: Karroum, Samih, et autres
Publié: (2025)

Fixed Budget is No Harder Than Fixed Confidence in Best-Arm Identification up to Logarithmic Factors
par: Balagopalan, Kapilan, et autres
Publié: (2026)

Causal Bandits: The Pareto Optimal Frontier of Adaptivity, a Reduction to Linear Bandits, and Limitations around Unknown Marginals
par: Liu, Ziyi, et autres
Publié: (2024)

Improved Online Confidence Bounds for Multinomial Logistic Bandits
par: Lee, Joongkyu, et autres
Publié: (2025)

Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits
par: Kang, Yue, et autres
Publié: (2023)

Adversarial Bandit Optimization with Globally Bounded Perturbations to Linear Losses
par: Cheng, Zhuoyu, et autres
Publié: (2026)