Jonathan Weed

Publication Activity (10 Years)

Years Active: 2015-2019
Publications (10 Years): 23

Top Topics

Sample Complexity

Information Revelation

Gaussian Convolution

Top Venues

IEEE Trans. Inf. Theory

Publications

Ziv Goldfeld, Kristjan H. Greenewald, Yury Polyanskiy, Jonathan Weed
Convergence of Smoothed Empirical Measures with Applications to Entropy Estimation. CoRR (2019)
Ziv Goldfeld, Kristjan H. Greenewald, Jonathan Weed, Yury Polyanskiy
Optimality of the Plug-in Estimator for Differential Entropy Estimation under Gaussian Convolutions. ISIT (2019)
Amelia Perry, Jonathan Weed, Afonso S. Bandeira, Philippe Rigollet, Amit Singer
The Sample Complexity of Multireference Alignment. SIAM J. Math. Data Sci. 1 (3) (2019)
Jonathan Weed, Quentin Berthet
Estimation of smooth densities in Wasserstein distance. COLT (2019)
Gonzalo Mena, Jonathan Weed
Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem. CoRR (2019)
Aden Forrow, Jan-Christian Hütter, Mor Nitzan, Philippe Rigollet, Geoffrey Schiebinger, Jonathan Weed
Statistical Optimal Transport via Factored Couplings. AISTATS (2019)
Jonathan Weed
Approximately Certifying the Restricted Isometry Property is Hard. IEEE Trans. Inf. Theory 64 (8) (2018)
Jonathan Weed
An explicit analysis of the entropic penalty in linear programming. COLT (2018)
Jason Altschuler, Francis R. Bach, Alessandro Rudi, Jonathan Weed
Massively scalable Sinkhorn distances via the Nyström method. CoRR (2018)
Aden Forrow, Jan-Christian Hütter, Mor Nitzan, Geoffrey Schiebinger, Philippe Rigollet, Jonathan Weed
Statistical Optimal Transport via Geodesic Hubs. CoRR (2018)
Jonathan Weed
An explicit analysis of the entropic penalty in linear programming. CoRR (2018)
Jason Altschuler, Francis R. Bach, Alessandro Rudi, Jonathan Weed
Approximating the Quadratic Transportation Metric in Near-Linear Time. CoRR (2018)
Cheng Mao, Jonathan Weed, Philippe Rigollet
Minimax Rates and Efficient Algorithms for Noisy Sorting. ALT (2018)
Cheng Mao, Jonathan Weed, Philippe Rigollet
Minimax Rates and Efficient Algorithms for Noisy Sorting. CoRR (2017)
Jonathan Weed
Approximately certifying the restricted isometry property is hard. CoRR (2017)
Jason Altschuler, Jonathan Weed, Philippe Rigollet
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration. NIPS (2017)
Jason Altschuler, Jonathan Weed, Philippe Rigollet
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration. CoRR (2017)
Afonso S. Bandeira, Ben Blum-Smith, Amelia Perry, Jonathan Weed, Alexander S. Wein
Estimation under group actions: recovering orbits from invariants. CoRR (2017)
Amelia Perry, Jonathan Weed, Afonso S. Bandeira, Philippe Rigollet, Amit Singer
The sample complexity of multi-reference alignment. CoRR (2017)
Mehtaab Sawhney, Jonathan Weed
Further results on arc and bar k-visibility graphs. CoRR (2016)
Jonathan Weed, Vianney Perchet, Philippe Rigollet
Online learning in repeated auctions. COLT (2016)
Jonathan Weed, Vianney Perchet, Philippe Rigollet
Online learning in repeated auctions. CoRR (2015)
Jonathan Weed
Multinational War is Hard. CoRR (2015)