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,742 papers · 148 categories

Trend · papers per month

20405979 · Jun 202019922001200920172026
48 results for bilinear pairing

In this paper the notion of an M-th order invariant bilinear differential pairing is introduced and a formal definition is given. If the manifold has an AHS structure, then various first order pairings are constructed. This yields a classification of all first order invariant bilinear differential pairings on homogeneo…

2007-03-29abs ↗pdf ↗

This thesis is concerned with the theory of invariant bilinear differential pairings on parabolic geometries. It introduces the concept formally with the help of the jet bundle formalism and provides a detailed analysis. More precisely, after introducing the most important notations and definitions, we first of all giv…

2009-04-21abs ↗pdf ↗

We provide a diagrammatic computation for the bilinear form, which is defined as the pairing between the (relative) cup products with every local coefficients and every integral homology 2-class of every links in the 3-sphere. As a corollary, we construct bilinear forms on the twisted Alexander modules of links.

2016-02-02abs ↗pdf ↗

We introduce a notion of duality for a Lie-Rinehart algebra giving certain bilinear pairings in its cohomology generalizing the usual notions of Poincaré duality in Lie algebra cohomology and de Rham cohomology. We show that the duality isomorphisms can be given by a cap product with a suitable fundamental class and he…

1997-02-08abs ↗pdf ↗

Constructs a bilinear form from a quasimorphism on symplectic manifold groups.

problem Understanding symplectic group properties through quasimorphisms and bilinear forms.
method Develops machinery to construct a real-valued bilinear form from a quasimorphism on the commutator subgroup of symplectic group.
result The constructed bilinear form b\mathfrak{b} controls extendability of quasimorphisms and triviality of characteristic classes.

Unified bounds for sketched bilinear forms in machine learning and statistics.

problem Uniform bounds on sketched bilinear forms for modern analyses.
method Generic chaining and new techniques for handling suprema over pairs of sets.
result Improved convergence bounds for sketched Federated Learning and bandit algorithms.

Characterizes alternating links in thickened surfaces using Gordon-Litherland pairing.

problem Identifying alternating links in thickened surfaces.
method Extension of Gordon-Litherland pairing to thickened surfaces.
result A non-split link in a thickened surface is alternating if and only if it bounds two definite surfaces of opposite sign.

Develops a framework for 1D geometric field theories and proves they are equivalent to vector bundles.

problem Classifying 1D geometric field theories.
method Formalizes geometric functorial field theories with geometric structures and smooth variations.
result 1D field theories are equivalent to vector bundles with connection and bilinear pairing.

We obtain bounds on the least dimension of an affine space that can contain an nn-dimensional submanifold without any pairs of parallel or intersecting tangent lines at distinct points. This problem is closely related to the generalized vector field problem, non-singular bilinear maps, and the immersion problem for re…

2003-07-03abs ↗pdf ↗

We investigate classification results for general quadratic functions on torsion abelian groups. Unlike the previously studied situations, general quadratic functions are allowed to be inhomogeneous or degenerate. We study the discriminant construction which assigns, to an integral lattice with a distinguished characte…

2003-01-06abs ↗pdf ↗

Given an abelian group AA and a Lie group GG, we construct a bilinear pairing from A×π1(R)A\timesπ_1({\mathcal R}) to π1(G)π_1(G), where R\mathcal R is a subvariety of the variety of representations AGA\to G. In the case where AA is the peripheral subgroup of a torus or two-bridge knot group, G=S1G=S^1 and R\mathcal R is a …

2007-06-07abs ↗pdf ↗

Study tackles distribution shift in combinatorial settings using matrix completion techniques.

problem Tackling distribution shift in combinatorial settings with rigorous statistical guarantees.
method Develops novel algorithms and theoretical results for extrapolating to test distributions not covered in training.
result Achieves bilinear combinatorial extrapolation under gradual spectral decay in high-dimensional data.

We introduce the bilinear bandit problem with low-rank structure in which an action takes the form of a pair of arms from two different entity types, and the reward is a bilinear function of the known feature vectors of the arms. The unknown in the problem is a d1d_1 by d2d_2 matrix Θ\mathbfΘ^* that defines the reward…

2019-01-08abs ↗pdf ↗

This paper presents a novel unifying framework of bilinear LSTMs that can represent and utilize the nonlinear interaction of the input features present in sequence datasets for achieving superior performance over a linear LSTM and yet not incur more parameters to be learned. To realize this, our unifying framework allo…

2019-10-23abs ↗pdf ↗

New algorithm reduces regret in graphical bilinear bandits.

problem Optimizing decisions in a network of agents playing bilinear games.
method Optimism in the face of uncertainty principle applied to combinatorial NP-hard problem.
result Upper bound of ildeO(T) ilde{O}(\sqrt{T}) on αα-regret demonstrated.

Generalization of twistor spinors to Kähler manifolds which are called Kählerian twistor spinors are considered. We find the differential equation satisfied by the bilinear forms of Kählerian twistor spinors. We show that the bilinear form equation reduces to Kählerian conformal Killing-Yano equation under special cond…

2018-11-26abs ↗pdf ↗

Algorithm identifies bilinear dynamical systems from noisy data.

problem Learning a realization of a partially observed bilinear dynamical system.
method Regression of outputs to highly correlated covariates for Markov-like parameters.
result High probability error bounds on identification algorithm under uniform stability assumption.

Bilinear MLPs offer a new way to interpret deep learning models without complex nonlinearities.

problem Lack of mechanistic understanding in how MLPs compute.
method Introduced bilinear MLPs without element-wise nonlinearities, analyzed their weights using tensor and eigendecomposition.
result Bilinear MLPs provide interpretable weight structures and enable adversarial attacks and overfitting analysis.

Identifies bilinear systems from a single trajectory with optimal sample complexity.

problem Learning bilinear systems from a single trajectory of states and inputs.
method Uses a mild marginal mean-square stability assumption and martingale small-ball condition.
result Sample complexity and statistical error rates are optimal.

Generalizes Riemann's results on flat coordinates for non-symmetric bilinear forms.

problem Finding flat coordinates for non-symmetric bilinear forms.
method Provides explicit necessary and sufficient conditions for a tensor field of type (0,2) to be flat.
result Explicit conditions for a tensor field to have constant entries in local coordinates.

The theory of harmonic symmetric bilinear forms on a Riemannian manifold is an analogue of the theory of harmonic exterior differential forms on this manifold. To show this, we must consider every symmetric bilinear form on a Riemannian manifold as a one-form with values in the cotangent bundle of this manifold. In thi…

2019-08-06abs ↗pdf ↗

The theory of Poisson Vertex Algebras (PVAs) is a good framework to treat Hamiltonian partial differential equations. A PVA consists of a pair (A,{λ})(\mathcal{A},\{\cdot_λ\cdot\}) of a differential algebra A\mathcal{A} and a bilinear operation called the λλ-bracket. We extend the definition to the class of algebras $\mat…

2013-12-06abs ↗pdf ↗

Paper reduces sample complexity for bilinear systems identification to nearly constant.

problem Identifying discrete-time bilinear systems under bounded disturbances.
method Uses trajectory-dependent regressors and polynomial mean-square state growth analysis.
result Proves sample complexity of O~(1/ε)\widetilde{\mathcal O}(1/ε) for estimation error εε.

This note provides a neat and enjoyable expansion and application of the magnificent Ordentlich-Cover theory of "universal portfolios." I generalize Cover's benchmark of the best constant-rebalanced portfolio (or 1-linear trading strategy) in hindsight by considering the best bilinear trading strategy determined in hin…

2019-07-23abs ↗pdf ↗

We define a type of biquandle which is a generalization of symplectic quandles. We use the extra structure of these bilinear biquandles to define new knot and link invariants and give some examples.

2007-08-14abs ↗pdf ↗

A parsimonious model reduces over-parameterization in skewed matrix variate mixtures.

problem Over-parameterization in skewed matrix variate mixtures.
method Parsimonious family of 256 models using bilinear factor analyzers constrained over clusters, with AECM algorithm for estimation.
result Extensive simulations and real-world datasets (MNIST, Olivetti faces) demonstrate the method's effectiveness.

Study learns linear system dynamics from noisy bilinear data.

problem Learning linear dynamics from bilinear observations with process and measurement noise.
method Regression with Kronecker product design, data-dependent and independent error bounds.
result Upper bounds on statistical error rates and sample complexity for learning dynamics matrices.

The paper establishes correspondences between quaternionic spinors, Minkowski flags, and hyperbolic horospheres.

problem Understanding geometric correspondences in 4D hyperbolic geometry.
method Explicit bijective correspondences using Clifford matrices and bilinear forms.
result Lambda lengths generalize to quaternionic values in 4D hyperbolic space and satisfy a non-commutative Ptolemy equation.

Non-bilinear observations make optimal control harder, showing non-convex costs and non-affine optimal controllers.

problem Optimal control from bilinear observations in linear systems is challenging.
method Analytical and numerical methods to study the non-convex cost-to-go and non-affine optimal controllers.
result The Separation Principle does not hold for bilinear observations, leading to non-convex costs and non-affine optimal controllers.

Study dynamics of alternating minimization for bilinear regression under large system limits.

problem Understanding the time evolution of alternating minimization for bilinear regression.
method Replica method applied to a multi-temperature glassy system.
result Dynamics of alternating minimization can be described by a two-dimensional discrete stochastic process.