arXiv research

Minimal graph level sets are concave if boundary is concave.

Forecasts of multivariate probability distributions are required for a variety of applications. Scoring rules enable the evaluation of forecast accuracy, and comparison between forecasting methods. We propose a theoretical framework for scoring rules for multivariate distributions, which encompasses the existing quadra…

Study on transnormal functions and their level sets on Finsler manifolds.

We propose and analyze a constrained level-set method for semi-automatic image segmentation. Our level-set model with constraints on the level-set function enables us to specify which parts of the image lie inside respectively outside the segmented objects. Such a-priori information can be expressed in terms of upper a…

Paper presents a robust transfer learning method for active level set estimation.

Families of hypersurfaces that are level-set families of harmonic functions free of critical points are characterized by a local differential-geometric condition. Harmonic functions with a specified level-set family are constructed from geometric data. As a by-product, it is shown that the evolution of the gradient of …

Find conditions for starshapedness of level sets in Heisenberg group.

Proves a function's locally least gradient property if its level sets are minimal laminations.

Proves convexity of level sets of general inverse σ_k equations.

Proves smoothness of conical singularities in mean curvature flow.

Paper studies generic dynamics of MCFs with spherical singularities.

New method for analyzing elliptic and parabolic equations.

Proves positive mass theorem for 3-manifolds with a boundary.

The level set tree approach of Hartigan (1975) provides a probabilistically based and highly interpretable encoding of the clustering behavior of a dataset. By representing the hierarchy of data modes as a dendrogram of the level sets of a density estimator, this approach offers many advantages for exploratory analysis…

We introduce novel equations, in the spirit of rough path theory, that parametrize level sets of intrinsically regular maps on the Heisenberg group with values in $\mathbb{R}^2$. These equations can be seen as a sub-Riemannian counterpart to classical ODEs arising from the implicit function theorem. We show that they e…

Study approximates unknown function levels with queries.

In this article we use the mean curvature flow with surgery to derive regularity estimates for the level set flow going past Brakke regularity in certain special conditions allowing for 2-convex regions of high density. We also show a stability result for the plane under the level set flow.

Study shows zero level sets of solutions to Allen-Cahn equation are minimal surfaces with zero mean curvature.

Study on harmonic functions on nonnegative curvature 3D manifolds.

Generative model learns conditional distributions on collective variable levels.

The level sets of neural networks represent fundamental properties such as decision boundaries of classifiers and are used to model non-linear manifold data such as curves and surfaces. Thus, methods for controlling the neural level sets could find many applications in machine learning. In this paper we present a simpl…

In this note we prove that the level-set flow of the topologist's sine curve is a smooth closed curve. In previous work it was shown by the second author that under level-set flow, a locally-connected set in the plane evolves to be smooth, either as a curve or as a positive area region bounded by smooth curves. Here we…

Estimating the level set of a signal from measurements is a task that arises in a variety of fields, including medical imaging, astronomy, and digital elevation mapping. Motivated by scenarios where accurate and complete measurements of the signal may not available, we examine here a simple procedure for estimating the…

BDMBC clusters data with varying densities using a new PLLS measure.

The paper studies stability and singularities of a two-convex level set flow.

Level set flow's singularities are type I under 2-convexity, leading to specific curvature blow-up rates.

Develops efficient method for nonconvex problems using Regula Falsi.

The paper characterizes potential functions whose level sets are orbits in mechanical systems.

New condition for reconstructing Morse functions on 3D manifolds.

For the minimal graph defined on a convex ring in the space form with nonnegative curvature, we obtain the regularity and the strict convexity about its level sets by the continuity method.

In this paper, the problem of estimating the level set of a black-box function from noisy and expensive evaluation queries is considered. A new algorithm for this problem in the Bayesian framework with a Gaussian Process (GP) prior is proposed. The proposed algorithm employs a hierarchical sequence of partitions to exp…

We analyze the level sets of the norm of the Witten spinor in an asymptotically flat Riemannian spin manifold of positive scalar curvature. Level sets of small area are constructed. We prove curvature estimates which quantify that, if the total mass becomes small, the manifold becomes flat with the exception of a set o…

The study classifies rational isoparametric functions on Damek-Ricci spaces.

We prove two new estimates for the level set flow of mean convex domains in Riemannian manifolds. Our estimates give control - exponential in time - for the infimum of the mean curvature, and the ratio between the norm of the second fundamental form and the mean curvature. In particular, the estimates remove a stumblin…

We make use of the flexibility of infinite-index solutions to the Allen-Cahn equation to show that, given any compact hypersurface $Σ$ of R^d, with $d\geq 4$, there is a bounded entire solution of the Allen-Cahn equation on R^d whose zero level set has a connected component diffeomorphic (and arbitrarily close) to a re…

The paper classifies Morse functions on 3-manifolds with specific level sets.

The nonzero level sets of a homogeneous, logarithmically homogeneous, or translationally homogeneous function are affine spheres if and only if the Hessian determinant of the function is a multiple of a power or an exponential of the function. In particular, the nonzero level sets of a homogeneous polynomial are proper…

The study examines constant weighted mean curvature hypersurfaces in shrinking Ricci solitons.

New method improves transductive learning predictions with multiplicative oracle inequalities.

Study of mean curvature flow with obstacles using singular perturbation.

This paper introduces a more efficient method for estimating level sets with a stopping criterion.

We propose a deep learning strategy to estimate the mean curvature of two-dimensional implicit interfaces in the level-set method. Our approach is based on fitting feed-forward neural networks to synthetic data sets constructed from circular interfaces immersed in uniform grids of various resolutions. These multilayer …

Bayesian Neural Networks improve high-dimensional level set estimation.

Let a torus T act effectively on a compact connected cooriented contact manifold, and let Psi be the natural momentum map on the symplectization. We prove that, if dim T > 2, the union of the origin with the image of Psi is a convex polyhedral cone, the non-zero level sets of Psi are connected (while the zero level set…

Isometries of metric spaces $(X,d)$ preserve all level sets of $d$. We formulate and prove cases of a conjecture asserting if $X$ is a complete Riemannian manifold, then a function $f:X \rightarrow X$ preserving at least one level set $d^{-1}(r)$, with $r>0$ small enough, is an isometry.

A new method optimizes spatial sampling for level set estimation in one dimension.

We study the connections between spectral clustering and the problems of maximum margin clustering, and estimation of the components of level sets of a density function. Specifically, we obtain bounds on the eigenvectors of graph Laplacian matrices in terms of the between cluster separation, and within cluster connecti…

We study the level sets of the distance function from a boundary point of a convex set in Euclidean space. We provide a lower bound for the range of connectivity of the level sets, in terms of the critical points of the distance function in the sense of Grove-Shiohama-Gromov-Cheeger.