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

122243365486 · Jun 202019922001200920172026
48 results for quadratic complexity

The paper classifies real hypersurfaces with a specific Jacobi operator in complex Grassmannians.

problem Classifying real hypersurfaces with a particular Jacobi operator.
method Introducing and classifying real hypersurfaces with a quadratic Killing structure Jacobi operator.
result A classification theorem for Hopf real hypersurfaces with quadratic Killing structure Jacobi operator.

We show how the space of complex spin structures of a closed oriented three-manifold embeds naturally into a space of quadratic functions associated to its linking pairing. Besides, we extend the Goussarov-Habiro theory of finite type invariants to the realm of compact oriented three-manifolds equipped with a complex s…

2002-07-22abs ↗pdf ↗

A quadratic line complex is a three-parameter family of lines in projective space P^3 specified by a single quadratic relation in the Plucker coordinates. Fixing a point p in P^3 and taking all lines of the complex passing through p we obtain a quadratic cone with vertex at p. This family of cones supplies P^3 with a c…

2012-04-12abs ↗pdf ↗

Optimizes quadratic bandits with tight Hessian-dependent sample complexity bounds.

problem Understanding optimal sample complexity for quadratic functions.
method Introduces energy allocation and optimal energy spectrum to prove tight lower bounds. Solves for Hessian-independent optimal algorithm.
result Proves optimal Hessian-dependent sample complexities and existence of a universally optimal algorithm.

In this note, we derive a Liouville theorem for the complex Monge-Ampère equation. Our result states that if the global solution uu of the complex Monge-Ampère equation with constant right-hand side differs from a quadratic polynomial solution by $o(\abs{x}^2)$ at infinity, then uu is a quadratic polynomial.

2013-03-11abs ↗pdf ↗

The paper characterizes and studies compact subsets of complex projective space with specific line intersection properties.

problem Characterizing compact subsets of complex projective space with specific line intersection properties.
method Characterization and study of compact subsets of complex projective space with line intersection properties.
result Characterization of quadratic R-algebraic subsets of complex projective space.

This paper deals with the notion of quadratic differential in spherical CR geometry (or more generally on strictly pseudoconvex CR manifolds). We get to this notion by studying a splitting of Rumin complex and discuss its first features such as trajectories and length. We also define several differential operators on q…

2018-07-20abs ↗pdf ↗

Method solves complex optimization problems with high probability bounds.

problem Nonlinear equality constrained stochastic optimization problems.
method Step-search sequential quadratic programming method.
result High-probability bound on iteration complexity for first-order stationarity.

New connection found between complex polynomials and surface homeomorphisms.

problem Investigating the existence of generalized pseudo-Anosov maps from quadratic polynomials.
method Developed a new connection between dynamics of quadratic polynomials and surface homeomorphisms, focusing on Hubbard trees.
result Identified conditions for constructing generalized pseudo-Anosov maps from quadratic polynomials.

We study the limits of holonomy representations of complex projective structures on a compact Riemann surface in the Morgan-Shalen compactification of the character variety. We show that the dual R-trees of the quadratic differentials associated to a divergent sequence of projective structures determine the Morgan-Shal…

2011-05-25abs ↗pdf ↗

Inspired by complexity and diversity of biological neurons, our group proposed quadratic neurons by replacing the inner product in current artificial neurons with a quadratic operation on input data, thereby enhancing the capability of an individual neuron. Along this direction, we are motivated to evaluate the power o…

2019-01-17abs ↗pdf ↗

Skeinformer accelerates self-attention for long sequences with linear complexity.

problem Efficiency of Transformer models in processing long sequences.
method Matrix sketching and column sampling to reduce quadratic complexity to linear.
result Skeinformer outperforms alternatives with smaller time/space footprint.

Proves non-positivity of Hirzebruch form on stable weights and connects to flat logarithmic connections.

problem Non-positivity of Hirzebruch form on stable weights
method Kempf--Ness and frame-potential inequality
result Zero locus of Hirzebruch form on stable weights corresponds to flat logarithmic connections

New geometric Joyce structures on moduli spaces of quadratic differentials.

problem Constructing Joyce structures on moduli spaces of quadratic differentials.
method Isomonodromic deformations of second-order linear ODEs with rational potential.
result Construction of Joyce structures on moduli spaces of quadratic differentials.

We consider a quadratic form defined on the surfaces with parallel mean curvature vector of an any dimensional complex space form and prove that its (2,0)(2,0)-part is holomorphic. When the complex dimension of the ambient space is equal to 22 we define a second quadratic form with the same property and then determine th…

2010-11-25abs ↗pdf ↗

\infty-Harmonic maps are a generalization of \infty-harmonic functions. They can be viewed as the limiting cases of p-harmonic maps as p goes to infinity. In this paper, we give complete classifications of linear and quadratic \infty-harmonic maps from and into a sphere, quadratic \infty-harmonic maps between E…

2007-10-30abs ↗pdf ↗

Given a triangulation of a closed surface, we consider a cross ratio system that assigns a complex number to every edge satisfying certain polynomial equations per vertex. Every cross ratio system induces a complex projective structure together with a circle pattern on the closed surface. In particular, there is an ass…

2019-09-16abs ↗pdf ↗

For a knot KK, Kakimizu introduced a simplicial complex whose vertices are all the isotopy classes of minimal genus spanning surfaces for KK. The first purpose of this paper is to prove the 1-skeleton of this complex has diameter bounded by a function quadratic in knot genus, whenever KK is atoroidal. The second pur…

2007-01-17abs ↗pdf ↗

Study of complex structures on Courant algebroids, linking to Poisson structures.

problem Characterizing generalised complex structures on transitive Courant algebroids.
method Analyzing components and integrability equations in a specific splitting.
result Generalised complex structures imply non-degenerate Poisson structures on the base manifold.

The paper proves a theorem about constructing Higgs bundle moduli space.

problem Constructing the moduli space of Higgs bundles on a closed Riemann surface.
method Uses Kuranishi slice method and GIT quotient to prove the moduli space is a complex space locally modeled on a quadratic cone.
result The moduli space of Higgs bundles is a complex space locally modeled on an affine GIT quotient of a quadratic cone.

This thesis is concerned with the residues modulo 4 and 8 of the signature of a 4k-dimensional oriented geometric Poincare complex. The Z_8-valued Brown-Kervaire invariant of Z_4-valued quadratic forms is used to prove that if the signature is divisible by 4, the divisibility by 8 is detected by the Arf invariant of a …

2015-07-29abs ↗pdf ↗

Homotopy classification for certain 4-manifolds with dihedral fundamental groups.

problem Classifying the homotopy types of specific 4-manifolds with dihedral fundamental groups.
method Using quadratic 2-type and combining with results from Hambleton-Kreck and Bauer.
result Homotopy types of finite oriented Poincaré 4-complexes are determined by their quadratic 2-type when fundamental group is dihedral.

Quadratic memory is essential for optimal convex optimization queries.

problem Optimal query complexity for convex optimization and feasibility problems.
method Lower bounds on query complexity for convex optimization and feasibility problems.
result Center-of-mass algorithms are Pareto-optimal for both convex optimization and feasibility problems.

Quadratic-time algorithm computes stretch factors and foliations for pseudo-Anosov mapping classes.

problem Computing stretch factors and foliations for pseudo-Anosov mapping classes efficiently.
method Quadratic-time algorithm using input word and length as complexity measure.
result First algorithm to compute stretch factors and foliations in sub-exponential time.

We consider the tensor completion problem of predicting the missing entries of a tensor. The commonly used CP model has a triple product form, but an alternate family of quadratic models, which are the sum of pairwise products instead of a triple product, have emerged from applications such as recommendation systems. N…

2018-10-31abs ↗pdf ↗

It is shown that the sum of class numbers of orders in totally complex quartic fields with no real quadratic subfield obeys an asymptotic law similar to the prime numbers, as the bound on the regulators tends to infinity. Here only orders which are maximal at a given set of primes containing an even number of elements …

2006-02-14abs ↗pdf ↗

This paper develops a new method for eliciting more flexible metrics, improving fairness and applicability.

problem Limited flexibility in existing metric elicitation strategies for reflecting user preferences.
method Develops a strategy for eliciting quadratic metrics based on predictive rates, requiring only relative preference feedback.
result Achieves near-optimal query complexity and broadens the use cases for metric elicitation.

We provide geometric conditions on a pair of hyperplanes of a CAT(0) cube complex that imply divergence bounds for the cube complex. As an application, we classify all right-angled Coxeter groups with quadratic divergence and show right-angled Coxeter groups cannot exhibit a divergence function between quadratic and cu…

2016-11-14abs ↗pdf ↗

Transformers become faster by linearizing self-attention.

problem Quadratic complexity of transformers makes them slow for long sequences.
method Expressed self-attention as a linear dot-product and used matrix product associativity to reduce complexity.
result Linear transformers are up to 4000x faster on long sequences.

Study shows uniqueness of solutions on complex manifolds without requiring solution decay.

problem Uniqueness of solutions to Monge-Ampere equation on complex manifolds.
method Caccioppoli inequality techniques applied to Kähler manifolds with sub-quadratic volume growth.
result Uniqueness of bounded C1,1C^{1,1} solutions to Monge-Ampere equation without decay requirement.

Study on PG learning for LQ MFC problems with common noise, proving convergence and sample complexity.

problem Optimal policy learning in LQ MFC problems with common noise and entropy regularization.
method Comprehensive error analysis of PG algorithms in both model-based and model-free settings.
result Global linear convergence and sample complexity of PG algorithms in model-free setting.