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

63127190253 · Jun 202019922001200920172026
48 results for weakly convex boundary

The study compares spectral volumes of manifolds with weakly convex boundaries.

problem Establishing volume comparison theorems for manifolds with weakly convex boundaries.
method Using spectral methods and Ricci tensor eigenvalues, the study compares volumes and diameters of manifolds.
result Sharp upper bounds for the volume and diameter of manifolds with weakly convex boundaries.

Let (M, g) be a compact Einstein manifold with non-empty boundary. We prove that Killing fields at the boundary extend to Killing fields of any (M, g) provided the boundary is weakly convex and a simple condition on the fundamental group holds. This gives a new proof of the classical infinitesimal rigidity of convex su…

2013-05-08abs ↗pdf ↗

In this paper, we establish a min-max theory for constructing minimal disks with free boundary in any closed Riemannian manifold. The main result is an effective version of the partial Morse theory for minimal disks with free boundary established by Fraser. Our theory also includes as a special case the min-max theory …

2018-06-12abs ↗pdf ↗

We study convex polyhedra in RP3\mathbb{R}\mathbb{P}^3 with all their vertices on a sphere. We do not require, in particular, that the polyhedra lie in the interior of the sphere, hence the term "weakly inscribed". Such polyhedra can be interpreted as ideal polyhedra, if we regard RP3\mathbb{R}\mathbb{P}^3 as a combinati…

2017-09-29abs ↗pdf ↗

Properties of two classes of generally convex sets in the n-dimentional real Euclidean space, called m-semiconvex and weakly m-semiconvex, 1<=m<n, are investigated in the present work. In particular, it is established that an open set with smooth boundary in the plan which is weakly 1-semiconvex but not 1-semiconvex co…

2017-11-13abs ↗pdf ↗

The study proves splitting theorems for manifolds with specific curvature and boundary conditions.

problem Proving splitting theorems for manifolds with specific curvature and boundary conditions.
method Warped product splitting theorem in manifolds with Ricci curvature bounded from below, requiring parabolic and convex boundary.
result Established splitting results for various manifolds with specific curvature and boundary conditions.

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.

Study inverse curvature flows for capillary hypersurfaces in a unit ball.

problem Understanding the behavior of capillary hypersurfaces under inverse curvature flows.
method Investigate inverse curvature flows for strictly convex, capillary hypersurfaces in the unit Euclidean ball.
result Establish existence and convergence results for inverse curvature flows.

Weakly convex polyhedra which are star-shaped with respect to one of their vertices are infinitesimally rigid. This is a partial answer to the question whether every decomposable weakly convex polyhedron is infinitesimally rigid. The proof uses a recent result of Izmestiev on the geometry of convex caps.

2007-04-22abs ↗pdf ↗

We derive local C2C^{2} estimates for complete non-compact translating solitons of the Gauss curvature flow in R3\mathbb{R}^3 which are graphs over a convex domain ΩΩ. This is closely is related to deriving local C1,1C^{1,1} estimates for the degenerate Monge-Ampére equation. As a result, given a weakly convex bounded d…

2016-10-23abs ↗pdf ↗

Convex surfaces derived from specific Riemannian manifolds with high regularity.

problem Proving convexity of surfaces derived from Riemannian manifolds.
method Analyzing solutions to the very weak Monge-Ampère equation.
result Proved convexity of weakly regular surfaces with nonnegative intrinsic curvature.

In this work we propose to fit a sparse logistic regression model by a weakly convex regularized nonconvex optimization problem. The idea is based on the finding that a weakly convex function as an approximation of the 0\ell_0 pseudo norm is able to better induce sparsity than the commonly used 1\ell_1 norm. For a cl…

2017-08-07abs ↗pdf ↗

New findings on domains without parabolic minimal submanifolds and weakly hyperbolic domains.

problem Characterizing domains without parabolic minimal submanifolds and weakly hyperbolic domains.
method Analyzing properties of domains and their boundaries, using tubular neighborhoods and conformal harmonic maps.
result Domains without parabolic minimal submanifolds and weakly hyperbolic domains have specific geometric properties.

Expanding FCCO to non-smooth weakly-convex problems, improving deep learning performance.

problem Addressing the limitations of current FCCO methods by tackling non-smooth weakly-convex problems.
method Developed a single-loop algorithm for non-smooth weakly-convex FCCO and extended it to tri-level problems.
result Established the complexity for finding ε-stationary points in the Moreau envelop of the objective function.

Neural network approximates weakly efficient frontier of convex vector optimization problems.

problem Approximating the weakly efficient frontier of convex vector optimization problems.
method Designing a neural network architecture to approximate the weakly efficient frontier of convex vector optimization problems (CVOP) satisfying Slater's condition.
result The proposed algorithm effectively approximates the true weakly efficient frontier of CVOPs, even for large problems.

Adaptive algorithm AMSGrad converges for weakly convex constrained optimization problems.

problem Solving constrained stochastic optimization problems with weakly convex objectives.
method Analysis of AMSGrad algorithm for a specific class of problems.
result AMSGrad achieves a convergence rate of ildeO(t1/4)\mathcal{ ilde O}(t^{-1/4}) for the norm of the gradient of the Moreau envelope.

This paper improves inverse problem solving with weakly convex regularisers and proves convergence.

problem Improving solution methods for inverse problems.
method Generalised formulation of convergent regularisation using weakly convex regularisers, and proof of convergence for primal-dual hybrid gradient method.
result Proves convergence of primal-dual hybrid gradient method for variational problems and shows improved performance with IWCNNs.

We generalize the following result of White: Suppose NN is a compact, strictly convex domain in $\RR^3$ with smooth boundary. Let ΣΣ be a compact 2-manifold with boundary. Then a generic smooth curve ΓΣΓ\cong \partialΣ in N\partial N bounds an odd or even number of embedded minimal surfaces diffeomorphic to ΣΣ acco…

2008-07-07abs ↗pdf ↗

New algorithm solves complex non-convex problems efficiently.

problem Non-smooth non-convex problems with weakly convex and strongly concave components.
method Stochastic Moreau envelope approximate gradient method (SMAG).
result First single-loop algorithm with state-of-the-art convergence rate.

New adaptive methods solve weakly convex stochastic optimization problems.

problem Solving weakly convex stochastic optimization problems.
method Adaptive first and zeroth-order methods using exponential moving averages.
result Established non-asymptotic convergence rates for nonsmooth and nonconvex problems.

The Bergman-Szegő kernel is analyzed for weakly pseudoconvex CR manifolds of finite type.

problem Analyzing the Bergman-Szegő kernel for specific CR manifolds.
method Constructing a parametrix for the Szegő kernel, extending earlier results.
result Extending Fefferman's boundary asymptotics to weakly pseudoconvex domains in \(\mathbb{C}^{2}\).

Paper tackles efficient learning of non-convex hypotheses in metric spaces.

problem Efficiently find consistent hypotheses for non-convex hypotheses composed of possibly several disconnected regions.
method Proposes a general domain-independent algorithm for finding consistent weakly convex hypotheses and proves sufficient conditions for its efficiency.
result Shows that consistent hypothesis finding problem can be solved in polynomial time for a broad class of weakly convex hypotheses over metric spaces.

The paper proves a Schwarz lemma for weakly Kähler-Finsler manifolds.

problem Estimating distance functions and proving Schwarz lemma for weakly Kähler-Finsler manifolds.
method Establishing theorems about distance functions and applying them to prove the Schwarz lemma.
result Holomorphic mappings from weakly Kähler-Finsler manifolds to pseudoconvex Finsler manifolds are constant under certain conditions.

We establish the regularity theory for certain critical elliptic systems with an anti-symmetric structure under inhomogeneous Neumann and Dirichlet boundary constraints. As applications, we prove full regularity and smooth estimates at the free boundary for weakly Dirac-harmonic maps from spin Riemann surfaces. Our met…

2013-06-18abs ↗pdf ↗

Study finds topological restrictions for stable free boundary CMC surfaces in negatively curved settings.

problem Understanding topological constraints for stable free boundary CMC surfaces in negatively curved settings.
method Established intrinsic area-length-topology inequalities via a conformal upper bound for a constrained first Robin eigenvalue of the Jacobi operator.
result Explicit topological restrictions for stable free boundary CMC surfaces, showing low genus and few boundary components.

Study on polyhedra rigidity, finding non-existence of flexible weakly convex decomposable polyhedra.

problem Proving all decomposable polyhedra with vertices in convex position are infinitesimally rigid.
method Constructing explicit families of polyhedra, using the Hessian of the discrete Hilbert-Einstein functional, and searching for eigenvalues of the Hessian with Mathematica.
result Experimental evidence suggests no flexible, weakly convex and decomposable polyhedra exist.

New single-loop algorithm tackles weakly convex constraints in stochastic optimization.

problem Optimization with weakly convex constraints in machine learning.
method Single-loop penalty-based stochastic algorithm using hinge-based penalty.
result Achieves state-of-the-art complexity for finding approximate KKT solutions.

We introduce a geometrically transparent strict saddle property for nonsmooth functions. This property guarantees that simple proximal algorithms on weakly convex problems converge only to local minimizers, when randomly initialized. We argue that the strict saddle property may be a realistic assumption in applications…

2019-12-16abs ↗pdf ↗

The study finds conditions for free boundary Hamiltonian stationary discs in complex 2-space.

problem Conditions for free boundary Hamiltonian stationary Lagrangian discs in complex 2-space.
method Established conditions for weakly conformal, branched ΩΩ-free boundary Hamiltonian stationary Lagrangian immersions of discs.
result If conditions are met, a disc is a free boundary minimal immersion.

Develops a new SPP algorithm with variance reduction for weakly convex optimization.

problem Weakly convex, composite optimization problems.
method Inexact semismooth Newton framework with variance reduction for stochastic proximal point updates.
result Establishes convergence results for the proposed algorithm.

We prove the following comparison theorem for metrics with nonnegative scalar curvature, also known as the dihedral rigidity conjecture by Gromov: for n7n\le 7, if an nn-dimensional prism has nonnegative scalar curvature and weakly mean convex faces, then its dihedral angle cannot be everywhere not larger than its Euc…

2019-07-08abs ↗pdf ↗

In [2], the authors develop a global correspondence between immersed weakly horospherically convex hypersurfaces φ:MnHn+1φ:M^n \to \mathbb{H}^{n+1} and a class of conformal metrics on domains of the round sphere Sn\mathbb{S}^n. Some of the key aspects of the correspondence and its consequences have dimensional restrictions $…

2016-11-19abs ↗pdf ↗

We study Kahler manifolds-with-boundary, not necessarily compact, with weakly pseudoconvex boundary, each component of which is compact. If such a manifold KK has l2l\ge2 boundary components (possibly l=l=\infty), then it has first betti number at least l1l-1, and the Levi form of any boundary component is zero. If $K…

2011-10-20abs ↗pdf ↗

Paper extends SMM to weakly convex and multi-convex surrogates for non-convex optimization.

problem Non-convex optimization with weakly convex or multi-convex surrogates.
method Stochastic majorization-minimization with proximal regularization or block-minimization.
result Convergence rates for empirical and expected losses under non-i.i.d. data.