Cover Image

Adaptive Greedy Rejection Sampling

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Flamich, Gergely, Theis, Lucas
Format:	Preprint
Published:	2023
Subjects:	Information Theory 94A40 (Primary) 68Q11, 68Q17 (Secondary) E.4; H.1.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Greedy Poisson Rejection Sampling
by: Flamich, Gergely
Published: (2023)

Information Bottleneck Analysis of Deep Neural Networks via Lossy Compression
by: Butakov, Ivan, et al.
Published: (2023)

FMMI: Flow Matching Mutual Information Estimation
by: Butakov, Ivan, et al.
Published: (2025)

Efficient Distribution Matching of Representations via Noise-Injected Deep InfoMax
by: Butakov, Ivan, et al.
Published: (2024)

How Does Machine Learning Manage Complexity?
by: Fortnow, Lance
Published: (2026)

Curse of Slicing: Why Sliced Mutual Information is a Deceptive Measure of Statistical Dependence
by: Semenenko, Alexander, et al.
Published: (2025)

Semantic Rate-Distortion for Bounded Multi-Agent Communication: Capacity-Derived Semantic Spaces and the Communication Cost of Alignment
by: Nixon, Anthony T.
Published: (2026)

All Kolmogorov complexity functions are optimal, but are some more optimal?
by: Bauwens, Bruno, et al.
Published: (2025)

Redundancy-as-Masking: Formalizing the Artificial Age Score (AAS) to Model Memory Aging in Generative AI
by: Kayadibi, Seyma Yaman
Published: (2025)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
by: Huseynzade, Rafig
Published: (2025)

A Family of LZ78-based Universal Sequential Probability Assignments
by: Sagan, Naomi, et al.
Published: (2024)

On nonlinear compression costs: when Shannon meets Rényi
by: Somazzi, Andrea, et al.
Published: (2023)

Laws of Learning Dynamics and the Core of Learners
by: Jung, Inkee, et al.
Published: (2026)

Weighing Obese Timed Languages
by: Asarin, Eugene, et al.
Published: (2025)

Computing the Bandwidth of Meager Timed Automata
by: Asarin, Eugene, et al.
Published: (2024)

Composable Post-Quantum Security for FADEC-Coupled Dual-Spool Turbofan Cyber-Physical Systems
by: Alpay, Faruk, et al.
Published: (2026)

Cellular Automaton Reducibility as a Measure of Complexity for Infinite Words
by: Zubia, Markel, et al.
Published: (2026)

Normal forms in Virus Machines
by: Ramírez-de-Arellano, A., et al.
Published: (2024)

Noncommutative rational Pólya series
by: Bell, Jason, et al.
Published: (2019)

Bandwidth-Efficient Multi-Agent Communication through Information Bottleneck and Vector Quantization
by: Farooq, Ahmad, et al.
Published: (2026)

Smaller Depth-2 Linear Circuits for Disjointness Matrices
by: Ye, Lixi
Published: (2026)

Description Complexity of Unary Structures in First-Order Logic with Links to Entropy
by: Jaakkola, Reijo, et al.
Published: (2024)

Efficient computations in central simple algebras using Amitsur cohomology
by: Kutas, Péter, et al.
Published: (2023)

The Extremum Stack is a Minimal Sufficient Statistic for Rate-Independent Functionals: A Kolmogorov Complexity Characterisation
by: Frydrych, Piotr
Published: (2026)

Term Coding and Dispersion: A Perfect-vs-Rate Complexity Dichotomy for Information Flow
by: Riis, Søren
Published: (2026)

Preliminaries on the Accurate Estimation of the Hurst Exponent Using Time Series
by: Millán, Ginno, et al.
Published: (2021)

Generalized Samorodnitsky noisy function inequalities, with applications to error-correcting codes
by: Abawonse, Olakunle S., et al.
Published: (2025)

Bishop's (up)crossing inequality and lower semicomputable random reals revisited
by: Andreev, Mikhail, et al.
Published: (2025)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
by: Dorochko, Leonid, et al.
Published: (2026)

Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies
by: Goldberg, Guy, et al.
Published: (2025)

P not equal to NP
by: Delgado, Daniel Cardona
Published: (2023)

Conserved active information
by: Chen, Yanchen, et al.
Published: (2025)

Phase-Only Zero-Forcing for Secure Wireless Communication in Multi-User Systems
by: Hong, Jordan, et al.
Published: (2025)

The Limits of AI Explainability: An Algorithmic Information Theory Approach
by: Rao, Shrisha
Published: (2025)

Conditional normality and finite-state dimensions revisited
by: Shen, Alexander
Published: (2024)

Computational Complexity of Determining the Assembly Index
by: Masierak, Piotr
Published: (2026)

Commutative N-polyregular functions
by: Lopez, Aliaume
Published: (2024)

Computability of Initial Value Problems
by: Brattka, Vasco, et al.
Published: (2024)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
by: Adsul, Bharat, et al.
Published: (2024)

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
by: Böhnlein, Toni, et al.
Published: (2024)