Suivre
Binh T. Nguyen
Binh T. Nguyen
Autres nomsNguyễn Tuấn Bình
National University of Singapore
Adresse e-mail validée de nus.edu.sg - Page d'accueil
Titre
Citée par
Citée par
Année
Benchopt: Reproducible, efficient and collaborative optimization benchmarks
T Moreau, M Massias, A Gramfort, P Ablin, PA Bannier, B Charlier, ...
Advances in Neural Information Processing Systems 35, 25404-25421, 2022
332022
Aggregation of multiple knockoffs
TB Nguyen, JA Chevalier, B Thirion, S Arlot
International conference on machine learning, 7283-7293, 2020
272020
Flow matching in latent space
Q Dao, H Phung, B Nguyen, A Tran
arXiv preprint arXiv:2307.08698, 2023
242023
Decoding with confidence: Statistical control on decoder maps
JA Chevalier, TB Nguyen, J Salmon, G Varoquaux, B Thirion
NeuroImage 234, 117921, 2021
92021
Ecko: Ensemble of clustered knockoffs for robust multivariate inference on fMRI data
TB Nguyen, JA Chevalier, B Thirion
Information Processing in Medical Imaging: 26th International Conference …, 2019
92019
A Conditional Randomization Test for Sparse Logistic Regression in High-Dimension
BT Nguyen, B Thirion, S Arlot
Advances in Neural Information Processing Systems 35, 13691–13703, 2022
62022
Bellman optimal step-size straightening of flow-matching models
B Nguyen, B Nguyen, VA Nguyen
The Twelfth International Conference on Learning Representations (ICLR 2024), 2023
22023
Semidefinite Relaxations of the Gromov-Wasserstein Distance
J Chen, BT Nguyen, YS Soh
arXiv preprint arXiv:2312.14572, 2023
22023
Spatially relaxed inference on high-dimensional linear models
JA Chevalier, TB Nguyen, B Thirion, J Salmon
Statistics and Computing 32 (5), 83, 2022
22022
Generative Conditional Distributions by Neural (Entropic) Optimal Transport
B Nguyen, B Nguyen, HT Nguyen, VA Nguyen
Forty-first International Conference on Machine Learning (ICML 2024), 2024
12024
Some Contributions to Modern Multiple Hypothesis Testing in High-dimension
BT Nguyen
Université Paris-Saclay, 2021
2021
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–11