arXiv research

A new framework improves LSTM performance without adding more parameters.

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

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

Proposes a low-rank bilinear pooling model for link prediction in knowledge graphs.

New algorithm reduces regret in graphical bilinear bandits.

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…

Novel hybrid bilinear model improves epilepsy diagnosis accuracy.

Algorithm identifies bilinear dynamical systems from noisy data.

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…

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

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

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

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…

Vector-valued neural learning has emerged as a promising direction in deep learning recently. Traditionally, training data for neural networks (NNs) are formulated as a vector of scalars; however, its performance may not be optimal since associations among adjacent scalars are not modeled. In this paper, we propose a n…

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…

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

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.

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

Introduces and studies generalized B-opers with bilinear forms.

Study learns linear system dynamics from noisy bilinear data.

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.

BINAS improves neural architecture search with interpretable models.

BGNN improves GNN by modeling interactions between neighbor nodes.

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

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…

Improved SEG method converges to Nash equilibrium in bilinear games.

We are interested in approximation of a multivariate function $f(x_1,\dots,x_d)$ by linear combinations of products $u^1(x_1)\cdots u^d(x_d)$ of univariate functions $u^i(x_i)$, $i=1,\dots,d$. In the case $d=2$ it is a classical problem of bilinear approximation. In the case of approximation in the $L_2$ space the bili…

Deep learning has become the method of choice in many application domains of machine learning in recent years, especially for multi-class classification tasks. The most common loss function used in this context is the cross-entropy loss, which reduces to the log loss in the typical case when there is a single correct r…

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.

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

Fine-grained action segmentation in long untrimmed videos is an important task for many applications such as surveillance, robotics, and human-computer interaction. To understand subtle and precise actions within a long time period, second-order information (e.g. feature covariance) or higher is reported to be effectiv…

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

New framework allows reinforcement learning with polynomial sample complexity.

The study proves symplectic quandles cannot have good involutions.

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

The GANs are generative models whose random samples realistically reflect natural images. It also can generate samples with specific attributes by concatenating a condition vector into the input, yet research on this field is not well studied. We propose novel methods of conditioning generative adversarial networks (GA…

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…

New method improves convergence for smooth games.

BAM model learns graph structure from data with robustness across linear and non-linear dependencies.

The study finds points on surfaces where a tensor is conformal to a metric.

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

New inequalities generalize Li's theorem on mixed Hodge structures.