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.

169,051 papers · 148 categories

Trend · papers per month

163325488650 · Jun 202019922001200920182026
48 results for cubic function

{\em Riemannian cubics} are curves in a manifold MM that satisfy a variational condition appropriate for interpolation problems. When MM 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…

2011-04-13abs ↗pdf ↗

New Finsler metrics describe trace function growth rates in convex projective surfaces.

problem Understanding growth rates of trace functions in convex projective surfaces.
method Introduced new Finsler metrics and showed their convergence to describe trace function growth.
result Logarithms of trace functions are approximated by lengths in a Finsler metric defined by cubic differential.

We consider non-degenerate centro-affine hypersurface immersions in R^n whose cubic form is parallel with respect to the Levi-Civita connection of the affine metric. There exists a bijective correspondence between homothetic families of proper affine hyperspheres with center in the origin and with parallel cubic form, …

2012-08-06abs ↗pdf ↗

Following earlier work of Loftin-McIntosh, we study minimal Lagrangian immersions of the universal cover of a closed surface (of genus at least 2) into CH2, with prescribed data of a conformal structure plus a holomorphic cubic differential. We show existence and non-uniqueness of such minimal Lagrangian immersions. We…

2012-01-18abs ↗pdf ↗

Presented are two neural network architectures for convex functions, demonstrating competitive performance.

problem Approximating convex functions efficiently and accurately.
method Developed two neural network architectures: one based on linear-by-part representation and the other on cubic splines.
result Cubic ICKAN networks produce results similar to classical ICNNs in solving convex approximation problems.

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…

2017-05-16abs ↗pdf ↗

Stochastic methods tackle inexact Hessian and gradient computations in large-scale non-convex optimization.

problem Efficiently solving non-convex optimization problems with inexact Hessian and gradient computations.
method Stochastic trust region and cubic regularization methods with inexact gradient, Hessian, and function values.
result Achieves ε-approximate second-order optimality with similar iteration complexity as exact computations.

The study explores the Dehn functions of Kähler groups and their properties.

problem Which functions can arise as Dehn functions of Kähler groups?
method Analyzes examples of Kähler groups with various Dehn functions and proves the existence of a Kähler group with a cubic bounded Dehn function.
result There exists a Kähler group with a cubic bounded Dehn function and an exponential upper bound.

Modeling financial bubbles and crashes with a cubic momentum function.

problem Capturing the micro-level dynamics of investor behavior and panic selling.
method Introducing a cubic function of market momentum to model trend-following and sudden crashes.
result The model successfully replicates complex, nonlinear bubble dynamics.

The (isothermic) compressibility of lattice knots can be examined as a model of the effects of topology and geometry on the compressibility of ring polymers. In this paper, the compressibility of minimal length lattice knots in the simple cubic, face centered cubic and body centered cubic lattices are determined. Our r…

2012-03-14abs ↗pdf ↗

Computes the monodromy of cubic surfaces branching over smooth cubic curves.

problem Understanding the monodromy of cubic surfaces.
method Computational approach using the relationship between inflection points and lines on cubic surfaces.
result The monodromy map is surjective onto the centralizer of the image of a generator of the deck group.

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…

2017-12-08abs ↗pdf ↗

Simple stochastic Newton and cubic Newton methods with fast convergence.

problem Minimizing large numbers of smooth and strongly convex functions.
method Stochastic Newton and cubic Newton methods with simple local linear-quadratic rates.
result Local linear-quadratic convergence results with fast adaptation to problem's curvature.

Improved SVRC algorithm reduces complexity for nonconvex optimization.

problem Finding local minima for nonconvex finite-sum optimization with improved complexity.
method Stochastic Recursive Variance-Reduced Cubic regularization (SRVRC) using recursively updated semi-stochastic gradient and Hessian estimators.
result SRVRC achieves improved gradient and Hessian complexities to find (ε,ε)(ε, \sqrtε)-approximate local minimum.

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…

2012-05-23abs ↗pdf ↗

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

problem Classical homotopy theory limitations in cubical sets and uniform spaces.
method Develops a uniform-theoretic refinement for cubical sets and uniform spaces, lifting to a full and faithful embedding.
result Lifts classical homotopy categories to new uniform homotopy categories, generalizing cohomology theories.

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…

2008-04-30abs ↗pdf ↗

CR method improves convergence for nonconvex optimization under KL property.

problem Improving convergence rate for nonconvex optimization problems.
method Cubic-regularized Newton's method exploiting Kurdyka-Lojasiewicz (KL) property.
result Asymptotic convergence rates of various optimality measures are fully characterized.

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

problem Understanding conformal properties of cubic metrics with isotropic scalar curvature.
method Analyzing the conformal flatness and isotropic scalar curvature of cubic metrics.
result Cubic metrics with weakly isotropic scalar curvature must be Minkowski metrics.

We consider non-degenerate graph immersions into affine space An+1\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,γ)(J,γ), where JJ is an nn-dimensional real Jordan algebra and γγ is a no…

2013-02-06abs ↗pdf ↗

ParamBoost uses gradient boosting to create interpretable non-linear models with constraints.

problem Creating interpretable non-linear models with expert knowledge constraints.
method Gradient Boosting of cubic polynomials with specified constraints.
result ParamBoost outperforms state-of-the-art GAMs in real-world datasets.

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.

2012-12-12abs ↗pdf ↗

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.

2007-06-19abs ↗pdf ↗

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…

2011-12-29abs ↗pdf ↗

Classifies hexagonal circular 3-webs with cubic polar curves.

problem Classifying hexagonal circular 3-webs with algebraic polar curves of degree three.
method Analyzes hexagonal circular 3-webs on unit sphere with polar points on a twisted cubic.
result Completes the classification of hexagonal circular 3-webs with algebraic polar curves of degree three.

CuMPerLay vectorizes CMP for deep learning, improving image analysis.

problem Complex multifiltration structures hinder using CMP in deep learning.
method Introduces a new algorithm for vectorizing MP homologies of cubical complexes.
result Differentiable vectorization enables robust topological feature vectors for deep learning.

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].

2008-10-22abs ↗pdf ↗

We give a generalization of the well-known result of E. Cartan on isoparametric cubics by showing that a homogeneous cubic polynomial solution of the eiconal equation f2=9x4|\nabla f|^2=9|x|^4 must be rotationally equivalent to either xn33xn(x12+...+xn12)x_n^3-3x_n(x_1^2+...+x_{n-1}^2), or to one of four exceptional Cartan cubic polynomials…

2010-01-14abs ↗pdf ↗

Study on choosing points on cubic curves, answering some questions about their flexibility.

problem Determining if algebraic structures can continuously choose points on cubic plane curves.
method Analyzing the flex points and sextatic points of cubic plane curves.
result Affirmative answer for n=9n=9 and 18, negative for infinitely many nn.

Researchers classify and visualize 5-cube cubical surfaces.

problem Classifying and visualizing surfaces in a 5-dimensional cube.
method Exhaustive search, classification by genus and demigenus, 3D visualization, reinforcement learning for optimization.
result 2690 connected closed cubical surfaces in the 5-cube, visualized and optimized for 3D printing.