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

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for Convex Potentials

The paper studies mm-quasi Einstein manifolds with convex potential and finds constant scalar curvature.

problem Investigating mm-quasi Einstein manifolds with a convex potential function.
method Analyzing integral conditions and properties of the potential vector field.
result An mm-quasi Einstein manifold with a convex potential function has constant scalar curvature.

New convex domains in hyperbolic space can have lower fundamental gap than constant potentials.

problem Finding convex domains with lower fundamental gap than constant potentials.
method Constructing specific convex domains and potentials with controlled eigenfunctions.
result Fundamental gap of Δ+V-Δ+V can be strictly smaller than Δ for convex domains.

Study on pp-Laplace equation in convex cones, proving rigidity under specific conditions.

problem Overdetermined problem for pp-Laplace equation in convex cones.
method Established properties of capacitary potential, used PP-function, isoperimetric inequality, and Heintze-Karcher inequality.
result Rigidity result under orthogonal intersection assumption.

We prove the Fundamental Gap Conjecture, which states that the difference between the first two Dirichlet eigenvalues (the spectral gap) of a Schrödinger operator with convex potential and Dirichlet boundary data on a convex domain is bounded below by the spectral gap on an interval of the same diameter with zero poten…

2010-06-09abs ↗pdf ↗

Optimal maps, solutions to the optimal transportation problems, are completely determined by the corresponding c-convex potential functions. In this paper, we give simple sufficient conditions for a smooth function to be c-convex when the cost is given by minimizing a Lagrangian action.

2010-06-20abs ↗pdf ↗

Proposes a differentiable LSE-ICNN for modeling multi-well potentials.

problem Modeling multi-well potentials in various scientific domains.
method Log-sum-exponential (LSE) mixture of input convex neural network (ICNN) modes.
result Smooth surrogate that retains convexity within basins and allows gradient-based learning.

The paper solves a thermodynamics problem about crystal shape.

problem Understanding if minimizing free energy with convex potential and mass constraint generates a convex crystal.
method Utilized a stability theorem, convexity, and a new maximum principle approach to prove a three-dimensional convexity theorem.
result Completely settled the Almgren problem in R3\mathbb R^3 under generic conditions.

In this paper we consider the Ricci curvature of a Ricci soliton. In particular, we have showed that a complete gradient Ricci soliton with non-negative Ricci curvature possessing a non-constant convex potential function having finite weighted Dirichlet integral satisfying an integral condition is Ricci flat and also i…

2019-08-22abs ↗pdf ↗

Study of non-convex potential functions in deep learning with Poincaré inequality.

problem Understanding convergence of stochastic dynamics in non-convex potential landscapes.
method Introduced log-Polyak-Lojasiewicz (log-PL) measures and analyzed their convergence properties.
result Langevin dynamics converges at a rate of O~(1/ε)\tilde{\mathcal{O}}(1/ε) for sufficiently small εε.

LMC algorithm achieves efficient sampling from complex distributions with specific tail behaviors.

problem Sampling from distributions with specific tail behaviors and Hölder continuous gradients.
method Unadjusted Langevin Monte Carlo (LMC) algorithm with analysis of potential function tail growth and smoothness.
result LMC achieves efficient sampling with a rate independent of tail growth for linearly growing tails.

Alternative approach to generative modeling using convex conjugates and optimal transport.

problem Traditional generative modeling splits sampling and mapping; this work explores an alternative.
method Inspired by moment measures, proposes a new factorization and uses optimal transport for recovery.
result Intuitive results on factorized distributions, showing potential for practical tasks.

Geodesics on Kähler manifold potentials are paths of least action.

problem Understanding geodesics on the space of Kähler potentials.
method Study Lagrangians and geodesics on the Fréchet manifold of Kähler potentials, showing geodesics are paths of least action.
result Geodesics on the space of Kähler potentials are paths of least action, and conversely under suitable conditions.

We propose in this paper a general framework for deriving loss functions for structured prediction. In our framework, the user chooses a convex set including the output space and provides an oracle for projecting onto that set. Given that oracle, our framework automatically generates a corresponding convex and smooth l…

2019-10-24abs ↗pdf ↗

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 ↗

The paper proves optimal smoothness for certain Lagrangian graphs with specific Hölder continuity.

problem Optimal regularity for Hölder continuous Hamiltonian stationary Lagrangian graphs.
method Establishing smoothness conditions based on Hölder exponent and Lagrangian phase properties.
result Smoothness of graphs is achieved when Hölder exponent is strictly greater than 1/3 and Lagrangian phase is supercritical.

Paper proposes an algorithm for sampling from complex mixture distributions without requiring smoothness.

problem Sampling from a mixture of weakly smooth potentials.
method Unadjusted Langevin algorithm with Euler discretization for a mixture of weakly smooth distributions.
result Convergence in Kullback-Leibler divergence and LβL_β-Wasserstein metric with polynomial dependence on dimension.

Study on special Lagrangian curvature potential equation, proving existence and uniqueness of smooth solutions.

problem Second boundary value problem for special Lagrangian curvature potential equation.
method Method of continuity with a-priori estimate.
result Existence and uniqueness of smooth uniformly convex solutions.

We generalize the Riesz potential of a compact domain in Rm\mathbb{R}^{m} by introducing a renormalization of the rαmr^{α-m}-potential for α0α\le0. This can be considered as generalization of the dual mixed volumes of convex bodies as introduced by Lutwak. We then study the points where the extreme values of the (renorm…

2010-08-16abs ↗pdf ↗

We prove quantitative convergence rates at which discrete Langevin-like processes converge to the invariant distribution of a related stochastic differential equation. We study the setup where the additive noise can be non-Gaussian and state-dependent and the potential function can be non-convex. We show that the key p…

2019-07-07abs ↗pdf ↗

Market liquidity plays a vital role in the field of market micro-structure, because it is the vigor of the financial market. This paper uses a variable called convexity to measure the potential liquidity provided by order-book. Based on the high-frequency data of each stock included in the SSE (Shanghai Stock Exchange)…

2012-11-09abs ↗pdf ↗

Study convexity of Mabuchi functional in big cohomology classes.

problem Convexity of Mabuchi functional in big cohomology classes.
method Defined an invariant related to transcendental Fujita approximations and established convexity under vanishing of this invariant.
result Established almost convexity along weak geodesics in big cohomology classes.

Paper analyzes complexity of PSGLA for sampling log-concave distributions.

problem Sampling from log-concave distributions with composite potentials.
method Uses primal-dual interpretation and duality gap to analyze PSGLA complexity.
result Complexity of PSGLA is O(1/ε2)O(1/\varepsilon^2) for strongly convex potentials.

Convex dual network improves neural network reconstruction for medical imaging.

problem Non-convex nature of neural networks hinders their use in sensitive applications.
method Introduces a convex duality framework for a two-layer fully-convolutional ReLU denoising network.
result Training neural networks with weight decay regularization induces path sparsity and piecewise linear filtering.

The subdifferential of convex functions of the singular spectrum of real matrices has been widely studied in matrix analysis, optimization and automatic control theory. Convex analysis and optimization over spaces of tensors is now gaining much interest due to its potential applications to signal processing, statistics…

2015-06-08abs ↗pdf ↗

We consider the motion of a classical colored spinless particle under the influence of an external Yang-Mills potential AA on a compact manifold with boundary of dimension 3\geq 3. We show that under suitable convexity assumptions, we can recover the potential AA, up to gauge transformations, from the lens data of t…

2017-10-05abs ↗pdf ↗

We investigate centers of a body (the closure of a bounded open set) defined as maximum points of potentials. In particular, we study centers defined by the Riesz potential and by Poisson's integral. These centers, in general, depend on parameters and move with respect to the parameters. We give a necessary and suffici…

2016-03-28abs ↗pdf ↗

New algorithms improve sampling from complex distributions.

problem Sampling from high-dimensional target distributions with super-linearly growing potentials.
method Proposed aHOLA and aHOLLA algorithms with non-asymptotic convergence bounds.
result Achieved state-of-the-art rates of convergence in non-convex settings.