Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

199397596794 · Jun 202019922001200920172026
48 results for Sublevel Set

We establish formulas that give the intrinsic volumes, or curvature measures, of sublevel sets of functions defined on Riemannian manifolds as integrals of functionals of the function and its derivatives. For instance, in the Euclidean case, if fC3(Rn,R)f \in \mathcal{C}^3(\mathbb{R}^n, \mathbb{R}) and 0 is a regular value of…

2019-03-04abs ↗pdf ↗

This paper shows that every sublevel set of the loss function of a class of deep over-parameterized neural nets with piecewise linear activation functions is connected and unbounded. This implies that the loss has no bad local valleys and all of its global minima are connected within a unique and potentially very large…

2019-01-22abs ↗pdf ↗

Study of Willmore energy on sphere sublevel sets and flow singularities.

problem Understanding the Willmore energy landscape and singularities of the Willmore flow.
method Gluing different instances of the Willmore flow and using an invariant for triple-point-free spheres.
result Classification of initial surfaces with energy at most 12π leading to unavoidable singularities.

The paper studies convexity of products of squared Euclidean distances.

problem Convexity of products of squared Euclidean distances.
method Proved a convexity principle and applied it to products of squared distances, computed Hessian-positive regions and exact convexity levels.
result Computed exact convexity and quasiconvexity truncation levels for the two-centre model.

We develop an algorithm for minimizing a function using nn batched function value measurements at each of TT rounds by using classifiers to identify a function's sublevel set. We show that sufficiently accurate classifiers can achieve linear convergence rates, and show that the convergence rate is tied to the difficu…

2018-04-11abs ↗pdf ↗

Characterizes complex Hessian equations for bounded energy functions.

problem Understanding degenerate complex Hessian equations for bounded energy functions.
method Proving sublevel set estimates and using Sobolev inequalities.
result Characterization of degenerate complex Hessian equations for bounded (p,m)(p,m)-energy functions.

Given a finite set of points in Rn\mathbb R^n and a radius parameter, we study the Čech, Delaunay-Čech, Delaunay (or Alpha), and Wrap complexes in the light of generalized discrete Morse theory. Establishing the Čech and Delaunay complexes as sublevel sets of generalized discrete Morse functions, we prove that the four…

2013-12-04abs ↗pdf ↗

Study sharp decay of capacity for subharmonic functions on compact Hermitian manifolds.

problem Sharp decay of capacity of sublevel sets of (ω,m)(\omega,m)-subharmonic functions.
method Generalizes previous results on Kähler manifolds and obtains full characterizations of polar sets.
result Full characterizations of polar sets and extremal functions.

The paper develops finite knot theory using ropelength-filtered Reidemeister graphs.

problem Understanding knot types in bounded ropelength sublevel spaces.
method Study thick representatives in bounded ropelength sublevel spaces through lifted Reidemeister graphs.
result Define characteristic Reidemeister patterns and finite recognition length.

The study analyzes the evolution of Gaussian measures under a specific gradient flow.

problem Analyzing the evolution of Gaussian measures under a specific gradient flow.
method Derives ordinary differential equations governing the evolution of mean, covariance, and mass under the HK-Boltzmann gradient flow.
result Exponential convergence to equilibrium demonstrated through Polyak-Lojasiewicz-type inequalities.

Outlier detection methods have become increasingly relevant in recent years due to increased security concerns and because of its vast application to different fields. Recently, Pauwels and Lasserre (2016) noticed that the sublevel sets of the inverse Christoffel function accurately depict the shape of a cloud of data …

2018-06-18abs ↗pdf ↗

Classical Morse theory proceeds by considering sublevel sets f1(,a]f^{-1}(-\infty, a] of a Morse function f:MRf: M \to R, where MM is a smooth finite-dimensional manifold. In this paper, we study the topology of the level sets f1(a)f^{-1}(a) and give conditions under which the topology of f1(a)f^{-1}(a) changes when passing a cri…

2019-10-11abs ↗pdf ↗

The paper uses MDM theory to analyze multifiltering functions on simplicial complexes.

problem Understanding multifiltering functions through discrete Morse theory.
method Applying multiparameter discrete Morse theory to vector-valued multifiltering functions.
result Any multifiltering function can be approximated by a compatible MDM function.

Extends Morse-Forman theory to vector-valued functions for multiparameter persistence.

problem Computing multiparameter persistence with new tools and methods.
method Adapting Forman's theory to vectorial setting and using combinatorial topological dynamics.
result Established more general result for sublevel sets and found a way to induce Morse decomposition.

This paper was motivated by work of Arnold where he explains how to count "snakes", i.e. Morse functions on the real axis with prescribed behavior at infinity. This leads immediately to a count of excellent Morse functions on the circle, where following Thom's terminology, excellent means that no two critical points li…

2005-12-21abs ↗pdf ↗

Two of the authors have defined the class WDC(M) WDC(M) as the class of all subsets of a smooth manifold MM that may be expressed in local coordinates as certain sublevel sets of DC (differences of convex) functions. If MM is Riemanian and GG is a group of isometries acting transitively on the sphere bundle SMSM, we def…

2015-05-13abs ↗pdf ↗

We introduce a natural definition of LpL^p-convergence of maps, p1p \ge 1, in the case where the domain is a convergent sequence of measured metric space with respect to the measured Gromov-Hausdorff topology and the target is a Gromov-Hausdorff convergent sequence. With the LpL^p-convergence, we establish a theory of …

2005-05-20abs ↗pdf ↗

We extend the Weil-Petersson metric to a projective variety with continuous local potentials.

problem Continuity of the Weil-Petersson potential on moduli spaces of Kähler-Einstein manifolds and varieties.
method Proving the extension of the Weil-Petersson metric as a closed positive current with continuous local potentials.
result The Weil-Petersson metric extends uniquely to the projective variety as a closed positive current with continuous local potentials.

New acquisition functions improve Bernoulli LSE.

problem Efficiently estimating regions where a Bernoulli function is above or below a threshold.
method Developed new look-ahead acquisition functions for Gaussian process classification models.
result Demonstrated clear benefits of new acquisition functions on benchmark and real-world tasks.

New rigidity result for hyperbolic surfaces based on curve lengths.

problem Determining hyperbolic metrics on surfaces from curve lengths.
method Investigating oriented graphs on curve complexes and Dehn quasi-homothetic functions.
result Knowing which curve is longer suffices to determine the hyperbolic metric on a surface.

MOPI optimizes flexible set-valued mappings to achieve superior shape adaptivity in conformal prediction.

problem Challenges in achieving valid conditional coverage in conformal prediction.
method Minimax Optimization Predictive Inference (MOPI) framework that optimizes over a flexible class of set-valued mappings.
result MOPI achieves superior shape adaptivity and maintains a principled connection to mean squared coverage error.

Let XX be a compact Kähler manifold and $\om$ a smooth closed form of bidegree (1,1)(1,1) which is nonnegative and big. We study the classes ${\mathcal E}_χ(X,\om)$ of $\om$-plurisubharmonic functions of finite weighted Monge-Ampère energy. When the weight χχ has fast growth at infinity, the corresponding functions are …

2007-04-06abs ↗pdf ↗

We solve the optimization of two-layer ReLU networks using convex math.

problem Optimizing two-layer ReLU neural networks.
method Exact characterization of optimal solutions via convex optimization.
result We prove that all globally optimal solutions can be found via convex optimization.

New theorem shows gaps in magnetic Schrödinger operator spectra for large coupling.

problem Understanding gaps in spectra of magnetic Schrödinger operators.
method Analyzes spectral properties of non-periodic magnetic Schrödinger operators.
result Spectral projections of large coupling operators vanish in K-theory.

Study semicontinuity of capacity in non-smooth spaces using intrinsic flat convergence.

problem Investigate semicontinuity of capacity in non-smooth spaces.
method Analyze sequences of local integral current spaces converging in the pointed Sormani-Wenger intrinsic flat sense.
result Prove upper semicontinuity of capacity for balls and Lipschitz sublevel sets under volume-preserving convergence.

This paper calibrates Gaussian process predictive distributions for Bayesian optimization to improve sampling decisions.

problem Lower-tail miscalibration in GP predictive distributions affects BO sampling decisions.
method Introduces goal-oriented calibration for GP predictive distributions below a threshold tt.
result Post-hoc method tcGP improves lower-tail calibration and BO performance.

Develops robust MDPs for unknown disturbances with performance guarantees.

problem Unknown disturbance distribution in MDPs.
method Empirical distribution, sublevel set of distance function, weak convergence, concentration inequality.
result Robust optimal value function converges to true optimal value function with increasing sample sizes.

Paper uses TDA for automated Parkinson's disease classification and severity assessment.

problem Manual diagnosis of neurological diseases is time-consuming and inaccurate.
method Combines Topological Data Analysis (TDA) with machine learning on postural shift data.
result Proposes a stable and accurate method for classifying Parkinson's disease.

In this paper, we study the efficiency of a {\bf R}estarted {\bf S}ub{\bf G}radient (RSG) method that periodically restarts the standard subgradient method (SG). We show that, when applied to a broad class of convex optimization problems, RSG method can find an εε-optimal solution with a lower complexity than the SG m…

2015-12-09abs ↗pdf ↗

TRAiL is a linear bandit algorithm that ensures optimal regret and guarantees inference quality.

problem Optimal regret and inference quality in linear bandits with convex action sets.
method TRAiL estimates the parameter through regularized least squares and perturbs the action set along the tangent plane.
result TRAiL achieves an Ω(T)Ω(\sqrt{T}) upper bound on cumulative regret with high probability.

New method for optimization on Hadamard manifolds with curvature-independent guarantees.

problem Curvature-dependent complexity in geodesic convex optimization.
method Introducing horospherical convexity and developing algorithms for optimization.
result Curvature-independent convergence of subgradient descent and Nesterov's method.

Persistence diagrams from random matrices follow RMT universality, offering a new spectral diagnostic.

problem Understanding spectral properties of random matrices using topological data analysis.
method Applying Morse theory to persistence diagrams of quadratic forms restricted to unit spheres.
result Persistence entropy outperforms traditional level spacing ratios in discriminating random matrix ensembles.