arXiv research

Harmonic maps to Euclidean buildings have rectifiable singular strata.

We prove existence and regularity of minimizers for Hölder densities over general surfaces of arbitrary dimension and codimension in \(\R^n \), satisfying a cohomological boundary condition, providing a natural dual to Reifenberg's Plateau problem. We generalize and extend methods of Reifenberg, Besicovitch, and Adams,…

We provide a Reifenberg type characterization for $m$-dimensional $C^1$-submanifolds of $\mathbb R^n$. This characterization is also equivalent to Reifenberg-flatness with vanishing constant combined with suitably converging approximating $m$-planes. Moreover, a sufficient condition can be given by the finiteness of th…

These series of notes serve as an introduction to some of both the classical and modern techniques in Reifenberg theory. At its heart, Reifenberg theory is about studying general sets or measures which can be, in one sense or another, approximated on all scales by well behaved spaces, typically just Euclidean space its…

We study generalizations of Reifenberg's Theorem for measures in $\mathbb R^n$ under assumptions on the Jones' $β$-numbers, which appropriately measure how close the support is to being contained in a subspace. Our main results, which holds for general measures without density assumptions, give effective measure bounds…

This paper improves Reifenberg's theorem for almost calibrated sets, ensuring rectifiability with volume bounds.

Proof of Reifenberg theorem in metric spaces, expanding on Cheeger and Colding's work.

The study defines a canonical nilpotent structure for certain collapsed manifolds.

The aim of this article is to study effective Reifenberg theorems for measures in a Hilbert or Banach space. For Hilbert spaces, we see all the results from $\mathbb{R}^n$ continue to hold with no additional restrictions. For a general Banach spaces we will see that the classical Reifenberg theorem holds, and that a we…

In this paper, we study the critical case of the Allard regularity theorem. Combining with Reifenberg's topological disk theorem, we get a critical Allard-Reifenberg type regularity theorem. As a main result, we get the topological finiteness for a class of properly immersed surfaces in $\mathbb{R}^n$ with finite Willm…

In this paper we study the regularity of stationary and minimizing harmonic maps $f:B_2(p)\subseteq M\to N$ between Riemannian manifolds. If $S^k(f)\equiv\{x\in M: \text{ no tangent map at $x$ is }k+1\text{-symmetric}\}$ is $k^{th}$-stratum of the singular set of $f$, then it is well known that $\dim S^k\leq k$, howeve…

In 1960 Reifenberg proved the topological disc property. He showed that a subset of $R^n$ which is well approximated by $m$-dimensional affine spaces at each point and at each (small) scale is locally a bi-Hölder image of the unit ball in $R^m$. In this paper we prove that a subset of $R^3$ which is well approximated b…

We study the existence and uniqueness of smooth mean curvature flow, in arbitrary dimension and co-dimension, emanating from so called $k$-dimensional $(\varepsilon,R)$ Reifenberg flat sets in $\mathbb{R}^n$. Our results generalize the ones from a previous paper by the author, in which the co-dimension one case (i.e. $…

In this paper, we prove short time existence and uniqueness of smooth evolution by mean curvature in $\mathbb{R}^{n+1}$ starting from any $n$-dimensional $(\varepsilon,R)$-Reifenberg flat set with $\varepsilon$ sufficiently small. More precisely, we show that the level set flow in such a situation is non-fattening and …

We study here limit spaces $(M_α,g_α,p_α)\stackrel{GH}{\rightarrow} (Y,d_Y,p)$, where the $M_α$ have a lower Ricci curvature bound and are volume noncollapsed. Such limits $Y$ may be quite singular, however it is known that there is a subset of full measure $\cR(Y)\subseteq Y$, called {\it regular} points, along with c…

In this article we extend to generic $p$-energy minimizing maps between Riemannian manifolds a regularity result which is known to hold in the case $p=2$. We first show that the set of singular points of such a map can be quantitatively stratified: we classify singular points based on the number of almost-symmetries of…

Paper provides estimates for varifolds with critical mean curvature.

The paper proves stability of Ricci flow for certain initial conditions.

Unified proof of smooth fibration theorems for collapsed manifolds.

The paper proves fibration theorems for manifolds with almost nonnegative Ricci curvature.

We study collapsed manifolds with Ricci bounded covering geometry i.e., Ricci curvature is bounded below and the Riemannian universal cover is non-collapsed or consists of uniform Reifenberg points. Via Ricci flows' techniques, we partially extend the nilpotent structural results of Cheeger-Fukaya-Gromov, on collapsed …

We adapt to an infinite dimensional ambient space E.R. Reifenberg's epiperimetric inequality and a quantitative version of D. Preiss' second moments computations to establish that the set of regular points of an almost mass minimizing rectifiable $G$ chain in $\ell_2$ is dense in its support, whenever the group $G$ of …

In this paper we first review the covering space method with constrained BV functions for solving the classical Plateau's problem. Next, we carefully analyze some interesting examples of soap films compatible with the covering space method: in particular, the case of a soap film only partially wetting a space curve, a …

Plateau's problem is to find a surface with minimal area spanning a given boundary. In 1960, Reifenberg and Adams developed a definition for "span" using Čech homology, and variants of this definition have been used ever sense. However, limitations of Čech homology resulted in the lack of a natural definition for a bou…

The paper studies harmonic map flows and proves rectifiability of singular sets.

This paper studies limits of aspherical manifolds with specific curvature conditions.

We prove a new logarithmic epiperimetric inequality for multiplicity-one stationary cones with isolated singularity by flowing in the radial direction any given trace along appropriately chosen directions. In contrast to previous epiperimetric inequalities for minimal surfaces (e.g. those of Reifenberg, Taylor and Whit…

Study Ricci flows on manifolds, proving they behave like self-similar solutions and confirming a conjecture.

The paper proves a transformation theorem under a monotone property of almost Euclidean factors of geodesic balls.

SED integrates synthesis, execution, and debugging for neural program synthesis.

A canonical diffeomorphism is constructed for manifolds near spheres.

Improves probabilistic programming by analyzing program structure.

We propose design guidelines for a probabilistic programming facility suitable for deployment as a part of a production software system. As a reference implementation, we introduce Infergo, a probabilistic programming facility for Go, a modern programming language of choice for server-side software development. We argu…

We introduce the notion of a stochastic probabilistic program and present a reference implementation of a probabilistic programming facility supporting specification of stochastic probabilistic programs and inference in them. Stochastic probabilistic programs allow straightforward specification and efficient inference …

A neural program synthesis method with iterative fix operations.

Graph-based approach repairs programs from diagnostic feedback.

A key feature of inductive logic programming (ILP) is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs. In this paper, we introduce techniques to learn higher-order programs. Specifically, we extend meta-interpretive learning (MIL) to support learning higher…

We present a new algorithm for approximate inference in probabilistic programs, based on a stochastic gradient for variational programs. This method is efficient without restrictions on the probabilistic program; it is particularly practical for distributions which are not analytically tractable, including highly struc…

Program synthesis is the task of automatically generating a program consistent with a specification. Recent years have seen proposal of a number of neural approaches for program synthesis, many of which adopt a sequence generation paradigm similar to neural machine translation, in which sequence-to-sequence models are …

We consider the task of mapping pseudocode to long programs that are functionally correct. Given test cases as a mechanism to validate programs, we search over the space of possible translations of the pseudocode to find a program that passes the validation. However, without proper credit assignment to localize the sou…

We develop a technique for generalising from data in which models are samplers represented as program text. We establish encouraging empirical results that suggest that Markov chain Monte Carlo probabilistic programming inference techniques coupled with higher-order probabilistic programming languages are now sufficien…

A mean curvature flow starting from a closed embedded hypersurface in $R^{n+1}$ must develop singularities. We show that if the flow has only generic singularities, then the space-time singular set is contained in finitely many compact embedded $(n-1)$-dimensional Lipschitz submanifolds plus a set of dimension at most …

This book is a graduate-level introduction to probabilistic programming. It not only provides a thorough background for anyone wishing to use a probabilistic programming system, but also introduces the techniques needed to design and build these systems. It is aimed at people who have an undergraduate-level understandi…

Adapting neural networks to guide program optimization for better classifiers.

Neural program embedding can be helpful in analyzing large software, a task that is challenging for traditional logic-based program analyses due to their limited scalability. A key focus of recent machine-learning advances in this area is on modeling program semantics instead of just syntax. Unfortunately evaluating su…

CrossBeam learns to search more efficiently in program synthesis.

The seven non euclidean geometries of the Thurston's geometrization program are proved to originate naturally from singularization morphisms and versal deformations on euclidean 3-manifolds generated in the frame of the Langlands global program. The Poincare conjecture for a 3-manifold appears as a particular case of t…

Program or process is an integral part of almost every IT/OT system. Can we trust the identity/ID (e.g., executable name) of the program? To avoid detection, malware may disguise itself using the ID of a legitimate program, and a system tool (e.g., PowerShell) used by the attackers may have the fake ID of another commo…