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

146292438584 · Jun 202019922001200920172026
48 results for Higher Order Transformers

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.

Enhances stock movement prediction using Higher Order Transformers for multimodal time-series data.

problem Predicting stock movements in financial markets with complex dynamics.
method Introduced Higher Order Transformers, extending self-attention and transformer architecture to capture complex market dynamics. Employed low-rank tensor decomposition and kernel attention to manage computational complexity. Integrated technical and fundamental analysis from historical prices and tweets.
result Demonstrated effectiveness of the method on the Stocknet dataset, improving stock movement prediction.

This paper precisely estimates transformer derivatives for explicit learning guarantees.

problem Computing fully-explicit generalization bounds for transformers with precise higher-order derivative estimates.
method Analyzes and estimates all higher-order derivatives of transformers with multiple attention heads and layer normalization.
result Obtains explicit pathwise generalization bounds for transformers learning from non-i.i.d. samples.

Transformers can approximate Newton's method for logistic regression.

problem Implementing higher order optimization methods in Transformers.
method Linear attention Transformers with ReLU layers approximating second order optimization algorithms.
result Transformers can implement a single step of Newton's iteration for matrix inversion.

We extend the framework of variational autoencoders to represent transformations explicitly in the latent space. In the family of hierarchical graphical models that emerges, the latent space is populated by higher order objects that are inferred jointly with the latent representations they act on. To explicitly demonst…

2019-12-09abs ↗pdf ↗

We find a remarkable subalgebra of higher symmetries of the elliptic Euler-Darboux equation. To this aim we map such equation into its hyperbolic analogue already studied by Shemarulin. Taking into consideration how symmetries and recursion operators transform by this complex contact transformation, we explicitly give …

2006-02-08abs ↗pdf ↗

A key feature of inductive logic programming (ILP) is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs. In this paper, we introduce techniques to learn higher-order programs. Specifically, we extend meta-interpretive learning (MIL) to support learning higher…

2019-07-25abs ↗pdf ↗

In this article, using the generalized Newton transformation, we define higher order mean curvatures of distributions of arbitrary codimension and we show that they agree with the ones from Brito and Naveira (Ann. Global Anal. Geom. 18, 371-383 (2000)). We also introduce higher order mean curvature vector fields and we…

2009-08-12abs ↗pdf ↗

We present a geometric approach to the field theory with higher order anisotropic interactions. The concepts of higher order space, or locally anisotropic, space (in brief, h-space, or la-space) are introduced as general ones for various types of higher order extensions of Lagrange and Finsler geometry and higher dimen…

1996-11-09abs ↗pdf ↗

This work generalizes transformer attention to capture higher-order correlations efficiently.

problem Detecting triple-wise connections that were impossible for transformers.
method Developed a generalized attention scheme using Kronecker computation, showing near-linear time algorithms for bounded entries.
result A near-linear time algorithm for generalized attention computation in the bounded-entry setting.

Paper transforms a complex equation into simpler forms for analysis.

problem Analyzing a fourth-order dispersive flow equation on Kähler manifolds.
method Developed the generalized Hasimoto transformation to simplify the equation.
result Explicit expressions derived for three examples of compact Kähler manifolds.

The aim of this paper is to propose an unambiguous intrinsic formalism for higher-order field theories which avoids the arbitrariness in the generalization of the conventional description of field theories, which implies the existence of different Cartan forms and Legendre transformations. We propose a differential-geo…

2009-06-02abs ↗pdf ↗

FairGP uses graph partitioning to make Graph Transformers fair and scalable.

problem Fairness issues in Graph Transformers, especially against sensitive features.
method Graph partitioning to minimize the influence of higher-order nodes and optimize attention mechanisms.
result FairGP improves fairness in Graph Transformers while reducing computational complexity.

Extends RRR to capture nonlinear interactions in multi-response regression.

problem Complex relationships in real-world data cannot be adequately modeled by linear interactions.
method Introduces Higher Order Reduced Rank Regression (HORRR) using tensor representations and Tucker decomposition.
result HORRR can capture nonlinear interactions in multi-response regression.

A new method uses higher-order Langevin dynamics with critical damping for better generative modeling.

problem Improving generative models using Langevin dynamics with auxiliary variables.
method Introducing higher-order Langevin dynamics with critical damping, providing closed-form solutions.
result Improved generative models with better performance as measured by FID metric.

New estimator stabilizes higher-order influence functions for stable statistical inference.

problem Numerical instability in estimating inverse population Gram matrix.
method Proposes a new stabilized higher-order estimator without sample splitting.
result Stabilized estimator exhibits more stable performance and similar statistical guarantees.

New estimator stabilizes higher-order influence functions for bilinear forms.

problem Stability issues in estimating bilinear forms using higher-order influence functions.
method Proposes a new stabilized higher-order estimator for a class of bilinear forms without sample splitting.
result New estimator exhibits more stable finite-sample performance compared to the empirical higher-order estimator.

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 ↗

We propose an extension of the differential system for constant mean curvature (CMC) surfaces in a three dimensional space form to an associated hierarchy of evolution equations by the higher-order commuting symmetries. The infinite sequence of higher-order conservation laws of CMC surfaces admit the corresponding exte…

2013-12-27abs ↗pdf ↗

The paper studies geometric Airy curve flows on R^n and their properties.

problem Investigating the geometric Airy curve flow on R^n and its properties.
method The paper constructs a Poisson structure, Hamiltonians, and soliton solutions for the geometric Airy curve flow.
result The geometric Airy curve flow is shown to be Hamiltonian and has a sequence of commuting Hamiltonians.

We find the complete set of fundamental invariants for systems of ordinary differential equations of order 4\ge 4 under the group of point transformations generalizing similar results for contact invariants of a single ODE and point invariants of systems of the second and the third order. It turns out that starting fr…

2013-12-02abs ↗pdf ↗

We give a detailed microlocal study of X-ray transforms over geodesics-like families of curves with conjugate points of fold type. We show that the normal operator is the sum of a pseudodifferential operator and a Fourier integral operator. We compute the principal symbol of both operators and the canonical relation as…

2010-04-07abs ↗pdf ↗

Study third order Einstein deformations for Kähler-Einstein metrics on compact manifolds.

problem Existence of non-trivial Einstein deformations of Kähler metrics.
method Explicitly determined the obstruction to third order Einstein deformation and formulated it in terms of polynomial identities.
result Third order integrability for the Einstein equation is equivalent to Maurer-Cartan type equations and polynomial identities.

The paper studies Clifford-Bianchi groups acting on hyperbolic spaces and their properties.

problem Understanding the actions of Clifford-Bianchi groups on hyperbolic spaces.
method Developed the abstract and computational theory for determining fundamental domains and generators for orders in low dimensions.
result Found that Clifford-Bianchi groups are arithmetic subgroups of SO(1, n+1) and their Möbius action.

We provide a generalization of Bianchi's Bäcklund transformation from 2-dimensional quadrics to higher dimensional quadrics. The starting point of our investigation is the higher dimensional (infinitesimal) version of Bianchi's main four theorems on the theory of deformations of quadrics and Bianchi's treatment of the …

2008-08-14abs ↗pdf ↗

Researchers find explicit Bäcklund transforms for specific quadrics.

problem Isometric deformations of diagonal higher dimensional quadrics without center.
method Explicitly found Bäcklund transforms using the Bianchi Permutability Theorem and 3-moving Möbius configuration.
result Explicit solutions can be iterated with arbitrary constants.

Let MM be a smooth manifold and S\mathcal{S} a semi-spray defined on a sub-bundle C\mathcal{C} of the tangent bundle TMTM. In this work it is proved that the only non-trivial kk-jet approximation to the exact geodesic deviation equation of S\mathcal{S}, linear on the deviation functions and invariant under an spec…

2013-01-27abs ↗pdf ↗

Transforms game optimization dynamics into frequency domain for precise hyperparameter analysis.

problem Analyzing convergence of hyperparameters in game optimization.
method Frequency-domain framework using High-Resolution Differential Equations (HRDEs) and Laplace transforms.
result Derives precise convergence criteria for the Lookahead algorithm.

Researchers create higher-dimensional I\mathcal{I}^\prime-curvatures and find counterexamples to the Hirachi conjecture.

problem The Hirachi conjecture in higher CR dimensions.
method Constructing higher-dimensional I\mathcal{I}^\prime-curvatures and analyzing their properties under contact form changes.
result Total integrals of I\mathcal{I}^\prime-curvatures depend on the choice of contact form, providing counterexamples to the Hirachi conjecture.

The paper examines LpL^p gradient and Riesz transform estimates under Ricci lower bounds.

problem Investigating LpL^p estimates for solutions of the Poisson equation under Ricci lower bounds.
method Analyzes LpL^p estimates for gradient and Riesz transforms under Ricci lower bounds, providing counterexamples and bounds.
result Valid LpL^p estimates for gradient and Riesz transforms under Ricci lower bounds, with conditions on injectivity radius and curvature.

This work improves online SGD's sample complexity for multi-index models by considering higher-order terms.

problem Suboptimal sample complexity for learning multi-index models using online SGD.
method Focus on both second- and higher-order terms to improve sample complexity.
result Online SGD achieves ildeO(dPL1) ilde{O}(d P^{L-1}) samples for multi-index models.

Transformers capture combinatorial tasks with bounded error and logarithmic sample dependence.

problem Capturing complex combinatorial tasks with bounded error and sample efficiency.
method Formal definition of algorithmic capture, empirical analysis of infinite-width transformers, upper bounds on computational complexity.
result Transformers exhibit an inductive bias favoring simpler algorithmic procedures over higher complexity ones.