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

Trend · papers per month

4794141188 · Jun 202019922001200920172026
48 results for bilinear strategies

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.

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 ↗

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.

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.

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

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.

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.

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.

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 ↗

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 ↗

End-to-end algorithm for controlling bilinear systems with probabilistic noise.

problem Controlling bilinear systems with noisy data.
method Proposes an end-to-end algorithm using statistical learning theory and robust controller design.
result Derived finite sample identification error bounds and structurally suitable for control.

We introduce invariants of Hurwitz equivalence classes with respect to arbitrary group GG. The invariants are constructed from any right GG-modules MM and any GG-invariant bilinear function on MM, and are of bilinear forms. For instance, when GG is the mapping class group of the closed surface, Mg\mathcal{M}_g, w…

2016-11-14abs ↗pdf ↗

The paper defines Z-graded hom-Lie superalgebras and explores their properties.

problem Understanding the structure and properties of Z-graded hom-Lie superalgebras.
method Definition and exploration of Z-graded hom-Lie superalgebras, invariant bilinear forms, and simplicity conditions.
result Maximal and minimal Z-graded hom-Lie superalgebras for local hom-Lie superalgebras are identified, and conditions for simplicity are checked.

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.

Over the years data has become increasingly higher dimensional, which has prompted an increased need for dimension reduction techniques. This is perhaps especially true for clustering (unsupervised classification) as well as semi-supervised and supervised classification. Although dimension reduction in the area of clus…

2017-12-22abs ↗pdf ↗

A new method clusters multi-view data by sharing a common trace-norm of coefficient matrices.

problem Insufficient exploitation of multi-view data due to uniform coefficient matrices.
method Imposes bilinear factorization with orthonormality and low-rank constraints on coefficient matrices.
result The proposed CBF-MSC method effectively clusters multi-view data more comprehensively.

Consider a smooth manifold with a smooth metric which changes bilinear type from Riemann to Lorentz on a hypersurface ΣΣ with radical tangent to ΣΣ. Two natural bilinear symmetric forms appear there, and we use it to analyze the geometry of ΣΣ. We show the way in which these forms control the smooth extensibility ov…

2003-06-10abs ↗pdf ↗

We generalize a theorem of Bismut-Zhang, which extends the Cheeger-Mueller theorem on Ray-Singer torsion and Reidemeister torsion, to the case where the flat vector bundle over a closed manifold carries a nondegenerate symmetric bilinear form. As a consequence, we prove the Burghelea-Haller conjecture which gives an an…

2006-10-19abs ↗pdf ↗

Wide neural networks become linear, but adding bottlenecks makes them bilinear or multilinear.

problem Understanding the transition of neural networks from linearity to higher-order functions.
method Analyzing the behavior of randomly initialized wide neural networks with and without bottleneck layers.
result Bottleneck layers transform the network's function from linear to bilinear or multilinear.

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 ↗