Copertina

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Blanca, Antonio, Chen, Zongchen, Štefankovič, Daniel, Vigoda, Eric
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Data Structures and Algorithms Machine Learning Probability Statistics Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule
di: Chen, Zongchen, et al.
Pubblicazione: (2024)

High-accuracy log-concave sampling with stochastic queries
di: Chen, Fan, et al.
Pubblicazione: (2026)

Spectral Independence via Stability and Applications to Holant-Type Problems
di: Chen, Zongchen, et al.
Pubblicazione: (2021)

Sampling and Identity-Testing Without Approximate Tensorization of Entropy
di: Gay, William, et al.
Pubblicazione: (2025)

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
di: Ding, Jian, et al.
Pubblicazione: (2022)

Functional Stochastic Localization
di: Gu, Anming, et al.
Pubblicazione: (2026)

Adversarially-Robust Inference on Trees via Belief Propagation
di: Hopkins, Samuel B., et al.
Pubblicazione: (2024)

Learning bounded-degree polytrees with known skeleton
di: Choo, Davin, et al.
Pubblicazione: (2023)

Nonlinear Laplacians: Tunable principal component analysis under directional prior information
di: Ma, Yuxin, et al.
Pubblicazione: (2025)

Perspectives on Stochastic Localization
di: Shi, Bobby, et al.
Pubblicazione: (2025)

Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise
di: De, Debsurya, et al.
Pubblicazione: (2025)

Learning Mixtures of Gaussians Using Diffusion Models
di: Gatmiry, Khashayar, et al.
Pubblicazione: (2024)

Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing
di: Kunisky, Dmitriy
Pubblicazione: (2024)

Online Differentially Private Synthetic Data Generation
di: He, Yiyun, et al.
Pubblicazione: (2024)

Correlation detection in trees for planted graph alignment
di: Ganassali, Luca, et al.
Pubblicazione: (2021)

Efficiently matching random inhomogeneous graphs via degree profiles
di: Ding, Jian, et al.
Pubblicazione: (2023)

Universality of first-order methods on random and deterministic matrices
di: Gorini, Nicola, et al.
Pubblicazione: (2026)

Fitting an ellipsoid to a quadratic number of random points
di: Bandeira, Afonso S., et al.
Pubblicazione: (2023)

Zeroth-order Logconcave Sampling
di: Kook, Yunbum, et al.
Pubblicazione: (2025)

Sample Complexity Bounds for Robust Mean Estimation with Mean-Shift Contamination
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2026)

High-Dimensional Gaussian Mean Estimation under Realizable Contamination
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2026)

Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models
di: Kunisky, Dmitriy
Pubblicazione: (2024)

Differentially Private Low-dimensional Synthetic Data from High-dimensional Datasets
di: He, Yiyun, et al.
Pubblicazione: (2023)

On Unbiased Low-Rank Approximation with Minimum Distortion
di: Barnes, Leighton Pate, et al.
Pubblicazione: (2025)

Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning
di: Chakrabarty, Deeparnab, et al.
Pubblicazione: (2025)

On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem
di: Lovig, Maxwell, et al.
Pubblicazione: (2024)

Complexity of Non-Log-Concave Sampling in Fisher Information
di: Chewi, Sinho, et al.
Pubblicazione: (2026)

Attainability of Two-Point Testing Rates for Finite-Sample Location Estimation
di: Compton, Spencer, et al.
Pubblicazione: (2025)

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
di: Hanneke, Steve, et al.
Pubblicazione: (2026)

Linear Regression under Missing or Corrupted Coordinates
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2025)

Mixing of general biased adjacent transposition chains
di: Gheissari, Reza, et al.
Pubblicazione: (2025)

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

Subquadratic Counting via Perfect Marginal Sampling
di: Chen, Xiaoyu, et al.
Pubblicazione: (2026)

Detection of local geometry in random graphs: information-theoretic and computational limits
di: Bok, Jinho, et al.
Pubblicazione: (2026)

Tensor cumulants for statistical inference on invariant distributions
di: Kunisky, Dmitriy, et al.
Pubblicazione: (2024)

Statistical Estimation in the Spiked Tensor Model via the Quantum Approximate Optimization Algorithm
di: Zhou, Leo, et al.
Pubblicazione: (2024)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
di: Jain, Vishesh, et al.
Pubblicazione: (2026)

Universal entrywise eigenvector fluctuations in delocalized spiked matrix models and asymptotics of rounded spectral algorithms
di: Chen, Shujing, et al.
Pubblicazione: (2025)

Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime
di: Chen, Guanyi, et al.
Pubblicazione: (2025)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
di: Carlson, Charlie, et al.
Pubblicazione: (2024)