Complexity of high-dimensional identity testing with coordinate conditional sampling
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3891410 (Why is no real title available?)
- scientific article; zbMATH DE number 1033851 (Why is no real title available?)
- scientific article; zbMATH DE number 7768377 (Why is no real title available?)
- scientific article; zbMATH DE number 7788359 (Why is no real title available?)
- scientific article; zbMATH DE number 7788432 (Why is no real title available?)
- A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
- A new approach for testing properties of discrete distributions
- A spectral condition for spectral gap: fast mixing in high-temperature Ising models
- A spectral independence view on hard spheres via block dynamics
- Algorithms for \#BIS-hard problems on expander graphs
- An automatic inequality prover and instance optimal identity testing
- Approximate tensorization of entropy at high temperature
- Approximating the Permanent
- Block factorization of the relative entropy via spatial mixing
- Computational transition at the uniqueness threshold
- Counting in two-spin models on \(d\)-regular graphs
- Distribution testing lower bounds via reductions from communication complexity
- Entropic independence: optimal mixing of down-up random walks
- Estimating the unseen, improved estimators for entropy and other properties
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Exponential integrability and transportation cost related to logarithmic Sobolev inequalities
- Foundations of Cryptography
- From algorithms to connectivity and back: finding a giant component in random k-SAT
- Hardness of identity testing for restricted Boltzmann machines and Potts models
- Higher order concentration for functions of weakly dependent random variables
- Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
- Introduction to Property Testing
- Learning graphical models using multiplicative weights
- Logarithmic Sobolev inequalities in discrete product spaces
- Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
- Mathematical aspects of mixing times in Markov chains.
- Minimax Estimation of Functionals of Discrete Distributions
- Minimax Rates of Entropy Estimation on Large Alphabets via Best Polynomial Approximation
- On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
- On mixing of Markov chains: coupling, spectral independence, and entropy factorization
- On the power of conditional samples in distribution testing
- On tolerant distribution testing in the conditional sampling model
- Optimal algorithms for testing closeness of discrete distributions
- Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion
- Optimal testing of discrete distributions with high probability
- Property testing of joint distributions using conditional samples
- Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields
- Rapid Mixing from Spectral Independence beyond the Boolean Domain
- Rapid mixing of Glauber dynamics up to uniqueness via contraction
- Spectral gap in random bipartite biregular graphs and applications
- Spectral independence in high-dimensional expanders and applications to the hardcore model
- Spectral independence via stability and applications to Holant-type problems
- Testing Bayesian Networks
- Testing Ising Models
- Testing probability distributions using conditional samples
- Testing product distributions: a closer look
- The Complexity of Ferromagnetic Ising with Local Fields
- The Power of Linear Estimators
- The Uniform Distribution Is Complete with Respect to Testing Identity to a Fixed Distribution
- Topics and Techniques in Distribution Testing: A Biased but Representative Sample
- Uniqueness thresholds on trees versus graphs
- Which Distribution Distances are Sublinearly Testable?
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
This page was built for publication: Complexity of high-dimensional identity testing with coordinate conditional sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7023529)
