arXiv research

We propose a sample efficient stochastic variance-reduced cubic regularization (Lite-SVRC) algorithm for finding the local minimum efficiently in nonconvex optimization. The proposed algorithm achieves a lower sample complexity of Hessian matrix computation than existing cubic regularization based methods. At the heart…

A new method for faster optimization in high dimensions.

Two new algorithms improve reinforcement learning by avoiding saddle points.

We consider the minimization of non-convex functions that typically arise in machine learning. Specifically, we focus our attention on a variant of trust region methods known as cubic regularization. This approach is particularly attractive because it escapes strict saddle points and it provides stronger convergence gu…

Stochastic Variance-Reduced Cubic regularization (SVRC) algorithms have received increasing attention due to its improved gradient/Hessian complexities (i.e., number of queries to stochastic gradient/Hessian oracles) to find local minima for nonconvex finite-sum optimization. However, it is unclear whether existing SVR…

A new quasi-Newton method uses cubic regularization to avoid saddle points in deep learning.

New method solves optimization problems faster than existing methods.

Trust region and cubic regularization methods have demonstrated good performance in small scale non-convex optimization, showing the ability to escape from saddle points. Each iteration of these methods involves computation of gradient, Hessian and function value in order to obtain the search direction and adjust the r…

Momentum is a popular technique to accelerate the convergence in practical training, and its impact on convergence guarantee has been well-studied for first-order algorithms. However, such a successful acceleration technique has not yet been proposed for second-order algorithms in nonconvex optimization.In this paper, …

This paper proposes a stochastic variant of a classic algorithm---the cubic-regularized Newton method [Nesterov and Polyak 2006]. The proposed algorithm efficiently escapes saddle points and finds approximate local minima for general smooth, nonconvex functions in only $\mathcal{\tilde{O}}(ε^{-3.5})$ stochastic gradien…

Cubic regularization (CR) is an optimization method with emerging popularity due to its capability to escape saddle points and converge to second-order stationary solutions for nonconvex optimization. However, CR encounters a high sample complexity issue for finite-sum problems with a large data size. %Various inexact …

Study finds the spectrum of a cubic Dirac operator on specific oscillator group manifolds.

Research extends geodesic length function study to three holed sphere.

A new distributed method for convex optimization over networks with fast convergence.

For a $n$-dimensional spin manifold $M$ with a fixed spin structure and a spinor bundle $ΣM$, we prove an $ε$-regularity theorem for weak solutions to the nonlinear Dirac equation of cubic nonlinearity. This, in particular, answers a regularity question raised by Chen-Jost-Wang when $n=2$.

Study curvature loci of 3-manifolds in R^6 and R^5.

Each of the four critical Severi varieties arises from a minimal holomorphic nilpotent orbit in a simple regular rank 3 hermitian Lie algebra and each such variety lies as singular locus in a cubic--the chordal variety--in the corresponding complex projective space; the cubic and projective space are identified in term…

Heavy Ball method speeds up finding global optima in non-convex problems.

Paper shows faster convergence to local-minimizers in over-parametrized models under interpolation-like conditions.

We consider non-degenerate graph immersions into affine space $\mathbb A^{n+1}$ whose cubic form is parallel with respect to the Levi-Civita connection of the affine metric. There exists a correspondence between such graph immersions and pairs $(J,γ)$, where $J$ is an $n$-dimensional real Jordan algebra and $γ$ is a no…

We consider variants of trust-region and cubic regularization methods for non-convex optimization, in which the Hessian matrix is approximated. Under mild conditions on the inexact Hessian, and using approximate solution of the corresponding sub-problems, we provide iteration complexity to achieve $ε$-approximate seco…

Let S be a closed oriented surface of genus at least two. Labourie and the author have independently used the theory of hyperbolic affine spheres to find a natural correspondence between convex RP^2 structures on S and pairs (Σ,U) consisting of a conformal structure Σon S and a holomorphic cubic differential U over Σ. …

Cubic-regularized Newton's method (CR) is a popular algorithm that guarantees to produce a second-order stationary solution for solving nonconvex optimization problems. However, existing understandings of the convergence rate of CR are conditioned on special types of geometrical properties of the objective function. In…

The contact graph of a CAT(0) cubical complex has unbounded structure and a Gaussian CLT for random walks.

A new algorithm solves minimax problems without needing parameters.

{\em Riemannian cubics} are curves in a manifold $M$ that satisfy a variational condition appropriate for interpolation problems. When $M$ is the rotation group SO(3), Riemannian cubics are track-summands of {\em Riemannian cubic splines}, used for motion planning of rigid bodies. Partial integrability results are know…

Brooks and Makover introduced an approach to random Riemann surfaces based on associating a dense set of them - Belyi surfaces - with random cubic graphs. In this paper, using Bollobas model for random regular graphs, we examine the topological structure of these surfaces, obtaining in particular an estimate for the ex…

The paper connects Apollonian packings to knot theory and improves link representations.

Sub-Riemannian cubics are a generalisation of Riemannian cubics to a sub-Riemannian manifold. Cubics are curves which minimise the integral of the norm squared of the covariant acceleration. Sub-Riemannian cubics are cubics which are restricted to move in a horizontal subspace of the tangent space. When the sub-Riemann…

We study hyperbolic polyhedral surfaces with faces isometric to regular hyperbolic polygons satisfying that the total angles at vertices are at least $2π.$ The combinatorial information of these surfaces is shown to be identified with that of Euclidean polyhedral surfaces with negative combinatorial curvature everywher…

The cubic lattice stick index of a knot type is the least number of sticks necessary to construct the knot type in the 3-dimensional cubic lattice. We present the cubic lattice stick index of various knots and links, including all (p,p+1)-torus knots, and show how composing and taking satellites can be used to obtain t…

This paper refines homotopy theory for cubical sets and uniform spaces.

An embedded cubic graph consisting of segments of geodesics such that the angles at any vertex are equal to $2π/3$ is a closed local minimal net. This net is regular if all segments of geodesics are equal. The problem of classification of closed local minimal nets on surfaces of constant negative curvature has been for…

According to our previous results, the conjugacy class of the involution induced by the complex conjugation in the homology of a real non-singular cubic fourfold determines the fourfold up to projective equivalence and deformation. Here, we show how to eliminate the projective equivalence and to obtain a pure deformati…

The paper studies conformally flat cubic metrics with isotropic curvature, finding they must be Minkowski.

Cubic fourfolds have K-stability and admit Kähler-Einstein metrics.

The study shows that certain cubical presentations lead to aspherical spaces.

State-of-the-art methods in convex and non-convex optimization employ higher-order derivative information, either implicitly or explicitly. We explore the limitations of higher-order optimization and prove that even for convex optimization, a polynomial dependence on the approximation guarantee and higher-order smoothn…

New cubic forms linked to η-invariants and mod 2 indices.

It is shown that there exist non-singular cubic surfaces in CP^3 containing 5 twistor lines. This is the maximum number of twistor fibres that a non-singular cubic can contain. Cubic surfaces in CP^3 with 5 twistor lines are classified up to transformations preserving the conformal structure of S^4.

We study global log canonical thresholds of cubic surfaces with canonical singularities, and we prove the existence of a Kahler-Einstein metric on two singular cubic surfaces.

Solves infinite family of cubic polynomial problems.

Consider the family of smooth cubic surfaces which can be realized as threefold-branched covers of $\mathbb{P}^{2}$, with branch locus equal to a smooth cubic curve. This family is parametrized by the space $\mathcal{U}_{3}$ of smooth cubic curves in $\mathbb{P}^{2}$ and each surface is equipped with a $\mathbb{Z}/3\ma…

Motivated by applications in computational anatomy, we consider a second-order problem in the calculus of variations on object manifolds that are acted upon by Lie groups of smooth invertible transformations. This problem leads to solution curves known as Riemannian cubics on object manifolds that are endowed with norm…

A natural family of affine cubic surfaces arises from SL(2)-characters of the 4-holed sphere and the 1-holed torus. The ideal locus is a tritangent plane which is generic in the sense that the cubic curve at infinity consists of three lines pairwise intersecting in three double points. We show that every affine cubic s…

We prove that every projective special Kähler manifold with \emph{regular boundary behaviour} is complete and defines a family of complete quaternionic Kähler manifolds depending on a parameter $c\ge 0$. We also show that, irrespective of its boundary behaviour, every complete projective special Kähler manifold with \e…

Classifies hexagonal circular 3-webs with cubic polar curves.

We show that, for Finsler spaces with cubic metric, Landsberg spaces are Berwaldian. Also, for decomposable metrics, we determine specific conditions for a space with cubic metric to be of Berwald type, thus refining the result in [6].