skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 3

Search for: All records

Creators/Authors contains: "Niles-Weed, Jonathan"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Publikationen zu wissenschaftlichen Filmen Sektion Technische Wissenschaften Naturwissenschaften)
    Free, publicly-accessible full text available September 4, 2026
  2. ; ; ; (, Random Structures & Algorithms)
    ABSTRACT A key set‐theoretic “spread” lemma has been central to two recent celebrated results in combinatorics: the recent improvements on the sunflower conjecture by Alweiss, Lovett, Wu, and Zhang; and the proof of the fractional Kahn–Kalai conjecture by Frankston, Kahn, Narayanan, and Park. In this work, we present a new proof of the spread lemma, that—perhaps surprisingly—takes advantage of an explicit recasting of the proof in the language of Bayesian inference. We show that from this viewpoint the reasoning proceeds in a straightforward and principled probabilistic manner, leading to a truncated second moment calculation which concludes the proof. 
    more » « less
    Free, publicly-accessible full text available July 1, 2026
  3. ; ; (, International Mathematics Research Notices)
    Abstract Entropic Brenier maps are regularized analogues of Brenier maps (optimal transport maps) which converge to Brenier maps as the regularization parameter shrinks. In this work, we prove quantitative stability bounds between entropic Brenier maps under variations of the target measure. In particular, when all measures have bounded support, we establish the optimal Lipschitz constant for the mapping from probability measures to entropic Brenier maps. This provides an exponential improvement to a result of Carlier, Chizat, and Laborde (2024). As an application, we prove near-optimal bounds for the stability of semi-discrete unregularized Brenier maps for a family of discrete target measures. 
    more » « less
    Free, publicly-accessible full text available April 1, 2026
  4. ; ; (, The Annals of Statistics)
    Free, publicly-accessible full text available June 1, 2026
  5. ; ; ; ; (, The Annals of Applied Probability)
    Free, publicly-accessible full text available February 1, 2026
  6. ; ; ; ; (, arXiv)
    Free, publicly-accessible full text available November 11, 2025
  7. ; (, arXiv)
    Accepted Manuscript Full Text Available
  8. ; ; ; (, arXiv)
    Accepted Manuscript Full Text Available
  9. ; ; ; ; ; ; (, Neural Information Processing Systems)
    Accepted Manuscript Full Text Available
  10. ; (, Neural Information Processing Systems)
    Accepted Manuscript Full Text Available