Thuy-Duong Vuong

Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

2024

Trickle-Down in Localization Schemes and Applications.

[BibT_eX]

[DOI]

Frederic Koehler

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Sampling Multimodal Distributions with the Vanilla Score: Benefits of Data-Based Initialization.

[BibT_eX]

[DOI]

Frederic Koehler

Proceedings of the Twelfth International Conference on Learning Representations, 2024

Fast parallel sampling under isoperimetry.

[BibT_eX]

[DOI]

Sinho Chewi

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Fairness in Submodular Maximization over a Matroid Constraint.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

Parallel Discrete Sampling via Continuous Walks.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Quadratic Speedups in Parallel Sampling from Determinantal Distributions.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Optimal mixing of the down-up walk on independent sets of a given size.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Spectral independence, coupling, and the spectral gap of the Glauber dynamics.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

Composable Coresets for Constrained Determinant Maximization and Beyond.

[BibT_eX]

[DOI]

Sepideh Mahabadi

CoRR, 2022

On the Complexity of Sampling Redistricting Plans.

[BibT_eX]

[DOI]

CoRR, 2022

Improved Sampling-to-Counting Reductions in High-Dimensional Expanders and Faster Parallel Determinantal Sampling.

[BibT_eX]

[DOI]

CoRR, 2022

Dimension reduction for maximum matchings and the Fastest Mixing Markov Chain.

[BibT_eX]

[DOI]

CoRR, 2022

Entropic independence: optimal mixing of down-up random walks.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Domain Sparsification of Discrete Distributions Using Entropic Independence.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence.

[BibT_eX]

[DOI]

Yang P. Liu

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

From Sampling to Optimization on Discrete Domains with Applications to Determinant Maximization.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles.

[BibT_eX]

[DOI]

Mina Dalirrooyfard

Virginia Vassilevska Williams

SIAM J. Comput., 2021

Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities.

[BibT_eX]

[DOI]

CoRR, 2021

Entropic Independence in High-Dimensional Expanders: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Polynomials and the Ising Model.

[BibT_eX]

[DOI]

CoRR, 2021

Spectral independence, coupling with the stationary distribution, and the spectral gap of the Glauber dynamics.

[BibT_eX]

[DOI]

CoRR, 2021

On the sampling Lovász Local Lemma for atomic constraint satisfaction problems.

[BibT_eX]

[DOI]

CoRR, 2021

Simple and Near-Optimal MAP Inference for Nonsymmetric DPPs.

[BibT_eX]

[DOI]

CoRR, 2021

Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Fractionally log-concave and sector-stable polynomials: counting planar matchings and more.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Towards the sampling Lovász Local Lemma.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

An Extension of Plücker Relations with Applications to Subdeterminant Maximization.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2020

2019

Toric Mutations in the dP<sub>2</sub> Quiver and Subgraphs of the dP<sub>2</sub> Brane Tiling.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

Lattice Trapdoors and IBE from Middle-Product LWE.

[BibT_eX]

[DOI]

Alex Lombardi

Vinod Vaikuntanathan

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Graph pattern detection: hardness for all induced patterns and faster non-induced cycles.

[BibT_eX]

[DOI]

Mina Dalirrooyfard