Thuy-Duong Vuong
Orcid: 0000-0003-0271-9687Affiliations:
- Stanford University, CA, USA
According to our database1,
Thuy-Duong Vuong
authored at least 31 papers
between 2019 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
7
8
9
10
1
5
6
2
5
3
4
3
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
Efficiently learning and sampling multimodal distributions with data-based initialization.
CoRR, 2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Sampling Multimodal Distributions with the Vanilla Score: Benefits of Data-Based Initialization.
Proceedings of the Twelfth International Conference on Learning Representations, 2024
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024
2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
Inf. Process. Lett., 2022
Improved Sampling-to-Counting Reductions in High-Dimensional Expanders and Faster Parallel Determinantal Sampling.
CoRR, 2022
CoRR, 2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
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.
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.
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.
SIAM J. Comput., 2021
Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities.
CoRR, 2021
Entropic Independence in High-Dimensional Expanders: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Polynomials and the Ising Model.
CoRR, 2021
Spectral independence, coupling with the stationary distribution, and the spectral gap of the Glauber dynamics.
CoRR, 2021
CoRR, 2021
Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests.
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.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
2020
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.
Electron. J. Comb., 2019
Graph pattern detection: hardness for all induced patterns and faster non-induced cycles.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019