Publication


Featured researches published by Vishesh Jain.


Journal of Topology and Analysis | 2015

On discontinuity of planar optimal transport maps

Otis Chodosh; Vishesh Jain; Michael Lindsey; Lyuboslav Panchev; Yanir A. Rubinstein

Consider two bounded domains Ω and Λ in ℝ2, and two sufficiently regular probability measures μ and ν supported on them. By Breniers theorem, there exists a unique transportation map T satisfying T#μ = ν and minimizing the quadratic cost ∫ℝn ∣T(x) - x∣2 dμ(x). Furthermore, by Caffarellis regularity theory for the real Monge–Ampere equation, if Λ is convex, T is continuous. We study the reverse problem, namely, when is T discontinuous if Λ fails to be convex? We prove a result guaranteeing the discontinuity of T in terms of the geometries of Λ and Ω in the two-dimensional case. The main idea is to use tools of convex analysis and the extrinsic geometry of ∂Λ to distinguish between Brenier and Alexandrov weak solutions of the Monge–Ampere equation. We also use this approach to give a new proof of a result due to Wolfson and Urbas. We conclude by revisiting an example of Caffarelli, giving a detailed study of a discontinuous map between two explicit domains, and determining precisely where the discontinuities occur.


arXiv: Learning | 2017

Approximating Partition Functions in Constant Time.

Vishesh Jain; Frederic Koehler; Elchanan Mossel


foundations of computer science | 2018

1-factorizations of pseudorandom graphs

Asaf Ferber; Vishesh Jain


conference on learning theory | 2018

The Vertex Sample Complexity of Free Energy is Polynomial

Vishesh Jain; Frederic Koehler; Elchanan Mossel


conference on learning theory | 2018

The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity

Vishesh Jain; Frederic Koehler; Elchanan Mossel


arXiv: Probability | 2018

On the number of Hadamard matrices via anti-concentration.

Asaf Ferber; Vishesh Jain; Yufei Zhao


arXiv: Probability | 2018

Singularity of random symmetric matrices -- a combinatorial approach to improved bounds

Asaf Ferber; Vishesh Jain


arXiv: Learning | 2018

Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective.

Vishesh Jain; Frederic Koehler; Andrej Risteski


arXiv: Combinatorics | 2018

Towards the linear arboricity conjecture.

Asaf Ferber; Jacob Fox; Vishesh Jain


arXiv: Combinatorics | 2018

Number of 1-factorizations of regular high-degree graphs

Asaf Ferber; Vishesh Jain; Benny Sudakov

Researchain Logo
Decentralizing Knowledge