In this paper we consider the Poisson algebraic structure associated with a classical -matrix, i.e. with a solution of the modified classical Yang--Baxter equation. In Section 1 we recall the concept and basic facts of the -matrix type Poisson orbits. Then we describe the -matrix Poisson pencil (i.e the pair o…
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
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 , and establish theoretical upper and lower bounds on the rec…
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…
In this paper, we study the Poisson equation and heat equation in a model matrix geometry . Our main results are about the Poisson equation and global behavior of the heat equation on . We can show that if is the initial positive definite matrix in , then exists for all time and is positive …
We propose a generalization of quantization as a categorical way. For a fixed Poisson algebra quantization categories are defined as subcategories of R-module category with the structure of classical limits. We construct the generalized quantization categories including matrix regularization, strict deformation quantiz…
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…
We reformulate the Poisson structure discovered by Fock and Rosly on moduli spaces of flat connections over marked surfaces in the framework of Poisson structures defined by Lie algebra actions and quasitriangular -matrices, and we show that it is an example of a mixed product Poisson structure associated to pairs o…
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…
Paper connects Stokes phenomena to quantum groups and Poisson-Lie groups.
Any classical r-matrix on the Lie algebra of linear operators on a real vector space V gives rise to a quadratic Poisson structure on V which admits a deformation quantization stemming from the construction of V. Drinfel'd. We exhibit in this article an example of quadratic Poisson structure which does not arise this w…
New method for ordinal data improves recommendation systems.
Derives a Hamiltonian model for 3D axially symmetric magnetohydrodynamics.
This paper describes a fast algorithm for recovering low-rank matrices from their linear measurements contaminated with Poisson noise: the Poisson noise Maximum Likelihood Singular Value thresholding (PMLSV) algorithm. We propose a convex optimization formulation with a cost function consisting of the sum of a likeliho…
Lie bialgebra structures are reviewed and investigated in terms of the double Lie algebra, of Manin- and Gauß-decompositions. The standard R-matrix in a Manin decomposition then gives rise to several Poisson structures on the correponding double group, which is investigated in great detail.
The paper constructs a noncommutative bracket on surface groups and proves it's Hamiltonian.
The study investigates linearizability of Poisson structures on groupoids.
New method preserves MHD equations on sphere without costly matrix exponentials.
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…
Characterizes uncertainty in low-rank matrix completion with noisy data.
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…
In this paper, we explain how generalized dynamical r-matrices can be obtained by (quasi-)Poisson reduction. New examples of Poisson structures and Poisson groupoid actions naturally appear in this setting. As an application, we use a generalized dynamical r-matrix induced by the gauge fixing procedure to give a new fi…
This paper considers the problem of estimating a low-rank matrix from the observation of all or a subset of its entries in the presence of Poisson noise. When we observe all entries, this is a problem of matrix denoising; when we observe only a subset of the entries, this is a problem of matrix completion. In both case…
Given a standard complex semisimple Poisson Lie group , generalised double Bruhat cells and generalised Bruhat cells equipped with naturally defined holomorphic Poisson structures, where u, v are finite sequences of Weyl group elements, were defined and studied by Jiang Hua Lu and the auth…
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…
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 as the shape parameters of those at time , which are linked …
In this paper, we study the effects of different prior and likelihood choices for Bayesian matrix factorisation, focusing on small datasets. These choices can greatly influence the predictive performance of the methods. We identify four groups of approaches: Gaussian-likelihood with real-valued priors, nonnegative prio…
A new model BGAR(1) improves temporal NMF for time series data.
New ONMF model minimizes KL divergence for better sparse data modeling.
The paper defines projective structures for Lie bialgebras and Poisson-Lie groups.
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…
New method reduces inventory inaccuracies by 10x, saving retailers 4% annually.
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 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…
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 propose an algorithm to impute and forecast a time series by transforming the observed time series into a matrix, utilizing matrix estimation to recover missing values and de-noise observed entries, and performing linear regression to make predictions. At the core of our analysis is a representation result, which st…
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 proposes a new approach to optimal transport for vector and matrix densities.
The paper proposes a noncommutative deformation of toric varieties.
The paper develops new algorithms for KL-divergence NMF, proving convergence and performance.
Flexible models cluster RNA sequencing data.
We revisit the theory of Discrete Exterior Calculus (DEC) in 2D for general triangulations, relying only on Vector Calculus and Matrix Algebra. We present DEC numerical solutions of the Poisson equation and compare them against those found using the Finite Element Method with linear elements (FEML).
The performance of the Lasso is well understood under the assumptions of the standard linear model with homoscedastic noise. However, in several applications, the standard model does not describe the important features of the data. This paper examines how the Lasso performs on a non-standard model that is motivated by …
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…
Mixed-precision CA-SGD for generalized linear models on GPUs
We develop a flexible framework for low-rank matrix estimation that allows us to transform noise models into regularization schemes via a simple bootstrap algorithm. Effectively, our procedure seeks an autoencoding basis for the observed matrix that is stable with respect to the specified noise model; we call the resul…
We develop Square Root Graphical Models (SQR), a novel class of parametric graphical models that provides multivariate generalizations of univariate exponential family distributions. Previous multivariate graphical models [Yang et al. 2015] did not allow positive dependencies for the exponential and Poisson generalizat…
IDPGs extend RDPGs with a Poisson process for random latent positions.
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 took action toward country at time "---known as dyadic events---in order to form an…