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

305989118 · Jun 202619922001200920182026
48 results for compact bilinear

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.

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.

Efficient algorithm converges to Nash equilibrium in bilinear problems with bandit feedback.

problem Learning dynamics in bilinear saddle-point problems with bandit feedback.
method Uncoupled learning algorithm combining experimental design and FTRL with a tailored regularizer.
result Last-iterate convergence rate of ildeO(T1/4) ilde{O}(T^{-1/4}) in high probability.

Hyperplane hashing aims at rapidly searching nearest points to a hyperplane, and has shown practical impact in scaling up active learning with SVMs. Unfortunately, the existing randomized methods need long hash codes to achieve reasonable search accuracy and thus suffer from reduced search speed and large memory overhe…

2012-06-18abs ↗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.

Defines metric bundles for manifold geometries, unifying various types of metrics.

problem Unified framework for various types of metrics on manifolds.
method Formalizes metric bundles and defines open fiberwise cones for nondegenerate symmetric bilinear forms.
result Unified framework subsumes Riemannian and pseudo-Riemannian metrics, and extends to other structures.

Compact bilinear pooling approximates covariance features for faster training.

problem Efficiently approximating covariance features for faster training.
method Compact bilinear pooling extended to polynomial approximations of covariance features.
result The proposed method achieves comparable accuracy with fewer dimensions.

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 ↗

New method deforms function algebras on manifolds using spectral decomposition.

problem Deforming function algebras on compact Riemannian manifolds.
method Introducing a bilinear product on the finite spectral core of smooth functions using unimodular phases.
result The product extends to a Sobolev algebra and admits iteration under certain conditions.

Every smooth vector field is a combination of gradient fields.

problem Expressing arbitrary smooth vector fields as combinations of gradient fields.
method Proving every smooth vector field can be written as a finite linear combination of iterated Lie brackets of gradient vector fields.
result Every smooth vector field is a combination of gradient fields.

Simply connected indefinite homogeneous spaces are compact and have specific Lie algebra structures.

problem Characterizing simply connected indefinite homogeneous spaces of finite volume.
method Analyzing Lie algebras with abelian solvable radical and symmetric bilinear form.
result Simply connected indefinite homogeneous spaces are compact and have specific Lie algebra structures.

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 paper explores geometric decompositions for Ricci tensors and their applications.

problem Understanding Ricci tensors on compact Riemannian manifolds.
method Utilizes Berger-Ebin and York L2L^2-orthogonal decompositions.
result New insights into Ricci almost solitons and harmonic maps.

Harmonic 3-forms defined on compact homogeneous spaces are studied and conditions for their harmonicity are provided.

problem Analyzing harmonic 3-forms on compact homogeneous spaces.
method Investigating bi-invariant symmetric bilinear forms and their associated closed 3-forms, determining conditions for these forms to be harmonic under various metrics.
result Conditions for the harmonicity of 3-forms HQH_Q are given, and specific behaviors are observed depending on the structure of the space.

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

For a principal $\rmSU(n)$-bundle over a compact manifold of dimension 2,3,42,3,4, we determine the orbit types of the action of the gauge group on the space of connections modulo pointed local gauge transformations. We find that they are given by Howe subgroups of $\rmSU(n)$ for which a certain characteristic equation is…

2001-04-18abs ↗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.

A Hermitian symplectic manifold is a complex manifold endowed with a symplectic form ωω, for which the bilinear form ω(I,)ω(I\cdot,\cdot) is positive definite. In this work we prove ddcdd^c-lemma for 1- and (1,1)-forms for compact Hermitian symplectic manifolds of dimension 3. This shows that Albanese map for such manifol…

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

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.

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.

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.

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 ↗

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.

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.

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.

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 ↗

Improved SEG method converges to Nash equilibrium in bilinear games.

problem Stochastic bilinear minimax optimization problem
method Stochastic ExtraGradient (SEG) method with constant step size, iteration averaging, and scheduled restarting.
result Provable convergence to Nash equilibrium under standard settings, optimal convergence rate in interpolation setting.

Proposes a bilinear form to efficiently represent high-order temporal action information.

problem Efficiently capturing subtle and precise actions in long videos.
method Low-rank frontal tensors and bilinear form for extracting high-order information.
result Bilinear form outperforms state-of-the-art methods on temporal action segmentation.

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 ↗