Jonathan Weed

J. Mach. Learn. Res., 2024

Conditional simulation via entropic optimal transport: Toward non-parametric estimation of conditional Brenier maps.

[BibT_eX]

[DOI]

Ricardo Baptista

Michael Brennan

Youssef M. Marzouk

CoRR, 2024

Learning large softmax mixtures with warm start EM.

[BibT_eX]

[DOI]

CoRR, 2024

Convergence of Unadjusted Langevin in High Dimensions: Delocalization of Bias.

[BibT_eX]

[DOI]

CoRR, 2024

Plug-in estimation of Schrödinger bridges.

[BibT_eX]

[DOI]

CoRR, 2024

Approximate independence of permutation mixtures.

[BibT_eX]

[DOI]

Yanjun Han

CoRR, 2024

Progressive Entropic Optimal Transport Solvers.

[BibT_eX]

[DOI]

Parnian Kassraie

CoRR, 2024

2023

An Improved Central Limit Theorem and Fast Convergence Rates for Entropic Transportation Costs.

[BibT_eX]

[DOI]

Eustasio del Barrio

Alberto González-Sanz

Jean-Michel Loubes

SIAM J. Math. Data Sci., September, 2023

It Was "All" for "Nothing": Sharp Phase Transitions for Noiseless Discrete Channels.

[BibT_eX]

[DOI]

Ilias Zadik

IEEE Trans. Inf. Theory, August, 2023

Learning Costs for Structured Monge Displacements.

[BibT_eX]

[DOI]

Michal Klein

CoRR, 2023

The Adversarial Consistency of Surrogate Risks for Binary Classification.

[BibT_eX]

[DOI]

Natalie Frank

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Perturbation Analysis of Neural Collapse.

[BibT_eX]

[DOI]

Tom Tirer

Haoxiang Huang

Proceedings of the International Conference on Machine Learning, 2023

Minimax estimation of discontinuous optimal transport maps: The semi-discrete case.

[BibT_eX]

[DOI]

Vincent Divol

Proceedings of the International Conference on Machine Learning, 2023

Sharp thresholds in inference of planted subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Asymptotic confidence sets for random linear programs.

[BibT_eX]

[DOI]

Shuyu Liu

Florentina Bunea

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022

Asymptotics for Semidiscrete Entropic Optimal Transport.

[BibT_eX]

[DOI]

Jason M. Altschuler

Austin J. Stromme

SIAM J. Math. Anal., 2022

The discrepancy of random rectangular matrices.

[BibT_eX]

[DOI]

Dylan J. Altschuler

Random Struct. Algorithms, 2022

Matrix Concentration for Products.

[BibT_eX]

[DOI]

Found. Comput. Math., 2022

A second moment proof of the spread lemma.

[BibT_eX]

[DOI]

CoRR, 2022

On the Second Kahn-Kalai Conjecture.

[BibT_eX]

[DOI]

CoRR, 2022

Strong recovery of geometric planted matchings.

[BibT_eX]

[DOI]

Dmitriy Kunisky

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

Distributional Convergence of the Sliced Wasserstein Process.

[BibT_eX]

[DOI]

Jiaqi Xi

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Asymptotics of smoothed Wasserstein distances in the small noise regime.

[BibT_eX]

[DOI]

Yunzi Ding

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Debiaser Beware: Pitfalls of Centering Regularized Transport Maps.

[BibT_eX]

[DOI]

Marco Cuturi

Proceedings of the International Conference on Machine Learning, 2022

Deep Probability Estimation.

[BibT_eX]

[DOI]

Carlos Fernandez-Granda

Proceedings of the International Conference on Machine Learning, 2022

2021

Streaming k-PCA: Efficient guarantees for Oja's algorithm, beyond rank-one updates.

[BibT_eX]

[DOI]

De Huang

Rachel A. Ward

Proceedings of the Conference on Learning Theory, 2021

2020

Convergence of Smoothed Empirical Measures With Applications to Entropy Estimation.

[BibT_eX]

[DOI]

Ziv Goldfeld

Kristjan H. Greenewald

Yury Polyanskiy

IEEE Trans. Inf. Theory, 2020

Sinkhorn EM: An Expectation-Maximization algorithm based on entropic optimal transport.

[BibT_eX]

[DOI]

CoRR, 2020

Supervised Quantile Normalization for Low-rank Matrix Approximation.

[BibT_eX]

[DOI]

CoRR, 2020

The All-or-Nothing Phenomenon in Sparse Tensor PCA.

[BibT_eX]

[DOI]

Ilias Zadik

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Early-Learning Regularization Prevents Memorization of Noisy Labels.

[BibT_eX]

[DOI]

Sheng Liu

Narges Razavian

Carlos Fernandez-Granda

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Supervised Quantile Normalization for Low Rank Matrix Factorization.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

The Sample Complexity of Multireference Alignment.

[BibT_eX]

[DOI]

SIAM J. Math. Data Sci., 2019

Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem.

[BibT_eX]

[DOI]

Gonzalo Mena

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Massively scalable Sinkhorn distances via the Nyström method.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Optimality of the Plug-in Estimator for Differential Entropy Estimation under Gaussian Convolutions.

[BibT_eX]

[DOI]

Ziv Goldfeld

Kristjan H. Greenewald

Yury Polyanskiy

Proceedings of the IEEE International Symposium on Information Theory, 2019

Estimation of smooth densities in Wasserstein distance.

[BibT_eX]

[DOI]

Quentin Berthet

Proceedings of the Conference on Learning Theory, 2019

Statistical Optimal Transport via Factored Couplings.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018

Approximately Certifying the Restricted Isometry Property is Hard.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Approximating the Quadratic Transportation Metric in Near-Linear Time.

[BibT_eX]

[DOI]

CoRR, 2018

Statistical Optimal Transport via Geodesic Hubs.

[BibT_eX]

[DOI]

CoRR, 2018

An explicit analysis of the entropic penalty in linear programming.

[BibT_eX]

[DOI]

Proceedings of the Conference On Learning Theory, 2018

Minimax Rates and Efficient Algorithms for Noisy Sorting.

[BibT_eX]

[DOI]

Cheng Mao

Philippe Rigollet

Proceedings of the Algorithmic Learning Theory, 2018

2017

Estimation under group actions: recovering orbits from invariants.

[BibT_eX]

[DOI]

CoRR, 2017

The sample complexity of multi-reference alignment.

[BibT_eX]

[DOI]

CoRR, 2017

Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration.

[BibT_eX]

[DOI]

Jason M. Altschuler

Philippe Rigollet

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016

Further results on arc and bar k-visibility graphs.

[BibT_eX]

[DOI]

Mehtaab Sawhney

CoRR, 2016

Online learning in repeated auctions.

[BibT_eX]

[DOI]

Vianney Perchet

Philippe Rigollet

Proceedings of the 29th Conference on Learning Theory, 2016

2015

Multinational War is Hard.

[BibT_eX]

[DOI]