Cover Image

Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality

Fuente: arXiv

Saved in:

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

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)

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

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

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

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

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

Multi-Task Private Semantic Communication
by: Zamani, Amirreza, et al.
Published: (2024)

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

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

Rethinking Disclosure Prevention with Pointwise Maximal Leakage
by: Saeidian, Sara, et al.
Published: (2023)

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

On Information Theoretic Fairness With A Bounded Point-Wise Statistical Parity Constraint: An Information Geometric Approach
by: Zamani, Amirreza, et al.
Published: (2025)

On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy
by: Jia, Zeyu, et al.
Published: (2025)

Information-Theoretic Fairness with A Bounded Statistical Parity Constraint
by: Zamani, Amirreza, et al.
Published: (2025)

Distribution-Preserving Integrated Sensing and Communication with Secure Reconstruction
by: Chen, Yiqi, et al.
Published: (2024)

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

Improved Information Theoretic Generalization Bounds for Distributed and Federated Learning
by: Barnes, L. P., et al.
Published: (2022)

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)

Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
by: Zhang, Kaihong, et al.
Published: (2024)

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

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
by: Li, Zihan, et al.
Published: (2022)

Minimax-Optimal Reward-Agnostic Exploration in Reinforcement Learning
by: Li, Gen, et al.
Published: (2023)

Information-Theoretic Generalization Bounds for Deep Neural Networks
by: He, Haiyun, et al.
Published: (2024)

Online Prediction of Stochastic Sequences with High Probability Regret Bounds
by: Frey, Matthias, et al.
Published: (2026)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
by: Tajdini, Artin, et al.
Published: (2025)

Context Steering: A New Paradigm for Compression-based Embeddings by Synthesizing Relevant Information Features
by: Sarasa, Guillermo, et al.
Published: (2025)