Cover Image

Asymptotically Minimax Regret by Bayes Mixtures

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Takeuchi, Jun'ichi, Barron, Andrew R.
Format:	Preprint
Published:	2024
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Risk Bounds on MDL Estimators for Linear Regression Models with Application to Simple ReLU Neural Networks
by: Takeishi, Yoshinari, et al.
Published: (2024)

Sparse Superposition Codes with Binomial Dictionary are Capacity-Achieving with Maximum Likelihood Decoding
by: Takeishi, Yoshinari, et al.
Published: (2025)

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

Asymptotically Minimax Robust Hypothesis Testing
by: Gül, Gökhan
Published: (2017)

Asymptotically Minimax Robust Likelihood Ratio Test
by: Gül, Gökhan
Published: (2026)

From Asymptotic to Finite-Sample Minimax Robust Hypothesis Testing
by: Gül, Gökhan
Published: (2026)

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

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

Two New Families of Local Asymptotically Minimax Lower Bounds in Parameter Estimation
by: Merhav, Neri
Published: (2024)

Minimax Analysis of Estimation Problems in Coherent Imaging
by: Xing, Hao, et al.
Published: (2025)

Log-Concave Coupling for Sampling Neural Net Posteriors
by: McDonald, Curtis, et al.
Published: (2024)

Generalized Approximate Message-Passing for Compressed Sensing with Sublinear Sparsity
by: Takeuchi, Keigo
Published: (2024)

Generalized Orthogonal Approximate Message-Passing for Sublinear Sparsity
by: Takeuchi, Keigo
Published: (2025)

Direct and Converse Theorems in Estimating Signals with Sublinear Sparsity
by: Takeuchi, Keigo
Published: (2026)

Decentralized Generalized Approximate Message-Passing for Tree-Structured Networks
by: Takeuchi, Keigo
Published: (2023)

Model non-collapse: Minimax bounds for recursive discrete distribution estimation
by: Kanabar, Millen, et al.
Published: (2025)

Non-Asymptotic Error Bounds for Causally Conditioned Directed Information Rates of Gaussian Sequences
by: Zheng, Yuping, et al.
Published: (2025)

Dimensionality increase for error correction in the interaction between information space and the physical world
by: Barron, Tatyana
Published: (2025)

Generalized Entropy Power Inequalities and Monotonicity Properties of Information
by: Madiman, Mokshay, et al.
Published: (2006)

Minimax Hypothesis Testing for the Bradley-Terry-Luce Model
by: Makur, Anuran, et al.
Published: (2024)

On Instability of Minimax Optimal Optimism-Based Bandit Algorithms
by: Praharaj, Samya, et al.
Published: (2025)

Minimax Optimality of the Probability Flow ODE for Diffusion Models
by: Cai, Changxiao, et al.
Published: (2025)

Minimax Optimal Procedures for Joint Detection and Estimation
by: Reinhard, Dominik, et al.
Published: (2026)

Exact Minimax Optimality of Spectral Methods in Phase Synchronization and Orthogonal Group Synchronization
by: Zhang, Anderson Ye
Published: (2022)

Tight Exponential Strong Converse for Source Coding Problem with Encoded Side Information
by: Takeuchi, Daisuke, et al.
Published: (2022)

Minimax optimal differentially private synthetic data for smooth queries
by: Ding, Rundong, et al.
Published: (2026)

Minimax optimal submatrix detection: Sharp non-asymptotic rates
by: Knight, Parker, et al.
Published: (2026)

Minimax Data Sanitization with Distortion Constraint and Adversarial Inference
by: Moatazedian, Amirarsalan, et al.
Published: (2025)

Semantic-Aware Multi-Terminal Coding for Gaussian Mixture Sources
by: Shi, Yuxuan, et al.
Published: (2023)

On the Regret of Coded Caching with Adversarial Requests
by: Nayak, Anupam, et al.
Published: (2024)

Best Arm Identification with Minimal Regret
by: Yang, Junwen, et al.
Published: (2024)

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

Encoding and Decoding Algorithms of ANS Variants and Evaluation of Their Average Code Lengths
by: Yamamoto, Hirosuke, et al.
Published: (2024)

Reduction of Sufficient Number of Code Tables of $k$-Bit Delay Decodable Codes
by: Hashimoto, Kengo, et al.
Published: (2024)

Asymmetric Encoding-Decoding Schemes for Lossless Data Compression
by: Yamamoto, Hirosuke, et al.
Published: (2026)

Geometric signals
by: Barron, Tatyana
Published: (2024)

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

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

The Conditional Regret-Capacity Theorem for Batch Universal Prediction
by: Bondaschi, Marco, et al.
Published: (2025)

On the Entropy of General Mixture Distributions
by: Lee, Namyoon
Published: (2026)