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,695 papers · 148 categories

Trend · papers per month

91183274365 · Jun 202019922001200920172026
48 results for Global Minimizer

The ultimate goal of optimization is to find the minimizer of a target function.However, typical criteria for active optimization often ignore the uncertainty about the minimizer. We propose a novel criterion for global optimization and an associated sequential active learning strategy using Gaussian processes.Our crit…

2012-02-09abs ↗pdf ↗

Euler's elastica with monotone curvature is uniquely minimal.

problem Global minimality of planar elastica with monotone curvature.
method Proof of global minimality using clamped boundary conditions and length penalization.
result Every planar elastica with non-constant monotone curvature is uniquely minimal.

The paper studies minimal surface flow and translating solitons, proving global solutions and convergence.

problem Finding global solutions and convergence of minimal surface flow and translating solitons.
method Evolved surfaces over convex planar domains evolving by minimal surface flow, proving a priori estimates for translating solitons.
result Global solutions of minimal surface flow converge to translating solitons under suitable conditions.

First order methods can take extremely long to find global minima of non-convex functions.

problem Finding global minimizers of non-convex functions.
method Designing a family of non-convex functions and using statistical lower bounds for parameter estimation.
result First order methods can take exponential time to converge to a global minimizer.

We study global Mumford-Shah minimizers in RN\R^N, introduced by Bonnet as blow-up limits of Mumford-Shah minimizers. We prove a new monotonicity formula for the energy of uu when the singular set KK is contained in a smooth enough cone. We then use this monotonicity to prove that for any reduced global minimizer $(u…

2014-03-11abs ↗pdf ↗

Study finds conditions for global minimizers on curved manifolds with fast diffusion and nonlocal interactions.

problem Existence of global minimizers for a free energy functional on negatively curved manifolds.
method Investigation of Carlson-Levin type inequalities for Cartan-Hadamard manifolds.
result Establishes necessary and sufficient conditions for the existence of global energy minimizers.

We derive a Bernstein type result for the special Lagrangian equation, namely, any global convex solution must be quadratic. In terms of minimal surfaces, the result says that any global minimal Lagrangian graph with convex potential must be a hyper-plane.

2002-01-20abs ↗pdf ↗

SGD methods fail to converge to global minimizers in deep neural networks with ReLU activation.

problem Failure of SGD methods to converge to global minimizers in deep neural networks.
method Stochastic Gradient Descent (SGD) and its variants like Adam, RMSProp, etc.
result SGD methods fail to converge to global minimizers with high probability in deep neural networks with ReLU activation.

WSFN overcomes saddle points for non-convex functionals in Wasserstein space.

problem Minimizing non-convex functionals over the Wasserstein space with saddle point avoidance.
method WSFN is a second-order method that preconditions the Wasserstein gradient to avoid saddle points.
result WSFN escapes saddle regions and reaches a global minimizer in polynomial time.

The paper finds curves minimizing elastic energy pinned at endpoints.

problem Finding curves that minimize elastic energy with fixed endpoints.
method Applying the shooting method to identify and classify critical points.
result Critical points consist of wavelike elasticae, and minimizers have no loops or interior inflection points.

Gradient descent with preconditioning finds global optima in overparameterized nonconvex factorization.

problem Finding global optima in nonconvex Burer-Monteiro factorization.
method Preconditioned gradient descent for overparameterized nonconvex function minimization.
result Gradient descent with preconditioning achieves linear convergence in the overparameterized case.

Study on elastic curves pinned at the boundary, focusing on minimizers and their interaction with obstacles.

problem Minimizing elastic bending energy for open planar curves with obstacles.
method Investigation of global minimizers and explicit solutions for different values of the penalization parameter.
result Explicit threshold for λλ above which minimizers touch the obstacle, regardless of obstacle shape.

Learning new representations of input observations in machine learning is often tackled using a factorization of the data. For many such problems, including sparse coding and matrix completion, learning these factorizations can be difficult, in terms of efficiency and to guarantee that the solution is a global minimum.…

2016-04-17abs ↗pdf ↗

In this note, we study submanifold geometry of the Atiyah-Hitchin manifold, the double cover of the 22-monopole moduli space. When the manifold is naturally identified as the total space of a line bundle over S2S^2, the zero section is a distinguished minimal 22-sphere of considerable interest. In particular, there h…

2018-04-23abs ↗pdf ↗

We consider a Canham-Helfrich-type variational problem defined over closed surfaces enclosing a fixed volume and having fixed surface area. The problem models the shape of multiphase biomembranes. It consists of minimizing the sum of the Canham-Helfrich energy, in which the bending rigidities and spontaneous curvatures…

2012-04-30abs ↗pdf ↗

The paper proves the existence of area-minimizing hypersurfaces in AF manifolds of higher dimensions.

problem Existence of area-minimizing hypersurfaces in AF manifolds with arbitrary dimension and ends.
method Positive mass theorem for AF manifolds with arbitrary ends and global behavior for hypersurfaces in AF manifolds of dimension ≤ 8.
result Existence and behavior of area-minimizing hypersurfaces in AF manifolds of higher dimensions.

Gradient descent finds global optima in ResNets with sufficient parameters.

problem Finding optimal parameters in ResNet models.
method Mean-field analysis and gradient-flow PDE to study convergence of first-order optimization methods.
result First-order methods can find global minimizers in overparameterized ResNets.

Global minimizers exist for Tonelli Lagrangians on half-Lie groups.

problem Existence and properties of minimizers for Lagrangians on infinite-dimensional spaces.
method Introduced Tonelli Lagrangians on half-Lie groups, proved existence of minimizers and flow lines.
result Global minimizers exist above certain energy thresholds.

Geodesics in jet space are constructed from polynomials, with some yielding globally minimizing paths.

problem Characterize geodesics in jet space and identify those that are globally minimizing.
method Sub-Riemannian geometry, Hamilton-Jacobi equations, and analysis of period degenerations.
result Some polynomials yield globally minimizing geodesics, with conjectures on the independence of cut time.

Recurring international financial crises have adverse socioeconomic effects and demand novel regulatory instruments or strategies for risk management and market stabilization. However, the complex web of market interactions often impedes rational decisions that would absolutely minimize the risk. Here we show that, for…

2009-08-05abs ↗pdf ↗

We consider the problem of minimizing 0Lξ2+K2(s)ds\int_{0}^L \sqrt{ξ^2 +K^2(s)}\, ds for a planar curve having fixed initial and final positions and directions. The total length LL is free. Here ss is the variable of arclength parametrization, K(s)K(s) is the curvature of the curve and ξ>0ξ>0 a parameter. This problem comes from…

2012-03-14abs ↗pdf ↗

In relativity, the energy of a moving particle depends on the observer, and the rest mass is the minimal energy seen among all observers. The Wang-Yau quasi-local mass for a surface in spacetime introduced in [7] and [8] is defined by minimizing quasi-local energy associated with admissible isometric embeddings of the …

2013-02-21abs ↗pdf ↗

In this note, we focus on smooth nonconvex optimization problems that obey: (1) all local minimizers are also global; and (2) around any saddle point or local maximizer, the objective has a negative directional curvature. Concrete applications such as dictionary learning, generalized phase retrieval, and orthogonal ten…

2015-10-21abs ↗pdf ↗

New method finds global minima using function evaluations and kernel approximations.

problem Finding global minima of smooth functions with limited evaluations.
method Approximates the function using infinite sums of square smooth functions and solves the optimization problem with polynomial time complexity.
result Achieves optimal number of function evaluations with theoretical guarantees and nearly optimal convergence rate.