Copertina

An Information-Theoretic Analysis of Thompson Sampling with Infinite Action Spaces

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Gouverneur, Amaury, Gálvez, Borja Rodriguez, Oechtering, Tobias, Skoglund, Mikael
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

An Information-Theoretic Analysis of Thompson Sampling for Logistic Bandits
di: Gouverneur, Amaury, et al.
Pubblicazione: (2024)

Chained Information-Theoretic bounds and Tight Regret Rate for Linear Bandit Problems
di: Gouverneur, Amaury, et al.
Pubblicazione: (2024)

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

Refined PAC-Bayes Bounds for Offline Bandits
di: Gouverneur, Amaury, et al.
Pubblicazione: (2025)

An Information-Theoretic Approach to Generalization Theory
di: Rodríguez-Gálvez, Borja, et al.
Pubblicazione: (2024)

A Coding-Theoretic Analysis of Hyperspherical Prototypical Learning Geometry
di: Lindström, Martin, et al.
Pubblicazione: (2024)

Instantiating Bayesian CVaR lower bounds in Interactive Decision Making Problems
di: Bongole, Raghav, et al.
Pubblicazione: (2026)

More PAC-Bayes bounds: From bounded losses, to losses with general tail behaviors, to anytime validity
di: Rodríguez-Gálvez, Borja, et al.
Pubblicazione: (2023)

A note on generalization bounds for losses with finite moments
di: Rodríguez-Gálvez, Borja, et al.
Pubblicazione: (2024)

On Information Theoretic Fairness: Compressed Representations With Perfect Demographic Parity
di: Zamani, Amirreza, et al.
Pubblicazione: (2024)

Thompson Sampling for Stochastic Bandits with Noisy Contexts: An Information-Theoretic Regret Analysis
di: Jose, Sharu Theresa, et al.
Pubblicazione: (2024)

A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning
di: Filatrella, Dario, et al.
Pubblicazione: (2026)

Gradient Coding in Decentralized Learning for Evading Stragglers
di: Li, Chengxi, et al.
Pubblicazione: (2024)

Heterogeneity-Aware Client Sampling for Optimal and Efficient Federated Learning
di: Weng, Shudi, et al.
Pubblicazione: (2025)

Multi-terminal Strong Coordination over Noisy Channels with Encoder Co-operation
di: Ramachandran, Viswanathan, et al.
Pubblicazione: (2025)

Evaluating Differential Privacy on Correlated Datasets Using Pointwise Maximal Leakage
di: Saeidian, Sara, et al.
Pubblicazione: (2025)

Generalizing the Fano inequality further
di: Bongole, Raghav, et al.
Pubblicazione: (2026)

Multi-terminal Strong Coordination subject to Secrecy Constraints
di: Ramachandran, Viswanathan, et al.
Pubblicazione: (2024)

Distributed Learning based on 1-Bit Gradient Coding in the Presence of Stragglers
di: Li, Chengxi, et al.
Pubblicazione: (2024)

Thompson Sampling in Function Spaces via Neural Operators
di: Oliveira, Rafael, et al.
Pubblicazione: (2025)

Reinforcement Learning Based Goodput Maximization with Quantized Feedback in URLLC
di: Celebi, Hasan Basri, et al.
Pubblicazione: (2025)

Coding-Enforced Resilient and Secure Aggregation for Hierarchical Federated Learning
di: Weng, Shudi, et al.
Pubblicazione: (2026)

Coded Robust Aggregation for Distributed Learning under Byzantine Attacks
di: Li, Chengxi, et al.
Pubblicazione: (2025)

Adaptive Coded Federated Learning: Privacy Preservation and Straggler Mitigation
di: Li, Chengxi, et al.
Pubblicazione: (2024)

Thompson Sampling for Infinite-Horizon Discounted Decision Processes
di: Adelman, Daniel, et al.
Pubblicazione: (2024)

Generalized Talagrand Inequality for Sinkhorn Distance using Entropy Power Inequality
di: Wang, Shuchan, et al.
Pubblicazione: (2021)

Thompson Sampling for Repeated Newsvendor
di: Chen, Li, et al.
Pubblicazione: (2025)

Constrained Linear Thompson Sampling
di: Gangrade, Aditya, et al.
Pubblicazione: (2025)

Information Density Bounds for Privacy
di: Saeidian, Sara, et al.
Pubblicazione: (2024)

Distilled Thompson Sampling: Practical and Efficient Thompson Sampling via Imitation Learning
di: Namkoong, Hongseok, et al.
Pubblicazione: (2020)

Quantifying Privacy via Information Density
di: Grosse, Leonhard, et al.
Pubblicazione: (2024)

Functional Adjoint Sampler: Scalable Sampling on Infinite Dimensional Spaces
di: Park, Byoungwoo, et al.
Pubblicazione: (2025)

Regenerative Particle Thompson Sampling
di: Zhou, Zeyu, et al.
Pubblicazione: (2022)

Bounds on the privacy amplification of arbitrary channels via the contraction of $f_α$-divergence
di: Grosse, Leonhard, et al.
Pubblicazione: (2025)

Privacy Guarantee for Nash Equilibrium Computation of Aggregative Games Based on Pointwise Maximal Leakage
di: Cheng, Zhaoyang, et al.
Pubblicazione: (2025)

Privacy Mechanism Design based on Empirical Distributions
di: Grosse, Leonhard, et al.
Pubblicazione: (2025)

Risk level dependent Minimax Quantile lower bounds for Interactive Statistical Decision Making
di: Bongole, Raghav, et al.
Pubblicazione: (2025)

Integrated Sensing and Communication with Distributed Rate-Limited Helpers
di: Chen, Yiqi, et al.
Pubblicazione: (2025)

Private Variable-Length Coding with Zero Leakage
di: Zamani, Amirreza, et al.
Pubblicazione: (2023)

Dobrushin Coefficients of Private Mechanisms Beyond Local Differential Privacy
di: Grosse, Leonhard, et al.
Pubblicazione: (2026)