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

Trend · papers per month

3326639951,326 · Jun 202019922001200920172026
48 results for minimizing method

Construct minimal Lagrangian surfaces in complex projective plane via loop group method.

problem Construct minimal Lagrangian immersions from arbitrary Riemann surfaces into complex projective plane.
method Loop group method, perturbed equivariant minimal Lagrangian surfaces, Delaunay cylinders approximation.
result Construct a class of minimal Lagrangian cylinders approximating Delaunay cylinders.

The paper evaluates biased methods for alpha-divergence minimization.

problem The impact of bias on solutions found for alpha-divergence minimization.
method Empirical evaluation of biased methods for alpha-divergence minimization, focusing on bias effects and dimensionality.
result Solutions are biased towards KL-divergence minimizers and require impractical computation in high dimensions to minimize alpha-divergence.

An interesting problem in classical differential geometry is to find methods to prove that two surfaces defined by different charts actually coincide up to position in space. In a previous paper we proposed a method in this direction for minimal surfaces. Here we explain not only how this method works but also how we c…

2014-12-05abs ↗pdf ↗

New method proves rigidity of minimal hypersurfaces in curved 4-manifolds.

problem Proving rigidity of minimal hypersurfaces in curved 4-manifolds.
method Combining nonnegative 2-intermediate Ricci curvature and strict positivity of scalar curvature, extending Chodosh-Li-Stryker method.
result Rigidity of two-sided free boundary stable minimal hypersurfaces in 4-manifolds with bounded geometry and weakly convex boundary.

Unstable minimal surfaces are the unstable stationary points of the Dirichlet-Integral. In order to obtain unstable solutions, the method of the gradient flow together with the minimax-principle is generally used. The application of this method for minimal surfaces in the Euclidean spacce was presented in \cite{s3}. We…

2006-03-27abs ↗pdf ↗

TSSM splits neural networks for parallel training with minimal accuracy loss.

problem Accuracy degradation in parallel training of deep neural networks.
method TSSM reformulates alternating minimization to achieve parallelism with minimal accuracy loss.
result TSSM achieves significant speedup without accuracy loss on multiple datasets.

The paper studies minimal submanifolds with specific curvature properties in Euclidean space.

problem Minimal submanifolds with (n2)(n-2)-umbilical properties in Euclidean space.
method Established a correspondence and developed a Weierstrass type method for local parametrization.
result Minimal, generic, (n2)(n-2)-umbilic submanifolds are (n2)(n-2)-rotational and have a parametric description.

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.

We give a new method for manufacturing complete minimal submanifolds of compact Lie groups and their homogeneous quotient spaces. For this we make use of harmonic morphisms and basic representation theory of Lie groups. We then apply our method to construct many examples of compact minimal submanifolds of the special u…

2013-08-22abs ↗pdf ↗

In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first establish that a class of special rank minimization problems has closed-form solutions. Using this result, we then propose penalty decomposition methods for general rank minimization pro…

2010-08-31abs ↗pdf ↗

We generalize Newton-type methods for minimizing smooth functions to handle a sum of two convex functions: a smooth function and a nonsmooth function with a simple proximal mapping. We show that the resulting proximal Newton-type methods inherit the desirable convergence behavior of Newton-type methods for minimizing s…

2012-06-07abs ↗pdf ↗

We develop Teichmuller theoretical methods to construct new minimal surfaces in $\BE^3$ by adding handles and planar ends to existing minimal surfaces in $\BE^3$. We exhibit this method on an interesting class of minimal surfaces which are likely to be embedded, and have a low degree Gaußmap for their genus; the (Weier…

1998-06-17abs ↗pdf ↗

This study explains how different training methods affect the minimizer of neural networks.

problem How training methods influence the minimizer of neural networks.
method Explains how initialization size, adaptive optimization (AdaGrad), and stochastic mini-batch training affect the minimizer.
result Different training methods lead to different minimizers, even in overparameterized networks.

In this paper, we study closed embedded minimal hypersurfaces in a Riemannian (n+1)(n+1)-manifold (2n62\le n\le 6) that minimize area among such hypersurfaces. We show they exist and arise either by minimization techniques or by min-max methods: they have index at most 11. We apply this to obtain a lower area bound for su…

2015-03-10abs ↗pdf ↗

Minimal Lagrangian surfaces in complex hyperbolic quadric via loop group method.

problem Characterizing and constructing minimal Lagrangian surfaces in complex hyperbolic quadric.
method Loop of flat connections, isometric deformations, DPW-type representation.
result Explicit examples of minimal Lagrangian surfaces, including catenoid-type examples.

New minimal surface doublings of Clifford Torus improve bounds on minimal surfaces in S^3.

problem Proving bounds on minimal surfaces in S^3 with fixed genus.
method Applying a general theorem to produce new minimal doublings of the Clifford Torus, using min-max methods, and verifying Yau's conjecture.
result Improved quadratic lower bound for the number of embedded minimal surfaces in S^3 with prescribed genus.

We describe a method for generating minimal hard prime surface-link diagrams. We extend the known examples of minimal hard prime classical unknot and unlink diagrams up to three components and generate figures of all minimal hard prime surface-unknot and surface-unlink diagrams with prime base surface components up to …

2017-06-28abs ↗pdf ↗

Minimizing a function over an intersection of convex sets is an important task in optimization that is often much more challenging than minimizing it over each individual constraint set. While traditional methods such as Frank-Wolfe (FW) or proximal gradient descent assume access to a linear or quadratic oracle on the …

2018-04-09abs ↗pdf ↗

Hyperplanes, hyperspheres and hypercylinders in Rn\Bbb R^n with suitable densities are proved to be weighted minimizing by a calibration argument. Also calibration method is used to prove a weighted minimal hypersurface is weighted area-minimizing locally.

2010-04-06abs ↗pdf ↗

The paper proves existence of minimal homotopies for immersed planar curves.

problem Existence of area-minimizing homotopies between homotopic curves in the plane.
method Geometric and variational approach, lifting curves into higher co-dimension, applying Douglas's solution of the Plateau problem.
result Uniform convergence of Douglas minimizers and minimal homotopy area minimization.

The study finds a way to create minimal surfaces with specific shapes in 3-manifolds.

problem Creating minimal surfaces with prescribed genus in 3-manifolds with positive Ricci curvature.
method Develops a min-max theory and shows deformability of surfaces in a generic metric.
result Establishes a theorem for producing minimal surfaces with prescribed genus.

The study bounds the topology of free boundary minimal surfaces in 3D manifolds.

problem Understanding the topology of free boundary minimal surfaces in compact 3D manifolds.
method Establishing general bounds on the topology via min-max methods and analyzing varifolds.
result The first Betti number is lower semicontinuous in the limit of min-max sequences.

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.