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

Trend · papers per month

59118176235 · Jun 202019922001200920182026
48 results for bilinear relations

We compute the Chen-Ruan orbifold cohomology ring of the Batyrev mirror orbifold of a smooth quintic hypersurface in 4-dimensional projective space. We identify the obstruction bundle for this example by using the Riemann bilinear relations for periods. We outline a general method of computing the Chen-Ruan ring for Ca…

2002-10-12abs ↗pdf ↗

We consider the equations, arising as the conformal invariance conditions of the perturbed curved beta-gamma system. These equations have the physical meaning of Einstein equations with a B-field and a dilaton on a hermitian manifold, where the B-field 2-form is imaginary and proportional to the canonical form associat…

2007-08-05abs ↗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 are interested in approximation of a multivariate function f(x1,,xd)f(x_1,\dots,x_d) by linear combinations of products u1(x1)ud(xd)u^1(x_1)\cdots u^d(x_d) of univariate functions ui(xi)u^i(x_i), i=1,,di=1,\dots,d. In the case d=2d=2 it is a classical problem of bilinear approximation. In the case of approximation in the L2L_2 space the bili…

2014-09-04abs ↗pdf ↗

Optimal Strichartz estimates for Schrödinger on Zoll manifolds.

problem Optimal Strichartz estimates for solutions to the Schrödinger equation on Zoll manifolds.
method Arithmetic properties of the spectrum of the Laplacian and bilinear oscillatory integral estimates.
result Optimal Strichartz estimates for all q2q \geq 2 in Lt,xqL^q_{t,x} spaces.

A new loss function penalizes different types of errors in deep learning models.

problem Different types of errors in deep learning models are not equally harmful.
method Introducing the log bilinear loss to differentiate error penalties.
result The log bilinear loss method better contains error within the correct super-class.

Improved KG completion on large datasets using entity-relation pair occurrences.

problem Performance bottleneck in training large-scale KGs due to memory constraints.
method Construct a joint learning model using pairwise occurrence information and increase negative sampling quality.
result Significant improvement in performance, especially with low batch size and negative examples.

We establish in this note some Cauchy-Schwarz-type inequalities on compact Kähler manifolds, which generalize the classical Khovanskii-Teissier inequalities to higher-dimensional cases. Our proof is to make full use of the mixed Hodge-Riemann bilinear relations due to Dinh and Nguye^\hat{\text{e}}n. A proportionality p…

2015-01-30abs ↗pdf ↗

A new framework improves LSTM performance without adding more parameters.

problem Improving LSTM performance without increasing model complexity.
method A unifying framework of bilinear LSTMs that balances hidden state vector size and weight matrix approximation quality.
result Bilinear LSTMs achieve superior performance compared to linear LSTMs without additional parameters.

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.

The study generalizes twistor spinors to Kähler manifolds and finds bilinear form equations.

problem Generalizing twistor spinors to Kähler manifolds.
method Finding differential equations and reducing them to conformal Killing-Yano equations.
result Bilinear forms of Kählerian twistor spinors reduce to Kählerian conformal Killing-Yano equations under certain conditions.

The paper studies harmonic symmetric bilinear forms on Riemannian manifolds and proves properties of the Bourguignon Laplacian.

problem Analyzing harmonic symmetric bilinear forms on Riemannian manifolds.
method Developed the theory of harmonic symmetric bilinear forms and proved properties of the Bourguignon Laplacian.
result The kernel of the Bourguignon Laplacian is a finite-dimensional vector space of harmonic symmetric bilinear forms on a compact Riemannian manifold.

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 ↗

Deep Fusion improves audio-video emotion recognition accuracy.

problem Challenges in automatic emotion recognition due to abstract concept and multiple expressions of emotion.
method Introduces factorized bilinear pooling (FBP) with embedded attention mechanism to integrate audio and video features.
result Achieves an accuracy of 62.48% on AFEW database, outperforming state-of-the-art results.

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.

In this paper we present a unified framework for modeling multi-relational representations, scoring, and learning, and conduct an empirical study of several recent multi-relational embedding models under the framework. We investigate the different choices of relation operators based on linear and bilinear transformatio…

2014-11-14abs ↗pdf ↗

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 ideal of relations in the (small) quantum cohomology ring of the generalized flag manifold G/BG/B has been determined by B. Kim. We are going to point out a limited number of properties that, if they are satisfied by an R[q1,...,ql]R[q_1,...,q_l]-bilinear product \circ on H(G/B)R[q1,...,qlH^*(G/B)\otimes R[q_1,...,q_l, then the ring $(H^*…

2002-10-02abs ↗pdf ↗

Proposes a new CNN approach for multimodal biometric identification.

problem Improving biometric identification accuracy across multiple modalities.
method Uses a bank of modality-specific CNNs, fuses their outputs, and optimizes the system.
result Significantly outperforms unimodal systems and demonstrates reduction in parameters.

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

The second fundamental form of Riemannian geometry is generalised to the case of a manifold with a linear connection and an integrable distribution. This bilinear form is generally not symmetric and its skew part is the torsion. The form itself is closely related to the shape map of the connection. The codimension one …

2015-06-04abs ↗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.

Develops a bialgebra theory for post-Lie algebras using geometric interpretations and bilinear forms.

problem Characterizing and understanding post-Lie algebras and their associated structures.
method Utilizes Manin triples and generalized Hessian Lie groups to define and characterize post-Lie algebras with nondegenerate symmetric invariant bilinear forms.
result Establishes a bialgebra theory for post-Lie algebras via the Manin triple approach, including new algebraic structures like pp-post-Lie algebras.

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 ↗

Gradient methods converge better for alternating updates in bilinear zero-sum games.

problem Understanding the dynamics of gradient algorithms for bilinear zero-sum games.
method Systematic analysis of popular gradient updates for simultaneous and alternating versions of bilinear zero-sum games.
result Alternating updates converge better than simultaneous ones, with optimal parameter setup and rates.

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.

We detail the theory of Discrete Riemann Surfaces. It takes place on a cellular decomposition of a surface, together with its Poincaré dual, equipped with a discrete conformal structure. A lot of theorems of the continuous theory follow through to the discrete case, we define the discrete analogs of period matrices, Ri…

2008-02-12abs ↗pdf ↗

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.

New algorithm solves complex stopping problems with robust optimization.

problem Solving complex stochastic optimal stopping problems.
method Simulation-based robust optimization with exact reformulation as a zero-one bilinear program.
result Developed polynomial-time heuristics and algorithms for practical solution.

ABIPNN improves neural network performance by processing vectors in each neuron.

problem Traditional neural networks fail to model associations among adjacent scalars.
method ABIPNN uses arbitrary bilinear products to process vector-valued neurons.
result ABIPNN outperforms conventional neural networks in multispectral image denoising and singing voice separation.

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.

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.