Saved in:
| Main Authors: | Salgia, Sudeep, Vakili, Sattar, Zhao, Qing |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2310.15351 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Order-Optimal Regret in Distributed Kernel Bandits using Uniform Sampling with Shared Randomness
by: Pavlovic, Nikola, et al.
Published: (2024)
by: Pavlovic, Nikola, et al.
Published: (2024)
Open Problem: Order Optimal Regret Bounds for Kernel-Based Reinforcement Learning
by: Vakili, Sattar
Published: (2024)
by: Vakili, Sattar
Published: (2024)
Kernelized Reinforcement Learning with Order Optimal Regret Bounds
by: Vakili, Sattar, et al.
Published: (2023)
by: Vakili, Sattar, et al.
Published: (2023)
Distributed Linear Bandits under Communication Constraints
by: Salgia, Sudeep, et al.
Published: (2022)
by: Salgia, Sudeep, et al.
Published: (2022)
Differential Privacy in Kernelized Contextual Bandits via Random Projections
by: Pavlovic, Nikola, et al.
Published: (2025)
by: Pavlovic, Nikola, et al.
Published: (2025)
Bayesian Optimization from Human Feedback: Near-Optimal Regret Bounds
by: Kayal, Aya, et al.
Published: (2025)
by: Kayal, Aya, et al.
Published: (2025)
Differentially Private Kernelized Contextual Bandits
by: Pavlovic, Nikola, et al.
Published: (2025)
by: Pavlovic, Nikola, et al.
Published: (2025)
Characterizing the Accuracy-Communication-Privacy Trade-off in Distributed Stochastic Convex Optimization
by: Salgia, Sudeep, et al.
Published: (2025)
by: Salgia, Sudeep, et al.
Published: (2025)
Kernel-Based Function Approximation for Average Reward Reinforcement Learning: An Optimist No-Regret Algorithm
by: Vakili, Sattar, et al.
Published: (2024)
by: Vakili, Sattar, et al.
Published: (2024)
The Sample-Communication Complexity Trade-off in Federated Q-Learning
by: Salgia, Sudeep, et al.
Published: (2024)
by: Salgia, Sudeep, et al.
Published: (2024)
Learning Kernel-Based MDPs from Episodic Preferential Feedback
by: Pavlovic, Nikola, et al.
Published: (2026)
by: Pavlovic, Nikola, et al.
Published: (2026)
No-Regret Thompson Sampling for Finite-Horizon Markov Decision Processes with Gaussian Processes
by: Bayrooti, Jasmine, et al.
Published: (2025)
by: Bayrooti, Jasmine, et al.
Published: (2025)
A Finite Time Analysis of Thompson Sampling for Bayesian Optimization with Preferential Feedback
by: Lazzaro, Joseph, et al.
Published: (2026)
by: Lazzaro, Joseph, et al.
Published: (2026)
Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning
by: Kayal, Aya, et al.
Published: (2025)
by: Kayal, Aya, et al.
Published: (2025)
Randomized Kriging Believer for Parallel Bayesian Optimization with Regret Bounds
by: Sugiura, Shuhei, et al.
Published: (2026)
by: Sugiura, Shuhei, et al.
Published: (2026)
Optimal-Point Variance Reduction For Bayesian Optimization With Regret Guarantee
by: Takeno, Shion
Published: (2026)
by: Takeno, Shion
Published: (2026)
Direct Regret Optimization in Bayesian Optimization
by: Zhang, Fengxue, et al.
Published: (2025)
by: Zhang, Fengxue, et al.
Published: (2025)
Reinforcement Learning Using known Invariances
by: Cioba, Alexandru, et al.
Published: (2025)
by: Cioba, Alexandru, et al.
Published: (2025)
Optimal Bayesian Affine Estimator and Active Learning for the Wiener Model
by: Vakili, Sasan, et al.
Published: (2025)
by: Vakili, Sasan, et al.
Published: (2025)
Order Optimal Regret Bounds for Sharpe Ratio Optimization under Thompson Sampling
by: Shah, Mohammad Taha, et al.
Published: (2025)
by: Shah, Mohammad Taha, et al.
Published: (2025)
Stopping Bayesian Optimization with Probabilistic Regret Bounds
by: Wilson, James T.
Published: (2024)
by: Wilson, James T.
Published: (2024)
Beyond Regrets: Geometric Metrics for Bayesian Optimization
by: Kim, Jungtaek
Published: (2024)
by: Kim, Jungtaek
Published: (2024)
On Regret Bounds of Thompson Sampling for Bayesian Optimization
by: Takeno, Shion, et al.
Published: (2026)
by: Takeno, Shion, et al.
Published: (2026)
Optimal Regret for Policy Optimization in Contextual Bandits
by: Levy, Orin, et al.
Published: (2026)
by: Levy, Orin, et al.
Published: (2026)
Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Bounds
by: Takeno, Shion, et al.
Published: (2023)
by: Takeno, Shion, et al.
Published: (2023)
Bayesian Optimization with Expected Improvement: No Regret and the Choice of Incumbent
by: Wang, Jingyi, et al.
Published: (2025)
by: Wang, Jingyi, et al.
Published: (2025)
On Improved Regret Bounds In Bayesian Optimization with Gaussian Noise
by: Wang, Jingyi, et al.
Published: (2024)
by: Wang, Jingyi, et al.
Published: (2024)
No-Regret Algorithms for Safe Bayesian Optimization with Monotonicity Constraints
by: Losalka, Arpan, et al.
Published: (2024)
by: Losalka, Arpan, et al.
Published: (2024)
Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal
by: Ziomek, Juliusz, et al.
Published: (2024)
by: Ziomek, Juliusz, et al.
Published: (2024)
Optical Computing for Deep Neural Network Acceleration: Foundations, Recent Developments, and Emerging Directions
by: Pasricha, Sudeep
Published: (2024)
by: Pasricha, Sudeep
Published: (2024)
Many Needles in a Haystack: Active Hit Discovery for Perturbation Experiments
by: Rubbi, Andrea, et al.
Published: (2026)
by: Rubbi, Andrea, et al.
Published: (2026)
Worst-Case Regret Bounds for Exploration via Randomized Value Functions
by: Russo, Daniel
Published: (2019)
by: Russo, Daniel
Published: (2019)
Exploring Exploration in Bayesian Optimization
by: Papenmeier, Leonard, et al.
Published: (2025)
by: Papenmeier, Leonard, et al.
Published: (2025)
Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
by: Tsuchiya, Taira, et al.
Published: (2024)
by: Tsuchiya, Taira, et al.
Published: (2024)
Relaxing the Additivity Constraints in Decentralized No-Regret High-Dimensional Bayesian Optimization
by: Bardou, Anthony, et al.
Published: (2023)
by: Bardou, Anthony, et al.
Published: (2023)
Asymptotically Optimal Regret for Black-Box Predict-then-Optimize
by: Tan, Samuel, et al.
Published: (2024)
by: Tan, Samuel, et al.
Published: (2024)
Regret Analysis of Posterior Sampling-Based Expected Improvement for Bayesian Optimization
by: Takeno, Shion, et al.
Published: (2025)
by: Takeno, Shion, et al.
Published: (2025)
Bayesian Optimization for Unknown Cost-Varying Variable Subsets with No-Regret Costs
by: Hoang, Vu Viet, et al.
Published: (2024)
by: Hoang, Vu Viet, et al.
Published: (2024)
Regret-Based $(ε,δ)$-optimal Stopping Criteria for Bayesian Optimization
by: Wang, Haowei, et al.
Published: (2026)
by: Wang, Haowei, et al.
Published: (2026)
Tight Regret Bounds for Bayesian Optimization in One Dimension
by: Scarlett, Jonathan
Published: (2018)
by: Scarlett, Jonathan
Published: (2018)
Similar Items
-
Order-Optimal Regret in Distributed Kernel Bandits using Uniform Sampling with Shared Randomness
by: Pavlovic, Nikola, et al.
Published: (2024) -
Open Problem: Order Optimal Regret Bounds for Kernel-Based Reinforcement Learning
by: Vakili, Sattar
Published: (2024) -
Kernelized Reinforcement Learning with Order Optimal Regret Bounds
by: Vakili, Sattar, et al.
Published: (2023) -
Distributed Linear Bandits under Communication Constraints
by: Salgia, Sudeep, et al.
Published: (2022) -
Differential Privacy in Kernelized Contextual Bandits via Random Projections
by: Pavlovic, Nikola, et al.
Published: (2025)