Cover Image

Greedy Poisson Rejection Sampling

Fuente: arXiv

Saved in:

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

Similar Items

Adaptive Greedy Rejection Sampling
by: Flamich, Gergely, et al.
Published: (2023)

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

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)

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

The Impact of Partial Computations on the Red-Blue Pebble Game
by: Papp, Pál András, et al.
Published: (2025)

Explicit separations between randomized and deterministic Number-on-Forehead communication
by: Kelley, Zander, et al.
Published: (2023)

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

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

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

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

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

An SoS Entropy Dichotomy via Windowed Hypercontractivity
by: Lela, Marko
Published: (2025)

Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies
by: Goldberg, Guy, 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)

IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
by: Lela, Marko
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)

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

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

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

XiSort: Deterministic Sorting via IEEE-754 Total Ordering and Entropy Minimization
by: Alpay, Faruk
Published: (2025)

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

Computational Complexity of Physical Counting
by: Simas, Tristan
Published: (2026)

Polynomial Prenexing of QBFs with Non-Monotone Boolean Operators
by: Saffidine, Abdallah, et al.
Published: (2025)

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
by: Grochow, Joshua A., et al.
Published: (2021)

Count-Free Weisfeiler--Leman and Group Isomorphism
by: Collins, Nathaniel A., et al.
Published: (2022)

Hive is PSPACE-Hard
by: Andel, Daniël, et al.
Published: (2025)

On Channel Simulation with Causal Rejection Samplers
by: Goc, Daniel, et al.
Published: (2024)

On Graph Grammars and Games
by: Vijayakumar, Jayakrishna, et al.
Published: (2024)

The Quasi-probability Method and Applications for Trace Reconstruction
by: Rubinstein, Ittai
Published: (2024)

A Characterization of Complexity in Public Goods Games
by: Gilboa, Matan
Published: (2023)

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)

A compact QUBO encoding of computational logic formulae demonstrated on cryptography constructions
by: Morse, Gregory, et al.
Published: (2024)

Algorithmic Barriers to Detecting and Repairing Structural Overspecification in Adaptive Data-Structure Selection
by: Alpay, Faruk, et al.
Published: (2026)

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

An MDL-Style Cost Functional KC, Distribution-Preserving Reductions ($A2^d$), and an $AC^0$+log Lower Bound for 3SAT via Balanced 3XOR
by: Lela, Marko
Published: (2025)

Curved Boolean Logic: A Contextual Generalization of Propositional Logic with Algorithmic Consequences
by: von Liechtenstein, Maximilian R. P.
Published: (2025)

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