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

2885768631,151 · Jun 202019922001200920172026
48 results for Minimizing Variational Problem

Study optimizes perimeter in convex domains with anisotropic constraints.

problem Optimizing perimeter in convex domains with anisotropic constraints.
method Analytical properties, topological features, and geometric measure theory results.
result Sharp isoperimetric inequalities and existence of minimizers.

The paper finds local minimizers for obstacle avoidance on curved spaces.

problem Finding optimal paths on curved spaces avoiding obstacles.
method Minimizing an action functional with bi-Jacobi fields and biconjugate points.
result Local minimizers are classified into two categories with local uniqueness results.

Minimal submanifolds are found as energy concentration sets in variational problems.

problem Understanding the structure of minimal submanifolds in codimension two.
method Purely variational approach, extending previous work on geodesics.
result Non-degenerate minimal submanifolds can be derived from critical maps of the Ginzburg-Landau functional.

The paper compares unrolling and bilevel optimization for learning variational models.

problem Learning variational models in supervised learning.
method Analyzes unrolling and bilevel optimization approaches for variational models.
result Unrolling can be better than bilevel optimization, but performance depends on parameters.

This paper learns variational models and solvers for inverse problems from incomplete data.

problem Solving inverse problems with partially observed data.
method Joint learning of variational cost and gradient-based solver as neural networks.
result Joint learning leads to improved reconstruction performance.

We introduce the Variational Holder (VH) bound as an alternative to Variational Bayes (VB) for approximate Bayesian inference. Unlike VB which typically involves maximization of a non-convex lower bound with respect to the variational parameters, the VH bound involves minimization of a convex upper bound to the intract…

2015-06-19abs ↗pdf ↗

Aggregates probability models using Wasserstein space and variational approach.

problem Model aggregation in the Wasserstein space of distributions.
method Data-driven calibration framework based on ΓΓ-convergence.
result Empirical minimizers converge to the minimizers of the actual problem.

This paper combines three techniques to reduce communications in distributed variational inequalities.

problem Efficiently communicating solutions in large-scale distributed variational inequalities.
method Combining similarity, compression, and local steps to reduce communication rounds and cost.
result Best theoretical guarantees of communication complexity and superior performance in adversarial learning experiments.

Unified analysis of efficient local training methods for distributed variational inequalities.

problem Efficient distributed/federated learning for variational inequality problems.
method Unified convergence analysis of communication-efficient local training methods.
result First local gradient descent-accent algorithms with improved communication complexity.

Elvet solves differential equations and variational problems with neural networks.

problem Solving complex differential and variational equations with arbitrary conditions.
method Machine learning, specifically neural networks, to represent and solve equations.
result Elvet can solve a wide range of differential and variational problems.

Study minimizes CR surfaces in Heisenberg group with rotational symmetry.

problem Minimizing CR surfaces with vanishing CR invariant energy E1E_1 in Heisenberg group.
method Proved local uniqueness, classified global surfaces with rotational symmetry, computed second variation.
result Clifford torus is not a local minimizer of E1E_1.

The paper simplifies conditions for optimal paths on manifolds avoiding obstacles.

problem Finding optimal paths on manifolds avoiding obstacles.
method Study of sufficient conditions for optimality on Riemannian manifolds and Lie groups.
result New conditions for optimality are provided in terms of matrix invertibility.

From minimal surfaces such as Simons' cone and catenoids, using refined Lyapunov-Schmidt reduction method, we construct new solutions for a free boundary problem whose free boundary has two components. In dimension 88, using variational arguments, we also obtain solutions which are global minimizers of the correspondi…

2017-04-25abs ↗pdf ↗

Inspired by the seminal work on Stein Variational Inference and Stein Variational Policy Gradient, we derived a method to generate samples from the posterior variational parameter distribution by \textit{explicitly} minimizing the KL divergence to match the target distribution in an amortize fashion. Consequently, we a…

2018-02-21abs ↗pdf ↗

We revisit the question of existence and regularity of minimizers to weighted least gradient problems on a fixed bounded domain, subject to a Dirichlet boundary condition, in the case where the boundary data is continuous and the weight function is C^2 and bounded away from zero. Under suitable geometric conditions on …

2017-09-01abs ↗pdf ↗

This paper deals with continuity preservation when minimizing generalized total variation with a L2L^2 fidelity term or a Dirichlet boundary condition. We extend several recent results in the two cases, mainly by showing comparison principles for the prescribed mean curvature problem satisfied by the level-sets of such…

2016-05-31abs ↗pdf ↗

Characterizing the phase transitions of convex optimizations in recovering structured signals or data is of central importance in compressed sensing, machine learning and statistics. The phase transitions of many convex optimization signal recovery methods such as 1\ell_1 minimization and nuclear norm minimization are…

2015-09-15abs ↗pdf ↗

In this paper, we establish the first variational formula and its Euler-Lagrange equation for the total 2p2p-th mean curvature functional M2p\mathcal {M}_{2p} of a submanifold MnM^n in a general Riemannian manifold Nn+mN^{n+m} for p=0,1,...,[n2]p=0,1,...,[\frac{n}{2}]. As an example, we prove that closed complex submanifolds in compl…

2011-11-11abs ↗pdf ↗

New algorithms reduce variance in solving complex mathematical problems.

problem Solving convex-concave saddle point problems, variational inequalities, and inclusions.
method Stochastic variance reduction for extragradient, forward-backward-forward, and forward-reflected-backward methods.
result All proposed methods converge with complexities matching or improving deterministic counterparts.

We discuss intrinsic aspects of Krupka's approach to finite-order variational sequences. We give intrinsic isomorphisms of the quotient subsheaves of the short finite-order variational sequence with sheaves of forms on jet spaces of suitable order, obtaining a new finite-order (short exact) variational sequence which i…

2000-01-05abs ↗pdf ↗

Minimal surfaces are among the most natural objects in Differential Geometry, and have been studied for the past 250 years ever since the pioneering work of Lagrange. The subject is characterized by a profound beauty, but perhaps even more remarkably, minimal surfaces (or minimal submanifolds) have encountered striking…

2014-09-26abs ↗pdf ↗

Variational problems that involve Wasserstein distances have been recently proposed to summarize and learn from probability measures. Despite being conceptually simple, such problems are computationally challenging because they involve minimizing over quantities (Wasserstein distances) that are themselves hard to compu…

2015-03-09abs ↗pdf ↗

We investigate the minimal and isoperimetric surface problems in a large class of sub-Riemannian manifolds, the so-called Vertically Rigid spaces. We construct an adapted connection for such spaces and, using the variational tools of Bryant, Griffiths and Grossman, derive succinct forms of the Euler-Lagrange equations …

2005-08-17abs ↗pdf ↗

Optimal pre-processing reduces disparate impact by minimizing total variation distance.

problem Achieving fairness in data outputs based on protected attributes.
method Using pre-processing to enforce fairness, minimizing total variation distance between pre-processed and original data distributions.
result The problem of fairness can be formulated as a linear program, efficiently solvable.

Study on geometric variational problems for existence, regularity, and uniqueness of solutions.

problem Geometric variational problems, focusing on existence, regularity, and uniqueness of solutions.
method Formulated in Federer and Fleming's theory of currents, discussed the existence theory, and presented core ideas of the (interior) regularity theory for area-minimizing currents and optimal transport paths. Two original results on generic uniqueness of solutions were presented.
result Generic uniqueness of solutions for both Plateau's problem and optimal branched transport problem.

We propose a family of variational approximations to Bayesian posterior distributions, called αα-VB, with provable statistical guarantees. The standard variational approximation is a special case of αα-VB with α=1α=1. When α(0,1]α\in(0,1], a novel class of variational inequalities are developed for linking the Bayes risk …

2017-10-09abs ↗pdf ↗

This paper introduces a geometrically constrained variational problem for the area functional. We consider the area restricted to the langrangian surfaces of a Kaehler surface, or, more generally, a symplectic 4-manifold with suitable metric, and study its critical points and in particular its minimizers. We apply this…

2000-08-28abs ↗pdf ↗

In this paper, we study a second order variational problem for locally convex hypersurfaces, which is the affine invariant analogue of the classical Plateau problem for minimal surfaces. We prove existence, regularity and uniqueness results for hypersurfaces maximizing affine area under appropriate boundary conditions.

2004-05-28abs ↗pdf ↗

New optimal surfaces found in Heisenberg group defy Euclidean sphere optimality.

problem Optimizing mean curvature in Heisenberg group sub-Riemannian setting.
method Developed variational theory, established first and second variation formulas, introduced new critical surfaces.
result Identified and characterized a new family of rotationally invariant critical surfaces, the Pansu-Minkowski spheres.

Proves SYZ conjecture for certain toric Fano hypersurfaces.

problem Proving the metric SYZ conjecture for specific Calabi-Yau hypersurfaces.
method Solving a variational problem related to the real Monge-Ampère equation on polytopes.
result Minimizer of the variational problem interpreted as a global solution to the real Monge-Ampère equation.

This paper shows how to learn variational inequalities fast with strong monotonicity.

problem Learning variational inequalities efficiently.
method Extending convex optimization techniques to variational inequalities with strong monotonicity.
result Fast generalization rates of Θ(1/ε)Θ(1/ε) for learning variational inequalities.

We consider the problem of approximate Bayesian inference in log-supermodular models. These models encompass regular pairwise MRFs with binary variables, but allow to capture high-order interactions, which are intractable for existing approximate inference techniques such as belief propagation, mean field, and variants…

2015-02-23abs ↗pdf ↗