arXiv research

Random features enhance control of complex systems.

IDPGs extend RDPGs with a Poisson process for random latent positions.

No non-product Hessian rank 1 affine homogeneous hypersurfaces exist in dimensions 5 and above.

Using a coordinate free characterization of hyperplanes intersection, we provide explicitly a set of local generators for a smooth affine distribution given by those smooth vector fields $X\in\mathfrak{X}(U)$ defined eventually on an open subset $U\subseteq M$ of a smooth Riemannian manifold $(M,g)$, that verifies the …

Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and other kernel based learning algorithms. We extend this line of work and present low distortion embeddings for dot product kernels into linear…

Revisits neural collaborative filtering vs. matrix factorization, showing dot product superiority.

The trace of the affine Hecke category is compared with the elliptic Hall algebra.

Traditionally, multi-layer neural networks use dot product between the output vector of previous layer and the incoming weight vector as the input to activation function. The result of dot product is unbounded, thus increases the risk of large variance. Large variance of neuron makes the model sensitive to the change o…

We present eigenvalue decay estimates of integral operators associated with compositional dot-product kernels. The estimates improve on previous ones established for power series kernels on spheres. This allows us to obtain the volumes of balls in the corresponding reproducing kernel Hilbert spaces. We discuss the cons…

Improves efficiency of random feature approximations for dot product kernels.

Formula derived for spherical growth series of specific groups.

Extends random dot product graph model to handle multiple graphs.

Convex optimization method infers latent structure in random dot product graphs.

Convex clustering refers, for given $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^p$, to the minimization of \begin{eqnarray*} u(γ) & = & \underset{u_1, \dots, u_n }{\arg\min}\;\sum_{i=1}^{n}{\lVert x_i - u_i \rVert^2} + γ\sum_{i,j=1}^{n}{w_{ij} \lVert u_i - u_j\rVert},\\ \end{eqnarray*} where $w_{ij} \geq 0$ is a…

Vectors of data are at the heart of machine learning and data mining. Recently, vector quantization methods have shown great promise in reducing both the time and space costs of operating on vectors. We introduce a vector quantization algorithm that can compress vectors over 12x faster than existing techniques while al…

Let $G$ be a countable group that splits as a free product of groups of the form $G=G_1\ast\dots\ast G_k\ast F_N$, where $F_N$ is a finitely generated free group. We identify the closure of the outer space $P\mathcal{O}(G,\{G_1,\dots,G_k\})$ for the axes topology with the space of projective minimal, \emph{very small} …

New algorithms improve community detection and parameter estimation for PABM.

Transformers improve with Fourier integral attentions.

New clustering method recovers hidden tree structure from data.

The paper analyzes learning curves for kernel ridge regression with dot-product kernels.

In this paper, we consider the connectedness of planar self-affine set $T(A,\mathcal{D})$ arising from an integral expanding matrix $A$ with characteristic polynomial $f(x)=x^2+bx+c$ and a digit set $\mathcal{D}=\{0,1,\dots, m\}v$. The necessary and sufficient conditions only depending on $b,c,m$ are given for the $T(A…

Study on the topology of tensorial bodies, showing they are homeomorphic to a product space.

In this work we show that, using the eigen-decomposition of the adjacency matrix, we can consistently estimate latent positions for random dot product graphs provided the latent positions are i.i.d. from some distribution. If class labels are observed for a number of vertices tending to infinity, then we show that the …

A control system $\dot{q} = f(q,u)$ is said to be trivializable if there exists local coordinates in which the system is feedback equivalent to a control system of the form $\dot{q} = f(u)$. In this paper we characterize trivializable control systems and control systems for which, up to a feedback transformation, $f$ a…

New method uses manifold learning to infer latent positions of 1D submanifolds in random dot product graphs.

Solitons are special polygon midpoints under affine transformations.

The random dot product graph (RDPG) is an independent-edge random graph that is analytically tractable and, simultaneously, either encompasses or can successfully approximate a wide range of random graphs, from relatively simple stochastic block models to complex latent position graphs. In this survey paper, we describ…

The paper extends affine connection results to singular warped and twisted products.

We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology outlined in \citet{sussman2012universally} to construct consistent estimates for the …

At the core of any inference procedure in deep neural networks are dot product operations, which are the component that require the highest computational resources. A common approach to reduce the cost of inference is to reduce its memory complexity by lowering the entropy of the weight matrices of the neural network, …

The paper examines how well node similarities are preserved by random projections in graph embeddings.

Study special affine connections on symmetric spaces and their products.

Paper explores embedding methods for detecting pseudo-cliques in random graphs, showing limitations and potential.

Let $G=G_1\ast\dots\ast G_k\ast F$ be a countable group which splits as a free product, where all groups $G_i$ are freely indecomposable and not isomorphic to $\mathbb{Z}$, and $F$ is a finitely generated free group. If for all $i\in\{1,\dots,k\}$, both $G_i$ and its outer automorphism group $\text{Out}(G_i)$ satisfy t…

Power of network tests degrades when vertices are misaligned.

In this paper, we study the Einstein multiply warped products with a semi-symmetric non-metric connection and the multiply warped products with a semi-symmetric non-metric connection with constant scalar curvature, we apply our results to generalized Robertson-Walker spacetimes with a semi-symmetric non-metric connecti…

Elliptical Attention improves transformer performance by focusing on contextually relevant features.

Spectral embedding is a procedure which can be used to obtain vector representations of the nodes of a graph. This paper proposes a generalisation of the latent position network model known as the random dot product graph, to allow interpretation of those vector representations as latent position estimates. The general…

SDPA is shown to be an optimal transport problem in deep learning.

In this paper, we study locally strongly convex affine hyperspheres in the unimodular affine space $\mathbb{R}^{n+1}$ which, as Riemannian manifolds, are locally isometric to the Riemannian product of two Riemannian manifolds both possessing constant sectional curvatures. As the main result, a complete classification o…

Given $d\in \mathbb{N}$, $g\in \mathbb{N} \cup\{0\}$, and an integral vector $κ=(k_1,\dots,k_n)$ such that $k_i>-d$ and $k_1+\dots+k_n=d(2g-2)$, let $Ω^d\mathcal{M}_{g,n}(κ)$ denote the moduli space of meromorphic $d$-differentials on Riemann surfaces of genus $g$ whose zeros and poles have orders prescribed by $κ$. We…

The paper studies affine connections on singular warped products and their curvature.

New measures of asymmetry for triangles help evaluate electric power quality.

We introduce the $2$-simplicial Transformer, an extension of the Transformer which includes a form of higher-dimensional attention generalising the dot-product attention, and uses this attention to update entity representations with tensor products of value vectors. We show that this architecture is a useful inductive …

In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here we make use of complex valued embeddings. The composition of complex embeddings …

The paper extends RDPG model to handle weighted graphs, enabling better analysis of network data.

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…

Develops a unified framework for valuing insurance products with guarantees.