Copertina

Efficient and Adaptive Posterior Sampling Algorithms for Bandits

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Hu, Bingshan, Huang, Zhiming, Zhang, Tianyue H., Lécuyer, Mathias, Hegde, Nidhi
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Connecting Thompson Sampling and UCB: Towards More Efficient Trade-offs Between Privacy and Regret
di: Hu, Bingshan, et al.
Pubblicazione: (2025)

Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment
di: Hu, Bingshan, et al.
Pubblicazione: (2021)

Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits
di: Huang, Zhiming, et al.
Pubblicazione: (2026)

Efficient kernelized bandit algorithms via exploration distributions
di: Hu, Bingshan, et al.
Pubblicazione: (2025)

On the Performance of Differentially Private Optimization with Heavy-Tail Class Imbalance
di: Tang, Qiaoyue, et al.
Pubblicazione: (2025)

Training and Evaluating Causal Forecasting Models for Time-Series
di: Crasson, Thomas, et al.
Pubblicazione: (2024)

Adaptive Randomized Smoothing: Certified Adversarial Robustness for Multi-Step Defences
di: Lyu, Saiyue, et al.
Pubblicazione: (2024)

BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms
di: Hou, Yunlong, et al.
Pubblicazione: (2025)

FedFetch: Faster Federated Learning with Adaptive Downstream Prefetching
di: Yan, Qifan, et al.
Pubblicazione: (2025)

Efficient and Interpretable Bandit Algorithms
di: Mukherjee, Subhojyoti, et al.
Pubblicazione: (2023)

Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
di: Huang, Ziyi, et al.
Pubblicazione: (2024)

Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
di: Goyal, Tanmay, et al.
Pubblicazione: (2025)

Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits
di: Zhou, Julien, et al.
Pubblicazione: (2024)

Thompson Sampling-like Algorithms for Stochastic Rising Bandits
di: Fiandri, Marco, et al.
Pubblicazione: (2025)

Adaptive Sample Sharing for Multi Agent Linear Bandits
di: Cherkaoui, Hamza, et al.
Pubblicazione: (2023)

Adaptive Prior Selection in Gaussian Process Bandits with Thompson Sampling
di: Sandberg, Jack, et al.
Pubblicazione: (2025)

Practical Bayesian Algorithm Execution via Posterior Sampling
di: Cheng, Chu Xin, et al.
Pubblicazione: (2024)

Adaptive Client Sampling in Federated Learning via Online Learning with Bandit Feedback
di: Zhao, Boxin, et al.
Pubblicazione: (2021)

Rising Rested Bandits: Lower Bounds and Efficient Algorithms
di: Fiandri, Marco, et al.
Pubblicazione: (2024)

Privacy Filters are Captured by Residues: A Characterization of Free Natural Filters and the Cost of Adaptivity
di: Regehr, Matthew, et al.
Pubblicazione: (2026)

Adaptive Bandit Algorithms for Contextual Matching Markets
di: Lin, Shiyun, et al.
Pubblicazione: (2026)

Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs
di: Kash, Ian A., et al.
Pubblicazione: (2022)

Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits
di: Sun, Jiazheng, et al.
Pubblicazione: (2025)

Adaptive Diffusion Denoised Smoothing : Certified Robustness via Randomized Smoothing with Differentially Private Guided Denoising Diffusion
di: Shpilevskiy, Frederick, et al.
Pubblicazione: (2025)

Optimal Streaming Algorithms for Multi-Armed Bandits
di: Jin, Tianyuan, et al.
Pubblicazione: (2024)

The Nah Bandit: Modeling User Non-compliance in Recommendation Systems
di: Zhou, Tianyue, et al.
Pubblicazione: (2024)

Active Sequential Posterior Estimation for Sample-Efficient Simulation-Based Inference
di: Griesemer, Sam, et al.
Pubblicazione: (2024)

LinearAPT: An Adaptive Algorithm for the Fixed-Budget Thresholding Linear Bandit Problem
di: Wu, Yun-Ang, et al.
Pubblicazione: (2024)

Instance-Adaptive Online Multicalibration
di: Huang, Zhiming, et al.
Pubblicazione: (2026)

Posterior Sampling for Continuing Environments
di: Xu, Wanqiao, et al.
Pubblicazione: (2022)

Q-learning with Posterior Sampling
di: Agrawal, Priyank, et al.
Pubblicazione: (2025)

Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox
di: Zhang, Raymond, et al.
Pubblicazione: (2024)

On Sample-Efficient Offline Reinforcement Learning: Data Diversity, Posterior Sampling, and Beyond
di: Nguyen-Tang, Thanh, et al.
Pubblicazione: (2024)

Efficient and Optimal Policy Gradient Algorithm for Corrupted Multi-armed Bandits
di: Liu, Jiayuan, et al.
Pubblicazione: (2025)

Efficient Best-of-Both-Worlds Algorithms for Contextual Combinatorial Semi-Bandits
di: Li, Mengmeng, et al.
Pubblicazione: (2025)

Linear Bandits on Ellipsoids: Minimax Optimal Algorithms
di: Zhang, Raymond, et al.
Pubblicazione: (2025)

Efficient Approximate Posterior Sampling with Annealed Langevin Monte Carlo
di: Parulekar, Advait, et al.
Pubblicazione: (2025)

FedPOB: Sample-Efficient Federated Prompt Optimization via Bandits
di: Lu, Pingchen, et al.
Pubblicazione: (2025)

Generator-Mediated Bandits: Thompson Sampling for GenAI-Powered Adaptive Interventions
di: Brooks, Marc, et al.
Pubblicazione: (2025)

Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits
di: Lin, Jiabin, et al.
Pubblicazione: (2024)