Jonathan Niles-Weed
22 papers · 2017–2025 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+8 more ↓ Show less ↑
🏃 Academic Marathon (8) 🧭 Keyword Pioneer 🌉 Interdisciplinary Bridge 🌍 Conference Polyglot (5) 🐝 Cross-Pollinator (10)
🏃
Academic Marathon
(8)
🧭
Keyword Pioneer
🧬
Topic Evolution
🔥
Unstoppable
(7)
💎
Century Club
(22)
⚡
Prolific Year
(5)
📈
Trend Setter
🗃️
Keyword Collector
(93)
Conferences
NIPS (10)
ICML (6)
COLT (4)
AISTATS (1)
JMLR (1)
Top co-authors
Keywords
optimal transport
(9)
phase transition
(4)
wasserstein distance
(3)
binary classification
(2)
transport map
(2)
surrogate loss
(2)
entropic regularization
(2)
entropic optimal transport
(2)
statistical inference
(1)
robust classification
(1)
statistical consistency
(1)
sample complexity
(1)
adversarial training
(1)
deep learning
(1)
adversarial learning
(1)
epistemic uncertainty
(1)
feature learning
(1)
label noise
(1)
gene expression
(1)
subspace tracking
(1)
Papers
Conditional simulation via entropic optimal transport: Toward non-parametric estimation of conditional Brenier maps
AISTATS 2025
Trajectory Inference with Smooth Schrödinger Bridges
ICML 2025
Learning Elastic Costs to Shape Monge Displacements
NIPS 2024
Existence and Minimax Theorems for Adversarial Surrogate Risks in Binary Classification
JMLR 2024
Progressive Entropic Optimal Transport Solvers
NIPS 2024
Asymptotic confidence sets for random linear programs
COLT 2023
Perturbation Analysis of Neural Collapse
ICML 2023
Minimax estimation of discontinuous optimal transport maps: The semi-discrete case
ICML 2023
The Adversarial Consistency of Surrogate Risks for Binary Classification
NIPS 2023
Sharp thresholds in inference of planted subgraphs
COLT 2023
Distributional Convergence of the Sliced Wasserstein Process
NIPS 2022
Debiaser Beware: Pitfalls of Centering Regularized Transport Maps
ICML 2022
Deep Probability Estimation
ICML 2022
Asymptotics of smoothed Wasserstein distances in the small noise regime
NIPS 2022
Streaming k-PCA: Efficient guarantees for Oja’s algorithm, beyond rank-one updates
COLT 2021
It was “all” for “nothing”: sharp phase transitions for noiseless discrete channels
COLT 2021
Supervised Quantile Normalization for Low Rank Matrix Factorization
ICML 2020
Early-Learning Regularization Prevents Memorization of Noisy Labels
NIPS 2020
The All-or-Nothing Phenomenon in Sparse Tensor PCA
NIPS 2020
Massively scalable Sinkhorn distances via the Nyström method
NIPS 2019
Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem
NIPS 2019
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
NIPS 2017