Algorithm identifies bilinear dynamical systems from noisy data.
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.
Trend · papers per month
Identifies bilinear systems from a single trajectory with optimal sample complexity.
Study dynamics of alternating minimization for bilinear regression under large system limits.
Study learns linear system dynamics from noisy bilinear data.
Paper reduces sample complexity for bilinear systems identification to nearly constant.
Non-bilinear observations make optimal control harder, showing non-convex costs and non-affine optimal controllers.
We present a new model, Predictive State Recurrent Neural Networks (PSRNNs), for filtering and prediction in dynamical systems. PSRNNs draw on insights from both Recurrent Neural Networks (RNNs) and Predictive State Representations (PSRs), and inherit advantages from both types of models. Like many successful RNN archi…
End-to-end algorithm for controlling bilinear systems with probabilistic noise.
Generalizes Riemann's results on flat coordinates for non-symmetric bilinear forms.
Gaussian-SVGD dynamics converge to Gaussian distributions under certain conditions.
We study a wide class of non-convex non-concave min-max games that generalizes over standard bilinear zero-sum games. In this class, players control the inputs of a smooth function whose output is being applied to a bilinear zero-sum game. This class of games is motivated by the indirect nature of the competition in Ge…
Advertising and feed ranking are essential to many Internet companies such as Facebook and Sina Weibo. Among many real-world advertising and feed ranking systems, click through rate (CTR) prediction plays a central role. There are many proposed models in this field such as logistic regression, tree based models, factor…
Efficient algorithm converges to Nash equilibrium in bilinear problems with bandit feedback.
In this paper, we propose to employ a bank of modality-dedicated Convolutional Neural Networks (CNNs), fuse, train, and optimize them together for person classification tasks. A modality-dedicated CNN is used for each modality to extract modality-specific features. We demonstrate that, rather than spatial fusion at the…
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…
Novel hybrid bilinear model improves epilepsy diagnosis accuracy.
New algorithm tackles nonstationary linear bandits with latent dynamics.
Inner product-based convolution has been the founding stone of convolutional neural networks (CNNs), enabling end-to-end learning of visual representation. By generalizing inner product with a bilinear matrix, we propose the neural similarity which serves as a learnable parametric similarity measure for CNNs. Neural si…
Min-max formulations have attracted great attention in the ML community due to the rise of deep generative models and adversarial methods, while understanding the dynamics of gradient algorithms for solving such formulations has remained a grand challenge. As a first step, we restrict to bilinear zero-sum games and giv…
The extragradient method accelerates convergence in complex game dynamics.
Via a non degenerate symmetric bilinear form we identify the coadjoint representation with a new representation and so we induce on the orbits a simplectic form. By considering Hamiltonian systems on the orbits we study some features of them and finally find commuting functions under the corresponding Lie-Poisson brack…
Two-stage nonconvex algorithm and convex relaxation both achieve optimal accuracy in noisy blind deconvolution.
We analyze the properties of arguably the simplest bilinear stochastic multiplicative process, proposed as a model of financial returns and of other complex systems combining both nonlinearity and multiplicative noise. By construction, it has no linear predictability (zero two-point correlation) but a certain nonlinear…
This work finds mixed equilibria in machine learning problems using measures and simultaneous gradient ascent-descent.
New algorithm solves complex stopping problems with robust optimization.
SympFormer accelerates attention blocks using inertial dynamics on density spaces.
New framework learns policies for partially observable systems.
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…
New algorithm reduces regret in graphical bilinear bandits.
Reasoning about graphs evolving over time is a challenging concept in many domains, such as bioinformatics, physics, and social networks. We consider a common case in which edges can be short term interactions (e.g., messaging) or long term structural connections (e.g., friendship). In practice, long term edges are oft…
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…
The paper studies geometric structures on SL(n,R) induced by the Killing form.
In this paper, we extend Su-Zhang's Cheeger-Mueller type theorem for symmetric bilinear torsions to manifolds with boundary in the case that the Riemannian metric and the non-degenerate symmetric bilinear form are of product structure near the boundary. Our result also extends Bruening-Ma's Cheeger-Mueller type theorem…
Bilinear MLPs offer a new way to interpret deep learning models without complex nonlinearities.
Automatic emotion recognition (AER) is a challenging task due to the abstract concept and multiple expressions of emotion. Although there is no consensus on a definition, human emotional states usually can be apperceived by auditory and visual systems. Inspired by this cognitive process in human beings, it's natural to…
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…
Bayesian model predicts mid-price dynamics in financial markets.
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…
Enhances knot invariants using bilinear forms on vector spaces.
Constructs a bilinear form from a quasimorphism on symplectic manifold groups.
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.
A parsimonious model reduces over-parameterization in skewed matrix variate mixtures.
New algorithm optimizes resource allocation in non-stationary networks.
We use the Jones-Wenzl idempotents to construct a basis of Temperley-Lieb algebra TL_n. This allows a short calculation for a Gram determinant of Lickorish's bilinear form on the Temperley-Lieb algebra.
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…
Unified bounds for sketched bilinear forms in machine learning and statistics.
BiN normalizes financial time-series for better forecasting.
Proposes a low-rank bilinear pooling model for link prediction in knowledge graphs.