arXiv research

This work explores non-negative low-rank matrix factorization based on regularized Poisson models (PF or "Poisson factorization" for short) for recommender systems with implicit-feedback data. The properties of Poisson likelihood allow a shortcut for very fast computations over zero-valued inputs, and oftentimes result…

Study shows how Poisson brackets factor on infinite dimensional manifolds.

A beta-negative binomial (BNB) process is proposed, leading to a beta-gamma-Poisson process, which may be viewed as a "multi-scoop" generalization of the beta-Bernoulli process. The BNB process is augmented into a beta-gamma-gamma-Poisson hierarchical structure, and applied as a nonparametric Bayesian prior for an infi…

Study new involutivity theorems for Poisson quasi-Nijenhuis manifolds.

We develop a Bayesian Poisson matrix factorization model for forming recommendations from sparse user behavior data. These data are large user/item matrices where each user has provided feedback on only a small subset of items, either explicitly (e.g., through star ratings) or implicitly (e.g., through views or purchas…

New method for ordinal data improves recommendation systems.

Poisson factorization is a probabilistic model of users and items for recommendation systems, where the so-called implicit consumer data is modeled by a factorized Poisson distribution. There are many variants of Poisson factorization methods who show state-of-the-art performance on real-world recommendation tasks. How…

Non-negative matrix factorization models based on a hierarchical Gamma-Poisson structure capture user and item behavior effectively in extremely sparse data sets, making them the ideal choice for collaborative filtering applications. Hierarchical Poisson factorization (HPF) in particular has proved successful for scala…

Newsroom in online ecosystem is difficult to untangle. With prevalence of social media, interactions between journalists and individuals become visible, but lack of understanding to inner processing of information feedback loop in public sphere leave most journalists baffled. Can we provide an organized view to charact…

We present a general framework, the coupled compound Poisson factorization (CCPF), to capture the missing-data mechanism in extremely sparse data sets by coupling a hierarchical Poisson factorization with an arbitrary data-generating model. We derive a stochastic variational inference algorithm for the resulting model …

Paper introduces ZIPTF and C-ZIPTF for better tensor factorization of zero-inflated count data.

Models for recommender systems use latent factors to explain the preferences and behaviors of users with respect to a set of items (e.g., movies, books, academic papers). Typically, the latent factors are assumed to be static and, given these factors, the observed preferences and behaviors of users are assumed to be ge…

Flexible models cluster RNA sequencing data.

We present a Bayesian tensor factorization model for inferring latent group structures from dynamic pairwise interaction patterns. For decades, political scientists have collected and analyzed records of the form "country $i$ took action $a$ toward country $j$ at time $t$"---known as dyadic events---in order to form an…

A gamma process dynamic Poisson factor analysis model is proposed to factorize a dynamic count matrix, whose columns are sequentially observed count vectors. The model builds a novel Markov chain that sends the latent gamma random variables at time $(t-1)$ as the shape parameters of those at time $t$, which are linked …

Model-based collaborative filtering analyzes user-item interactions to infer latent factors that represent user preferences and item characteristics in order to predict future interactions. Most collaborative filtering algorithms assume that these latent factors are static, although it has been shown that user preferen…

We present novel understandings of the Gamma-Poisson (GaP) model, a probabilistic matrix factorization model for count data. We show that GaP can be rewritten free of the score/activation matrix. This gives us new insights about the estimation of the topic/dictionary matrix by maximum marginal likelihood estimation. In…

To infer a multilayer representation of high-dimensional count vectors, we propose the Poisson gamma belief network (PGBN) that factorizes each of its layers into the product of a connection weight matrix and the nonnegative real hidden units of the next layer. The PGBN's hidden layers are jointly trained with an upwar…

Let X be a simply connected compact Riemannian symmetric space, let U be the universal covering group of the identity component of the isometry group of X, and let \g denote the complexification of the Lie algebra of U, \g=\u^\C. Each \u-compatible triangular decomposition \g=\n_- + \h + \n_+ determines a Poisson Lie g…

Enhances count process modelling with Markov-modulated non-homogeneous Poisson process.

We study a class of Poisson tensors on a fibered manifold which are compatible with the fiber bundle structure by the so-called almost coupling condition. In the case of a $5$-dimensional orientable fibered manifolds with $2$-dimensional bases, we describe a global behavior of almost coupling Poisson tensors and their …

Count data are often used in recommender systems: they are widespread (song play counts, product purchases, clicks on web pages) and can reveal user preference without any explicit rating from the user. Such data are known to be sparse, over-dispersed and bursty, which makes their direct use in recommender systems chal…

Bayesian hierarchical tensor factorization model for international trade flows

The paper shows deep connections between exotic smoothings of a small R^4 (the spacetime), the leaf space of codimension-1 foliations (related to noncommutative algebras) and quantization. At first we relate a small exotic R^4 to codimension-1 foliations of the 3-sphere unique up to foliated cobordisms and characterize…

A common approach to analyze a covariate-sample count matrix, an element of which represents how many times a covariate appears in a sample, is to factorize it under the Poisson likelihood. We show its limitation in capturing the tendency for a covariate present in a sample to both repeat itself and excite related ones…

We outline the notions and concepts of the calculus of variational multivectors within the Poisson formalism over the spaces of infinite jets of mappings from commutative (non)graded smooth manifolds to the factors of noncommutative associative algebras over the equivalence under cyclic permutations of the letters in t…

Non-negative tensor factorization models enable predictive analysis on count data. Among them, Bayesian Poisson-Gamma models can derive full posterior distributions of latent factors and are less sensitive to sparse count data. However, current inference methods for these Bayesian models adopt restricted update rules f…

A new model BGAR(1) improves temporal NMF for time series data.

Develops data subsampling techniques for Poisson regression models.

New ONMF model minimizes KL divergence for better sparse data modeling.

We study the representation theory of the quantum Teichmueller space when going to infinity in the classical Teichmueller space. The geometric ingredients are the extension of Thurston's shear coordinates to the augmented Teichmueller space and the study of the Weil-Petersson Poisson structure for this extension. The r…

Method estimates exogenous and endogenous factors from event times.

A bandit problem with filtered Poisson process data.

This work extends locally conformal analysis to multi-Hamiltonian settings, providing new geometric structures and Hamiltonian dynamics.

We extend the theory of matrix completion to the case where we make Poisson observations for a subset of entries of a low-rank matrix. We consider the (now) usual matrix recovery formulation through maximum likelihood with proper constraints on the matrix $M$, and establish theoretical upper and lower bounds on the rec…

Proposes a nonparametric tensor factorization for sparse data.

We recall the construction of the Kontsevich graph orientation morphism $γ\mapsto {\rm O\vec{r}}(γ)$ which maps cocycles $γ$ in the non-oriented graph complex to infinitesimal symmetries $\dot{\mathcal{P}} = {\rm O\vec{r}}(γ)(\mathcal{P})$ of Poisson bi-vectors on affine manifolds. We reveal in particular why there alw…

A variety of machine learning tasks---e.g., matrix factorization, topic modelling, and feature allocation---can be viewed as learning the parameters of a probability distribution over bipartite graphs. Recently, a new class of models for networks, the sparse exchangeable graphs, have been introduced to resolve some imp…

We introduce negative binomial matrix factorization (NBMF), a matrix factorization technique specially designed for analyzing over-dispersed count data. It can be viewed as an extension of Poisson matrix factorization (PF) perturbed by a multiplicative term which models exposure. This term brings a degree of freedom fo…

We extend the theory of low-rank matrix recovery and completion to the case when Poisson observations for a linear combination or a subset of the entries of a matrix are available, which arises in various applications with count data. We consider the usual matrix recovery formulation through maximum likelihood with pro…

The paper shows deep connections between exotic smoothings of small R^4, noncommutative algebras of foliations and quantization. At first, based on the close relation of foliations and noncommutative C*-algebras we show that cyclic cohomology invariants characterize some small exotic R^4. Certain exotic smooth R^4's de…

CIBP models feature abundance in latent feature models.

The paper develops new algorithms for KL-divergence NMF, proving convergence and performance.

New method improves credit risk estimation and pricing.

We present a scalable Bayesian model for low-rank factorization of massive tensors with binary observations. The proposed model has the following key properties: (1) in contrast to the models based on the logistic or probit likelihood, using a zero-truncated Poisson likelihood for binary data allows our model to scale …

The paper introduces a model to measure ASR fairness, addressing key issues.

Develops scalable autoencoder for document networks.

We consider a hyperkähler $8$-manifold admitting either a $U(1) \times \mathbb{R}$, or a $U(1) \times U(1)$ action, where the first factor preserves $g$ and $I$, and acts on $ω_2+iω_3$ by multiplying it by itself, while the second factor preserves $g$ and acts triholomorphically. Such data can be reduced to a single fu…