Minimal graph level sets are concave if boundary is concave.
problem Understanding curvature of minimal graph level sets.
method Proved an inequality and showed geometric properties.
result Level sets of minimal graphs 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…
The paper characterizes potential functions whose level sets are orbits in mechanical systems.
problem Characterizing smooth potential energy functions on the plane with specific level set properties.
method Analyzing inverse curvature flow and properties of level sets.
result Analytic or functions with totally path-disconnected critical sets must be radial, while every compact convex set is a critical set of a Levi potential.
Study on transnormal functions and their level sets on Finsler manifolds.
problem Understanding transnormal functions and their geometric properties on Finsler manifolds.
method Proving smoothness of focal varieties and regular level sets of transnormal functions.
result Focal varieties of a C2 transnormal function are smooth submanifolds and regular level sets are tubes over these varieties.
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.
problem Efficiently identifying regions of a black-box function with limited function evaluations.
method Incorporates prior knowledge from a related function while locally adapting it.
result The method achieves better convergence of level sets compared to standard transfer learning.
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.
problem Ensure starshapedness of level sets of p-capacitary potentials. method Examine horizontally p-harmonic functions in the Heisenberg group. result Sharp conditions for strictly starshaped level sets.
Proposes a method to improve hierarchical clustering using set-level structural priors.
problem Lack of supervision for non-leaf structure in hierarchical clustering.
method Introduces set-level structural priors for semi-supervised hyperbolic hierarchical clustering.
result Improves label consistency and similarity-based tree quality over baselines.
Study approximates unknown function levels with queries.
problem Approximating unknown function levels through sequential queries.
method Introduce Bisect and Approximate algorithms to reduce to local function approximation.
result Rate-optimal sample complexity guarantees for H{ö}lder functions.
Proves a function's locally least gradient property if its level sets are minimal laminations.
problem Understanding the relationship between 1-harmonic functions and minimal laminations.
method Analyzes minimal laminations and their convergence properties, then applies to 1-harmonic functions.
result Proves a function is 1-harmonic if its level sets are minimal laminations.
Proves convexity of level sets of general inverse σ_k equations.
problem Convexity of level sets of general inverse σ_k equations.
method Analyzes level sets of degree n general inverse σ_k equations and uses numerical conditions to verify convexity.
result Proves convexity of level sets of general inverse σ_k equations.
Proves smoothness of conical singularities in mean curvature flow.
problem Resolving singularities in mean curvature flow.
method Analyzes smooth hypersurfaces with isolated conical singularities.
result Smoothness of level set flow through asymptotically conical singularities.
Paper studies generic dynamics of MCFs with spherical singularities.
problem Characterizing the generic behavior of mean curvature flow with spherical singularities.
method Level set formulation of mean curvature flow, analysis of arrival time function.
result Generically, the arrival time function has at most C2 regularity. Generative model learns conditional distributions on collective variable levels.
problem Modeling conditional probability distributions on collective variable levels.
method General and efficient learning approach, data enrichment strategy.
result Effective generative models on different level-sets of collective variables.
New method for analyzing elliptic and parabolic equations.
problem Analyzing elliptic and parabolic equations.
method Level set version of partial uniform ellipticity.
result Effective approach to investigate equations.
The paper studies stability and singularities of a two-convex level set flow.
problem Stability and singularities of a two-convex level set flow.
method Assumes two-convex initial hypersurface and finitely many singular times, then shows the singular set has finitely many connected components.
result Near each connected component of the singular set, the perturbed flow has the same type of singular set.
Proves positive mass theorem for 3-manifolds with a boundary.
problem Proving the positive mass theorem for specific 3-manifolds.
method Uses harmonic level set approach.
result Validates the positive mass theorem for new class of manifolds.
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…
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…
Proposes methods for online conformal prediction with nested prediction sets across multiple confidence levels.
problem Need for uncertainty quantification with multiple confidence levels in diverse applications.
method Online optimization perspective to enforce nestedness of prediction sets while controlling quantile estimation error.
result Achieves stable coverage across all levels, strictly nested prediction sets, and improved efficiency.
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 R2. These equations can be seen as a sub-Riemannian counterpart to classical ODEs arising from the implicit function theorem. We show that they e…
Level set flow's singularities are type I under 2-convexity, leading to specific curvature blow-up rates.
problem Understanding the nature and behavior of singularities in level set flow.
method Analytical approach using Lojasiewicz inequality and curvature blow-up rates.
result The arrival time is C2 near a critical point if and only if it satisfies a Lojasiewicz inequality. 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.
problem Understanding phase transitions through entire solutions of the Allen-Cahn equation.
method Proving minimality of the zero level set with respect to a perimeter functional with density and showing zero mean curvature.
result The zero level set of entire solutions of the Allen-Cahn equation has zero mean curvature and is minimal.
Adaptive coverage policies improve conformal prediction accuracy.
problem Fixed coverage levels in traditional conformal prediction lead to uninformative predictions.
method Optimizes adaptive coverage policy using a neural network trained on leave-one-out calibration.
result Adaptive coverage policies produce more informative and flexible prediction sets.
Study on harmonic functions on nonnegative curvature 3D manifolds.
problem Analyzing harmonic functions on specific 3D manifolds.
method Inspired by Miao, developed a monotonic quantity for level sets of harmonic functions on (R3∖{0},g) with nonnegative scalar curvature. result Established a rigidity result for the derived monotonic quantity.
The clusters of a distribution are often defined by the connected components of a density level set. However, this definition depends on the user-specified level. We address this issue by proposing a simple, generic algorithm, which uses an almost arbitrary level set estimator to estimate the smallest level at which th…
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…
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.
problem Finding clusters with varying densities in data.
method Bagged k-distance with PLLS for mode estimation. result BDMBC achieves optimal convergence rates for mode and level set estimation.
Bayesian Neural Networks improve high-dimensional level set estimation.
problem Scalability issue in existing LSE methods for high-dimensional inputs.
method Bayesian Neural Networks with information-based acquisition functions.
result Proposed method achieves better results than state-of-the-art approaches.
Most of the existing recommender systems use the ratings provided by users on individual items. An additional source of preference information is to use the ratings that users provide on sets of items. The advantages of using preferences on sets are two-fold. First, a rating provided on a set conveys some preference in…
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…
This paper introduces a more efficient method for estimating level sets with a stopping criterion.
problem Efficiently estimating regions where a function exceeds a threshold without exhaustive evaluations.
method Acquisition strategy with a stopping criterion for ε-accurate level set estimation. result The method satisfies ε-accuracy with a confidence level of 1−δ and guarantees on lower bounds of performance metrics. Develops efficient method for nonconvex problems using Regula Falsi.
problem Nonconvex inverse problems with likelihood constraints.
method Regula Falsi root-finding techniques applied to level-set formulations.
result Proves extension of level-set methods to nonconvex problems.
We show that the co-rays to a ray in a complete non-compact Finsler manifold contain geodesic segments to upper level sets of Busemann functions. Moreover, we characterise the co-point set to a ray as the cut locus of such level sets. The structure theorem of the co-point set on a surface, namely that is a local tree, …
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…
BILBO optimizes bilevel problems without repeated lower-level optimizations.
problem Challenges in bilevel optimization, especially in noisy, constrained, and derivative-free settings.
method BILevel Bayesian Optimization (BILBO) that optimizes both levels simultaneously, using confidence-bounds and function query selection.
result Theoretical and empirical evidence of BILBO's effectiveness on various problems.
New condition for reconstructing Morse functions on 3D manifolds.
problem Reconstructing Morse functions with specific level sets.
method Studied a necessary and sufficient condition for reconstruction.
result New condition strengthens previous sufficient conditions.
Develops methods to adjust prediction set coverage based on post-selection analysis.
problem Adjusting prediction set coverage after initial analysis to better fit specific needs.
method Post-selection conformal inference to adjust miscoverage levels.
result Allows for trade-off between coverage and prediction set quality.
New algorithms estimate function levels with near-optimal efficiency.
problem Estimating points where an unknown function exceeds a given threshold.
method Relates to adaptive experimental design methods for linear bandits in RKHS.
result Proves nearly optimal sample complexity bounds for level set estimation.
Improves model classification accuracy in black-box settings.
problem Difficulty in inferring model properties due to limited query access.
method Introduces discriminative factorization to distinguish high-quality queries.
result Probability of chance-level classification decreases exponentially with query budget.
We obtain a finite set of generators for the level 2 mapping class group of a closed nonorientable surface of genus g≥3. This set consists of isotopy classes of Lickorish's Y-homeomorphisms also called crosscap slides.
We construct a minimal generating set of the level 2 mapping class group of a nonorientable surface of genus g, and determine its abelianization for g≥4.
New method improves transductive learning predictions with multiplicative oracle inequalities.
problem Improving transductive learning predictions with known covariates.
method Median of Level-Set Aggregation (MLSA) for transductive LOO prediction.
result Proved multiplicative oracle inequality for LOO error.
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.
Fuzzy prediction sets generalize binary predictions to include elements at varying confidence levels.
problem Binary prediction sets are limited; fuzzy prediction sets offer richer guarantees.
method Generalize prediction sets to fuzzy sets, showing they are e-values with merging properties.
result Optimal e-values lead to optimal fuzzy prediction sets, including optimal conformal prediction.