Research
On-device research index

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.

168,695 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Dec 199319922001200920172026
48 results for Poisson matrix

In this paper we consider the Poisson algebraic structure associated with a classical rr-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 rr-matrix type Poisson orbits. Then we describe the rr-matrix Poisson pencil (i.e the pair o…

1998-12-25abs ↗pdf ↗

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 MM, and establish theoretical upper and lower bounds on the rec…

2015-01-26abs ↗pdf ↗

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…

2015-04-20abs ↗pdf ↗

In this paper, we study the Poisson equation and heat equation in a model matrix geometry MnM_n. Our main results are about the Poisson equation and global behavior of the heat equation on MnM_n. We can show that if c0c_0 is the initial positive definite matrix in MnM_n, then c(t)c(t) exists for all time and is positive …

2013-11-21abs ↗pdf ↗

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…

2019-07-19abs ↗pdf ↗

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…

2013-11-07abs ↗pdf ↗

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…

2018-01-05abs ↗pdf ↗

Paper connects Stokes phenomena to quantum groups and Poisson-Lie groups.

problem Analyse Stokes phenomena in Poisson-Lie groups and quantum groups.
method Use Ug-valued Stokes phenomena to construct quantum group U_hg and relate it to Poisson-Lie group G*.
result Show that Ug-valued Stokes phenomena can be obtained as a semiclassical limit of the KZ associator.

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…

2001-05-09abs ↗pdf ↗

Derives a Hamiltonian model for 3D axially symmetric magnetohydrodynamics.

problem Modeling of 3D axially symmetric magnetohydrodynamics.
method Hamiltonian formulation and matrix discretization.
result First discrete model for 3D magnetohydrodynamics compatible with underlying Lie-Poisson structure.

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…

2014-07-02abs ↗pdf ↗

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.

1998-01-07abs ↗pdf ↗

The study investigates linearizability of Poisson structures on groupoids.

problem Linearizing Poisson structures on groupoids around the unit section.
method Extending the Lagrangian neighbourhood theorem to cosymplectic Lie algebroids, integrating triangular Lie bialgebras to symplectic LA-groupoids.
result Poisson structures on groupoids are linearizable under certain conditions.

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…

2011-12-15abs ↗pdf ↗

Characterizes uncertainty in low-rank matrix completion with noisy data.

problem Uncertainty quantification in low-rank matrix completion with heterogeneous sub-exponential noise.
method Characterizes the distribution of estimated matrix entries under low-rank estimators with heterogeneous sub-exponential noise.
result Explicit formulas for the distribution of estimated matrix entries under Poisson and Binary noise.

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…

2019-07-11abs ↗pdf ↗

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 (t1)(t-1) as the shape parameters of those at time tt, which are linked …

2015-12-30abs ↗pdf ↗

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

problem Temporal NMF models lack a well-defined stationary distribution.
method Introduced a new Gamma Markov chain model BGAR(1) to overcome the limitation of previous models.
result BGAR(1) model has a well-defined stationary distribution.

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

problem Clustering and data modeling with sparse vectors.
method Developed KL-ONMF algorithm based on alternating optimization.
result KL-ONMF outperforms Frobenius-norm ONMF for document classification and hyperspectral image unmixing.

The paper defines projective structures for Lie bialgebras and Poisson-Lie groups.

problem Defining projective analogues of Lie bialgebras and Poisson-Lie groups.
method Introducing projective tensor products and adapting classical notions to these structures.
result Every quasi-triangular projective r-matrix gives rise to a projective Banach Lie bialgebra.

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…

2016-04-13abs ↗pdf ↗

New method reduces inventory inaccuracies by 10x, saving retailers 4% annually.

problem Inaccurate inventory records cost retailers 4% annually, and manual detection is impractical.
method Proposes a new anomaly detection method for low-rank Poisson matrices using cross-sectional data.
result Our approach reduces anomaly detection costs by up to 10x compared to existing methods.

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…

2016-08-17abs ↗pdf ↗

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…

2018-01-05abs ↗pdf ↗

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…

2018-02-25abs ↗pdf ↗

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 …

2017-01-09abs ↗pdf ↗

Paper proposes a new approach to optimal transport for vector and matrix densities.

problem Optimal transport for vector and matrix densities with positivity and action transitivity constraints.
method Gauge-theoretic approach using semi-direct product groups of diffeomorphisms and gauge transformations.
result Bures-type metrics on semi-direct product groups relate to Wasserstein-type metrics on vector and matrix densities via Riemannian submersions.

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

problem Improving NMF for nonnegative data with KL divergence.
method Collect and analyze properties of KL objective function, propose and test new algorithms.
result Guaranteed non-increasing objective function for one proposed algorithm, global convergence.

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 …

2010-11-03abs ↗pdf ↗

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…

2015-11-06abs ↗pdf ↗

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…

2014-10-30abs ↗pdf ↗