Cover Image

An Information-Theoretic Analysis of Thompson Sampling for Logistic Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gouverneur, Amaury, Rodríguez-Gálvez, Borja, Oechtering, Tobias J., Skoglund, Mikael
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Information-Theoretic Analysis of Thompson Sampling with Infinite Action Spaces
by: Gouverneur, Amaury, et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

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

Thompson Sampling in Partially Observable Contextual Bandits
by: Park, Hongju, et al.
Published: (2024)

Thompson Sampling for Multi-Objective Linear Contextual Bandit
by: Park, Somangchan, et al.
Published: (2025)

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

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

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

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

Improving Thompson Sampling via Information Relaxation for Budgeted Multi-armed Bandits
by: Jeong, Woojin, et al.
Published: (2024)

Feel-Good Thompson Sampling for Contextual Dueling Bandits
by: Li, Xuheng, et al.
Published: (2024)

Modified Meta-Thompson Sampling for Linear Bandits and Its Bayes Regret Analysis
by: Li, Hao, et al.
Published: (2024)

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

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

Generalizing the Fano inequality further
by: Bongole, Raghav, et al.
Published: (2026)

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

Combinatorial Logistic Bandits
by: Liu, Xutong, et al.
Published: (2024)

Neural Logistic Bandits
by: Bae, Seoungbin, et al.
Published: (2025)

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

Variance-Aware Feel-Good Thompson Sampling for Contextual Bandits
by: Li, Xuheng, et al.
Published: (2025)

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

Bayesian Collaborative Bandits with Thompson Sampling for Improved Outreach in Maternal Health Program
by: Dasgupta, Arpan, et al.
Published: (2024)

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

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

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

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

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

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

Near Optimal Pure Exploration in Logistic Bandits
by: Rivera, Eduardo Ochoa, et al.
Published: (2024)

Achieving Limited Adaptivity for Multinomial Logistic Bandits
by: Midigeshi, Sukruta Prakash, et al.
Published: (2025)

Information Density Bounds for Privacy
by: Saeidian, Sara, et al.
Published: (2024)

Quantifying Privacy via Information Density
by: Grosse, Leonhard, et al.
Published: (2024)