Cover Image

The Sample Complexity of Lossless Data Compression

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Viaud, Terence, Kontoyiannis, Ioannis
Format:	Preprint
Published:	2026
Subjects:	Information Theory Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finite-sample expansions for the optimal error probability in asymmetric binary hypothesis testing
by: Lungu, Valentinian, et al.
Published: (2024)

Agnostic Sample Compression Schemes for Regression
by: Attias, Idan, et al.
Published: (2018)

Sparse Principal Component Analysis with Energy Profile Dependent Sample Complexity
by: Xu, Mengchu, et al.
Published: (2025)

Empirical Lossless Compression Bound of a Data Sequence
by: Li, Lei M
Published: (2023)

Shakespeare, Entropy and Educated Monkeys
by: Kontoyiannis, Ioannis
Published: (2025)

Active Nonparametric Two-Sample Testing by Betting on Heterogeneous Data Sources
by: Hsu, Chia-Yu, et al.
Published: (2025)

Bayesian causal discovery: Posterior concentration and optimal detection
by: Lungu, Valentinian, et al.
Published: (2025)

On the Sample Complexity of Robust Binary Hypothesis Testing
by: Vallinayagam, Shankar, et al.
Published: (2026)

The Sample Complexity of Simple Binary Hypothesis Testing
by: Pensia, Ankit, et al.
Published: (2024)

Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
by: Lau, Ivan, et al.
Published: (2025)

The Sample Complexity of Distributed Simple Binary Hypothesis Testing under Information Constraints
by: Kazemi, Hadi, et al.
Published: (2025)

Pragmatic lossless compression: Fundamental limits and universality
by: Theocharous, Andreas, et al.
Published: (2025)

The relative value of interventional and observational samples in Bayesian Causal Linear Gaussian Models
by: Lungu, Valentinian, et al.
Published: (2026)

Universal Graph Compression: Stochastic Block Models
by: Bhatt, Alankrita, et al.
Published: (2020)

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

Sample Complexity of Composite Quantum Hypothesis Testing
by: Simpson, Jacob Paul, et al.
Published: (2026)

On the Statistical Complexity of Sample Amplification
by: Axelrod, Brian, et al.
Published: (2022)

Finite de Finetti bounds in relative entropy
by: Gavalakis, Lampros, et al.
Published: (2024)

The entropic doubling constant and robustness of Gaussian codebooks for additive-noise channels
by: Gavalakis, Lampros, et al.
Published: (2024)

Nonparametric Two-Sample Testing by Betting
by: Shekhar, Shubhanshu, et al.
Published: (2021)

Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
by: Li, Gen, et al.
Published: (2022)

Detecting Planted Structure in Circular Data
by: Ameen, Taha, et al.
Published: (2026)

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

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)

Importance of Small Probability Events in Big Data: Information Measures, Applications, and Challenges
by: She, Rui, et al.
Published: (2019)

Quickest Change Detection for Multiple Data Streams Using the James-Stein Estimator
by: Halme, Topi, et al.
Published: (2024)

Tighter Confidence Intervals under Without Replacement Sampling via Empirical Rate Functions
by: Shekhar, Shubhanshu, et al.
Published: (2026)

Lossless Compression of Time Series Data: A Comparative Study
by: Matt, Jonas G., et al.
Published: (2025)

Breaking the Finite-Sample Barrier in Entropy Coupling
by: Asoodeh, Shahab, et al.
Published: (2026)

Lossless and Near-Lossless Compression for Foundation Models
by: Hershcovitch, Moshik, et al.
Published: (2024)

A Third Information-Theoretic Approach to Finite de Finetti Theorems
by: Berta, Mario, et al.
Published: (2023)

Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
by: Dmitriev, Daniil, et al.
Published: (2026)

Improved Sample Complexity Bounds for Diffusion Model Training
by: Gupta, Shivam, et al.
Published: (2023)

Sample efficient inductive matrix completion with noise and inexact side information
by: Yang, Yuepeng, et al.
Published: (2026)

Distributed Nonparametric Estimation: from Sparse to Dense Samples per Terminal
by: Yuan, Deheng, et al.
Published: (2025)

Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
by: Rajaraman, Nived, et al.
Published: (2023)

Lossless Analog Compression
by: Alberti, Giovanni, et al.
Published: (2018)

Breaking AR's Sampling Bottleneck: Provable Acceleration via Diffusion Language Models
by: Li, Gen, et al.
Published: (2025)

State Variation Mining: On Information Divergence with Message Importance in Big Data
by: She, Rui, et al.
Published: (2018)

A Closed-Form EVSI Expression for a Multinomial Data-Generating Process
by: Fleischhacker, Adam, et al.
Published: (2022)