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

93186278371 · Jun 202019922001200920172026
48 results for local convexity

Flow deforms locally convex curves to curves of constant k-order width.

problem Evolve locally convex curves to curves of constant k-order width.
method Introduced a nonlocal curvature flow to evolve locally convex curves in the plane.
result The flow converges to a smooth, locally convex curve of constant k-order width as time goes to infinity.

Recently, based on the idea of randomizing space theory, random convex analysis has been being developed in order to deal with the corresponding problems in random environments such as analysis of conditional convex risk measures and the related variational problems and optimization problems. Random convex analysis is …

2016-03-23abs ↗pdf ↗

Local rigidity proved for convex hypersurfaces in spaces of constant curvature.

problem Proving rigidity of convex hypersurfaces in spaces of constant curvature.
method Analyzing isometric convex hypersurfaces in spaces of constant curvature of dimension n4n\ge4.
result Two convex isometric hypersurfaces are congruent locally around their corresponding under strict convexity isometries.

Developed a theory of local convexity for second order differential equations on Lie algebroids.

problem Analyzing convexity in differential equations on Lie algebroids.
method Theory development for local convexity of SODEs on Lie algebroids.
result Extensive discussion of homogeneous quadratic SODEs on Lie algebroids.

Study on diffeologies on locally convex spaces and smooth multiplication of distributions.

problem Geometric characterization and smoothness of distribution multiplication.
method Investigation of canonical and cc^\infty-diffeologies on locally convex spaces, proving geometric characterizations, and comparing diffeologies.
result Established a framework for nonlinear distribution theory beyond manifolds, realizing microlocally multipliable distributions as a diffeological colimit.

Local minimizers are convex and close to Wulff shapes.

problem Finding local minimizers in anisotropic isoperimetric problems.
method Showed local minimizers are geodesically convex and small smooth perturbations of tangent Wulff shapes.
result Local minimizers are quantitatively close to Wulff shapes.

Study first-order locally convex Lie algebroids in Bastiani calculus.

problem Define and study first-order locally convex Lie algebroids.
method Define sheaves of Lie algebroid forms and morphisms, prove category structure, study representations and cohomology.
result First-order locally convex Lie algebroids form a category and have applications in Lie II theorems.

We introduce a new family of affine metrics on a locally strictly convex surface MM in affine 4-space. Then, we define the symmetric and antisymmetric equiaffine planes associated with each metric. We show that if MM is immersed in a locally strictly convex hyperquadric, then the symmetric and the antisymmetric plane…

2014-04-09abs ↗pdf ↗

Study finds a non-locally contractible rr-convex set.

problem Find an rr-convex set which is not locally contractible.
method Constructs a counterexample of a non-locally contractible rr-convex set.
result Proves that the class of supports with positive reach of absolutely continuous distributions includes strictly the class of rr-convex supports.

Paper develops a new local convexity condition for non-isolated minima in non-convex optimization.

problem Lack of theory for non-isolated minima in non-convex optimization.
method Formulates a new local convexity condition and studies SGD convergence under this condition.
result Shows SGD can converge locally under the new condition.

We prove that the torsion of any closed space curve which bounds a simply connected locally convex surface vanishes at least 4 times. This answers a question of Rosenberg related to a problem of Yau on characterizing the boundary of positively curved disks in Euclidean space. Furthermore, our result generalizes the 4 v…

2015-01-29abs ↗pdf ↗

The study explores convex unions and completions in simplicial pseudomanifolds, revealing unexpected behavior.

problem Understanding the behavior of convex unions in simplicial pseudomanifolds.
method Generalization to simplicial pseudomanifolds, considering PL homeomorphisms and edge subdivisions.
result Unexpected behavior in convex unions and completions, including empty contraction spaces and large/small contraction spaces.

The paper analyzes phase retrieval under limited samples, ensuring a benign local landscape for convergence.

problem Ensuring a benign local landscape for phase retrieval under limited samples.
method Fine-grained analysis of local landscape properties under the regime of limited samples.
result Gradient descent can converge to an od(1)o_d(1)-loss solution exponentially fast under certain conditions.

Improved Local SGD convergence for general convex objectives with bounded second-order heterogeneity.

problem Understanding when and why Local SGD outperforms alternatives in distributed optimization.
method Established improved convergence guarantees for Local SGD on general convex objectives under bounded second-order heterogeneity.
result Upper bounds for Local SGD are nearly tight, providing a sharper convergence theory.

In this paper we provide a characterization for a class of convex curves on the 3-sphere. More precisely, using a theorem that decomposes a locally convex curve on the 3-sphere as a pair of curves on the 2-sphere, one of which is locally convex and the other is an immersion, we are capable of completely characterize a …

2020-02-10abs ↗pdf ↗

Convergence to a saddle point for convex-concave functions has been studied for decades, while recent years has seen a surge of interest in non-convex (zero-sum) smooth games, motivated by their recent wide applications. It remains an intriguing research challenge how local optimal points are defined and which algorith…

2020-02-27abs ↗pdf ↗

Local invertibility of ray transforms on convex manifolds.

problem Invertibility of ray transforms on compact Riemannian manifolds with strictly convex boundary.
method Local invertibility results for transverse and mixed ray transforms of 1 and 1+1 tensors.
result Local invertibility of ray transforms near boundary points, leading to global results.

Local invertibility of higher order tensor transforms on compact manifolds.

problem Invertibility of higher order tensor transforms on compact manifolds.
method Local invertibility of transverse and mixed ray transforms of tensors on compact Riemannian manifolds.
result Local invertibility of transverse and mixed ray transforms of tensors for specific dimensions.

SGD converges with positive probability for non-convex deep neural networks under specific conditions.

problem Convergence of SGD for non-convex deep neural networks.
method Established local convergence with positive probability under local Łojasiewicz condition and additional structural assumption.
result SGD converges with positive probability for non-convex deep neural networks under specific conditions.

We study diffeologies on locally convex spaces and their application to smooth multiplication of distributions.

problem Constructing smooth multiplication of distributions on locally convex spaces.
method Using diffeological colimits and wavefront-set criterion.
result Proving smooth multiplication of microlocally multipliable distributions.

Locally adaptive federated learning improves convergence in distributed machine learning.

problem Balancing local updates in federated learning leads to slow convergence.
method Locally adaptive federated learning algorithms that use uncoordinated stepsizes based on local geometric information.
result Locally adaptive methods can be particularly efficient in overparameterized settings and outperform standard federated algorithms.

We show that an infinite dimensional Lie group in Milnor's sense has the strong Trotter property if it is locally μμ-convex. This is a continuity condition imposed on the Lie group multiplication that generalizes the triangle inequality for locally convex vector spaces, and is equivalent to C0C^0-continuity of the evo…

2018-02-24abs ↗pdf ↗

We study the critical points of the renormalized volume for acylindrical geometrically finite hyperbolic 3-manifolds that include rank-1 cusps, and show that the renormalized volume is locally convex around these critical points. We give a modified definition of the renormalized volume that is additive under gluing, an…

2015-05-03abs ↗pdf ↗

New methods for convex optimization with locally Lipschitz gradient, achieving faster convergence.

problem Optimization problems with locally Lipschitz continuous gradient.
method Accelerated proximal gradient (APG) methods and proximal augmented Lagrangian method.
result Achieved faster convergence rates for convex optimization problems with locally Lipschitz gradient.

ProxSkip achieves linear speedup in distributed non-convex optimization.

problem Achieving linear speedup in distributed non-convex optimization.
method Unified convergence analysis for stochastic non-convex, convex, and strongly convex problems.
result ProxSkip achieves linear speedup in the number of nodes under stochastic gradients.

Almost all local minima in neural networks are strongly convex.

problem The prevalence of strongly convex neighborhoods around local minima in neural network optimization landscapes.
method Rigorous analysis of shallow neural networks with analytic activation functions, dividing parameter space into efficient and redundant domains.
result For shallow neural networks on the efficient domain, almost all local minima are strongly convex.