Image de couverture de livre

On the query complexity of sampling from non-log-concave distributions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	He, Yuchen, Zhang, Chihao
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

High-accuracy log-concave sampling with stochastic queries
par: Chen, Fan, et autres
Publié: (2026)

On the Problem of Best Arm Retention
par: Chen, Houshuang, et autres
Publié: (2025)

Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
par: He, Yuchen, et autres
Publié: (2024)

A mixing time bound for Gibbs sampling from log-smooth log-concave distributions
par: Wadia, Neha S.
Publié: (2024)

Robust learning of halfspaces under log-concave marginals
par: Lange, Jane, et autres
Publié: (2025)

The adaptive complexity of parallelized log-concave sampling
par: Zhou, Huanjian, et autres
Publié: (2024)

A proximal gradient algorithm for composite log-concave sampling
par: Liu, Linghai, et autres
Publié: (2026)

Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits
par: Ye, Zichun, et autres
Publié: (2025)

Rényi-infinity constrained sampling with $d^3$ membership queries
par: Kook, Yunbum, et autres
Publié: (2024)

Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified Dikin Walk
par: Gu, Yuzhou, et autres
Publié: (2024)

Discrete Optimal Transport: Rapid Convergence of Simulated Annealing Algorithms
par: He, Yuchen, et autres
Publié: (2026)

The sample complexity of multi-distribution learning
par: Peng, Binghui
Publié: (2023)

Efficient distributional regression trees learning algorithms for calibrated non-parametric probabilistic forecasts
par: Duchemin, Quentin, et autres
Publié: (2025)

On the cut-query complexity of approximating max-cut
par: Plevrakis, Orestis, et autres
Publié: (2022)

FPTAS for Holant Problems with Log-Concave Signatures
par: He, Kun, et autres
Publié: (2024)

Graph neural networks extrapolate out-of-distribution for shortest paths
par: Nerem, Robert R., et autres
Publié: (2025)

Analyzing the effect of prediction accuracy on the distributionally-robust competitive ratio
par: Yoshinaga, Toru, et autres
Publié: (2026)

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

Taming Imperfect Process Verifiers: A Sampling Perspective on Backtracking
par: Rohatgi, Dhruv, et autres
Publié: (2025)

Phase transition of the Sinkhorn-Knopp algorithm
par: He, Kun
Publié: (2025)

On the Efficiency of Sinkhorn-Knopp for Entropically Regularized Optimal Transport
par: He, Kun
Publié: (2026)

Sampling Proper Colorings on Line Graphs Using $(1+o(1))Δ$ Colors
par: Wang, Yulin, et autres
Publié: (2023)

Learning Multinomial Logits in $O(n \log n)$ time
par: Chierichetti, Flavio, et autres
Publié: (2026)

Dynamic Spectral Clustering with Provable Approximation Guarantee
par: Laenen, Steinar, et autres
Publié: (2024)

Randomized query composition and product distributions
par: Sanyal, Swagato
Publié: (2024)

Proper decision trees: An axiomatic framework for solving optimal decision tree problems with arbitrary splitting rules
par: He, Xi, et autres
Publié: (2025)

An efficient, provably optimal algorithm for the 0-1 loss linear classification problem
par: He, Xi, et autres
Publié: (2023)

Dynamic Similarity Graph Construction with Kernel Density Estimation
par: Laenen, Steinar, et autres
Publié: (2025)

Online Sparsification of Bipartite-Like Clusters in Graphs
par: Das, Joyentanuj, et autres
Publié: (2025)

Structure-Aware Spectral Sparsification via Uniform Edge Sampling
par: He, Kaiwen, et autres
Publié: (2025)

Trace reconstruction from local statistical queries
par: Chen, Xi, et autres
Publié: (2024)

Average Sensitivity of Hierarchical $k$-Median Clustering
par: Li, Shijie, et autres
Publié: (2025)

Coreset Spectral Clustering
par: Jourdan, Ben, et autres
Publié: (2025)

On efficient robust regression with subquadratic samples
par: Adil, Deeksha, et autres
Publié: (2026)

Learning CNF formulas from uniform random solutions in the local lemma regime
par: Feng, Weiming, et autres
Publié: (2025)

Temporal queries for dynamic temporal forests
par: Bilò, Davide, et autres
Publié: (2024)

Optimal prefix-suffix queries with applications
par: Pissis, Solon P.
Publié: (2024)

Turnstile $\ell_p$ leverage score sampling with applications
par: Munteanu, Alexander, et autres
Publié: (2024)

Decay of correlation for edge colorings when $q>3Δ$
par: Chen, Zejia, et autres
Publié: (2025)