Jonathan Weed

Orcid: 0000-0002-4933-1455

Affiliations:
  • New York University, Courant Institute of Mathematical Sciences and Center for Data Science, USA


According to our database1, Jonathan Weed authored at least 42 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
An Improved Central Limit Theorem and Fast Convergence Rates for Entropic Transportation Costs.
SIAM J. Math. Data Sci., September, 2023

It Was "All" for "Nothing": Sharp Phase Transitions for Noiseless Discrete Channels.
IEEE Trans. Inf. Theory, August, 2023

Learning Costs for Structured Monge Displacements.
CoRR, 2023

The Adversarial Consistency of Surrogate Risks for Binary Classification.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Perturbation Analysis of Neural Collapse.
Proceedings of the International Conference on Machine Learning, 2023

Minimax estimation of discontinuous optimal transport maps: The semi-discrete case.
Proceedings of the International Conference on Machine Learning, 2023

Sharp thresholds in inference of planted subgraphs.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Asymptotic confidence sets for random linear programs.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Asymptotics for Semidiscrete Entropic Optimal Transport.
SIAM J. Math. Anal., 2022

The discrepancy of random rectangular matrices.
Random Struct. Algorithms, 2022

Matrix Concentration for Products.
Found. Comput. Math., 2022

A second moment proof of the spread lemma.
CoRR, 2022

On the Second Kahn-Kalai Conjecture.
CoRR, 2022

Strong recovery of geometric planted matchings.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Distributional Convergence of the Sliced Wasserstein Process.
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.
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.
Proceedings of the International Conference on Machine Learning, 2022

Deep Probability Estimation.
Proceedings of the International Conference on Machine Learning, 2022

2021
Streaming k-PCA: Efficient guarantees for Oja's algorithm, beyond rank-one updates.
Proceedings of the Conference on Learning Theory, 2021

2020
Convergence of Smoothed Empirical Measures With Applications to Entropy Estimation.
IEEE Trans. Inf. Theory, 2020

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

Supervised Quantile Normalization for Low-rank Matrix Approximation.
CoRR, 2020

The All-or-Nothing Phenomenon in Sparse Tensor PCA.
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.
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.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
The Sample Complexity of Multireference Alignment.
SIAM J. Math. Data Sci., 2019

Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem.
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.
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.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Estimation of smooth densities in Wasserstein distance.
Proceedings of the Conference on Learning Theory, 2019

Statistical Optimal Transport via Factored Couplings.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Approximately Certifying the Restricted Isometry Property is Hard.
IEEE Trans. Inf. Theory, 2018

Approximating the Quadratic Transportation Metric in Near-Linear Time.
CoRR, 2018

Statistical Optimal Transport via Geodesic Hubs.
CoRR, 2018

An explicit analysis of the entropic penalty in linear programming.
Proceedings of the Conference On Learning Theory, 2018

Minimax Rates and Efficient Algorithms for Noisy Sorting.
Proceedings of the Algorithmic Learning Theory, 2018

2017
Estimation under group actions: recovering orbits from invariants.
CoRR, 2017

The sample complexity of multi-reference alignment.
CoRR, 2017

Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration.
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.
CoRR, 2016

Online learning in repeated auctions.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
Multinational War is Hard.
CoRR, 2015


  Loading...