Recovery Guarantees for Quadratic Tensors with Limited Observations

We consider the tensor completion problem of predicting the missing entries of a tensor. The commonly used CP model has a triple product form, but an alternate family of quadratic models which are the sum of pairwise products instead of a triple product have emerged from applications such as recommendation systems. Non-convex methods are the method of choice for learning quadratic models, and this work examines their sample complexity and error guarantee. Our main result is that with the number of samples being only linear in the dimension, all local minima of the mean squared error objective are global minima and recover the original tensor accurately. The techniques lead to simple proofs showing that convex relaxation can recover quadratic tensors provided with linear number of samples. We substantiate our theoretical results with experiments on synthetic and real-world data, showing that quadratic models have better performance than CP models in scenarios where there are limited amount of observations available

Spectral Sequence Motif Discovery

Sequence discovery tools play a central role in several fields of computational biology. In the framework of Transcription Factor binding studies, motif finding algorithms of increasingly high performance are required to process the big datasets produced by new high-throughput sequencing technologies. Most existing algorithms are computationally demanding and often cannot support the large size of new experimental data. We present a new motif discovery algorithm that is built on a recent machine learning technique, referred to as Method of Moments. Based on spectral decompositions, this method is robust under model misspecification and is not prone to locally optimal solutions. We obtain an algorithm that is extremely fast and designed for the analysis of big sequencing data. In a few minutes, we can process datasets of hundreds of thousand sequences and extract motif profiles that match those computed by various state-of-the-art algorithms.Comment: 20 pages, 3 figures, 1 tabl

Exponential Machines

Modeling interactions between features improves the performance of machine learning solutions in many domains (e.g. recommender systems or sentiment analysis). In this paper, we introduce Exponential Machines (ExM), a predictor that models all interactions of every order. The key idea is to represent an exponentially large tensor of parameters in a factorized format called Tensor Train (TT). The Tensor Train format regularizes the model and lets you control the number of underlying parameters. To train the model, we develop a stochastic Riemannian optimization procedure, which allows us to fit tensors with 2^160 entries. We show that the model achieves state-of-the-art performance on synthetic data with high-order interactions and that it works on par with high-order factorization machines on a recommender system dataset MovieLens 100K.Comment: ICLR-2017 workshop track pape

Coevolutionary dynamics of a variant of the cyclic Lotka-Volterra model with three-agent interactions

We study a variant of the cyclic Lotka-Volterra model with three-agent interactions. Inspired by a multiplayer variation of the Rock-Paper-Scissors game, the model describes an ideal ecosystem in which cyclic competition among three species develops through cooperative predation. Its rate equations in a well-mixed environment display a degenerate Hopf bifurcation, occurring as reactions involving two predators plus one prey have the same rate as reactions involving two preys plus one predator. We estimate the magnitude of the stochastic noise at the bifurcation point, where finite size effects turn neutrally stable orbits into erratically diverging trajectories. In particular, we compare analytic predictions for the extinction probability, derived in the Fokker-Planck approximation, with numerical simulations based on the Gillespie stochastic algorithm. We then extend the analysis of the phase portrait to heterogeneous rates. In a well-mixed environment, we observe a continuum of degenerate Hopf bifurcations, generalizing the above one. Neutral stability ensues from a complex equilibrium between different reactions. Remarkably, on a two-dimensional lattice, all bifurcations disappear as a consequence of the spatial locality of the interactions. In the second part of the paper, we investigate the effects of mobility in a lattice metapopulation model with patches hosting several agents. We find that strategies propagate along the arms of rotating spirals, as they usually do in models of cyclic dominance. We observe propagation instabilities in the regime of large wavelengths. We also examine three-agent interactions inducing nonlinear diffusion.Comment: 22 pages, 13 figures. v2: version accepted for publication in EPJ