Image de couverture de livre

Parallel Sampling via Counting

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Anari, Nima, Gao, Ruiquan, Rubinstein, Aviad
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Artificial Intelligence Machine Learning Probability
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Parallel Sampling via Autospeculation
par: Anari, Nima, et autres
Publié: (2025)

The complexity of approximate (coarse) correlated equilibrium for incomplete information games
par: Peng, Binghui, et autres
Publié: (2024)

Near-Optimal Parallel Approximate Counting via Sampling
par: Harris, David G., et autres
Publié: (2026)

Efficient Diffusion Models for Symmetric Manifolds
par: Mangoubi, Oren, et autres
Publié: (2025)

Trickle-Down in Localization Schemes and Applications
par: Anari, Nima, et autres
Publié: (2024)

A Bicriterion Concentration Inequality and Prophet Inequalities for $k$-Fold Matroid Unions
par: Alon, Noga, et autres
Publié: (2024)

Subquadratic Counting via Perfect Marginal Sampling
par: Chen, Xiaoyu, et autres
Publié: (2026)

Strategizing against No-Regret Learners in First-Price Auctions
par: Rubinstein, Aviad, et autres
Publié: (2024)

Fast parallel sampling under isoperimetry
par: Anari, Nima, et autres
Publié: (2024)

A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton
par: Sharma, Vidya Sagar
Publié: (2023)

Optimal $e^{(γ+o(1))n}$-Approximation of the Permanent of Positive Semidefinite Matrices
par: Anari, Nima, et autres
Publié: (2026)

Leaf Stripping on Uniform Attachment Trees
par: Addario-Berry, Louigi, et autres
Publié: (2024)

Simple, unified analysis of Johnson-Lindenstrauss with applications
par: Li, Yingru
Publié: (2024)

Efficiently learning and sampling multimodal distributions with data-based initialization
par: Koehler, Frederic, et autres
Publié: (2024)

A General Reduction for High-Probability Analysis with General Light-Tailed Distributions
par: Attia, Amit, et autres
Publié: (2024)

The graph alignment problem: fundamental limits and efficient algorithms
par: Ganassali, Luca
Publié: (2024)

Improved sampling algorithms and functional inequalities for non-log-concave distributions
par: He, Yuchen, et autres
Publié: (2025)

Approximating the Total Variation Distance between Gaussians
par: Bhattacharyya, Arnab, et autres
Publié: (2025)

On approximating the $f$-divergence between two Ising models
par: Feng, Weiming, et autres
Publié: (2025)

Private Synthetic Graph Generation and Fused Gromov-Wasserstein Distance
par: Wirth, Leoni Carla, et autres
Publié: (2025)

Approximating the total variation distance between spin systems
par: Feng, Weiming, et autres
Publié: (2025)

On Computing Total Variation Distance Between Mixtures of Product Distributions
par: Feng, Weiming, et autres
Publié: (2026)

Rapid mixing in positively weighted restricted Boltzmann machines
par: Feng, Weiming, et autres
Publié: (2026)

Approximation Schemes for Edit Distance and LCS in Quasi-Strongly Subquadratic Time
par: Mao, Xiao, et autres
Publié: (2026)

Quality control in sublinear time: a case study via random graphs
par: Marcussen, Cassandra, et autres
Publié: (2025)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
par: Blanca, Antonio, et autres
Publié: (2022)

Streaming Attention Approximation via Discrepancy Theory
par: Kochetkova, Ekaterina, et autres
Publié: (2025)

AlgoSelect: Universal Algorithm Selection via the Comb Operator
par: Yao, Jasper
Publié: (2025)

Fast Spanning Tree Sampling in Broadcast Congested Clique
par: Anari, Nima, et autres
Publié: (2026)

Provably Learning from Modern Language Models via Low Logit Rank
par: Golowich, Noah, et autres
Publié: (2025)

Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations
par: Bini, Lorenzo, et autres
Publié: (2025)

Constant-Stretch Rounding on the Hypersimplex
par: Anari, Nima, et autres
Publié: (2026)

Adversarially-Robust Inference on Trees via Belief Propagation
par: Hopkins, Samuel B., et autres
Publié: (2024)

The Transient Cost of Learning in Queueing Systems
par: Freund, Daniel, et autres
Publié: (2023)

Efficiently matching random inhomogeneous graphs via degree profiles
par: Ding, Jian, et autres
Publié: (2023)

Sublinear Algorithms for TSP via Path Covers
par: Behnezhad, Soheil, et autres
Publié: (2023)

Beyond matroids: Secretary Problem and Prophet Inequality with general constraints
par: Rubinstein, Aviad
Publié: (2016)

Approximating Maximum Matching Requires Almost Quadratic Time
par: Behnezhad, Soheil, et autres
Publié: (2024)

Query Lower Bounds for Diffusion Sampling
par: Xun, Zhiyang, et autres
Publié: (2026)

Discovering Data Structures: Nearest Neighbor Search and Beyond
par: Salemohamed, Omar, et autres
Publié: (2024)