mlsanityData to 7 Oct 2026

Zero-Truncated Poisson Regression for Sparse Multiway Count Data Corrupted by False Zeros

arXiv 2201.10014 ↗First posted 25 Jan 2022stat.ME cs.MS cs.NAcited by 3

Not on the map. Why?

Abstract (arXiv)

We propose a novel statistical inference methodology for multiway count data that is corrupted by false zeros that are indistinguishable from true zero counts. Our approach consists of zero-truncating the Poisson distribution to neglect all zero values. This simple truncated approach dispenses with the need to distinguish between true and false zero counts and reduces the amount of data to be processed. Inference is accomplished via tensor completion that imposes low-rank tensor structure on the Poisson parameter space. Our main result shows that an N-way rank-R parametric tensor boldsymbolmathscrM∈(0,∞)I× cdots× I generating Poisson observations can be accurately estimated by zero-truncated Poisson regression from approximately IR2log22(I) non-zero counts under the nonnegative canonical polyadic decomposition. Our result also quantifies the error made by zero-truncating the Poisson distribution when the parameter is uniformly bounded from below. Therefore, under a low-rank multiparameter model, we propose an implementable approach guaranteed to achieve accurate regression in under-determined scenarios with substantial corruption by false zeros. Several numerical experiments are presented to explore the theoretical results.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 18 of its 56 references that are in the map. First posted on arXiv 25 Jan 2022.

Builds on

18 of 56 references.

References · 18

  1. 2019Text Classification Algorithms: A Surveycited by 163
  2. 2020Top2Vec: Distributed Representations of Topicscited by 124
  3. 2019Nonconvex Low-Rank Tensor Completion from Noisy Datacited by 35
  4. 2018Generalized Canonical Polyadic Tensor Decompositioncited by 34
  5. 2014On Tensor Completion via Nuclear Norm Minimizationcited by 32
  6. 2014Provable Tensor Factorization with Missing Datacited by 31
  7. 2016Spectral algorithms for tensor completioncited by 27
  8. 2015Infinite Edge Partition Models for Overlapping Community Detection and Link Predictioncited by 23
  9. 2013Low-Rank Matrix and Tensor Completion via Adaptive Samplingcited by 19
  10. 2019Stochastic Gradients for Large-Scale Tensor Decompositioncited by 16
  11. 2019Real-time 3D reconstruction from single-photon lidar data using plug-and-play point cloud denoiserscited by 14
  12. 2018Learning tensors from partial binary measurementscited by 13
6 more
  1. 2018Variational inference for sparse network reconstruction from count datacited by 12
  2. 2016Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completioncited by 10
  3. 2015Poisson Matrix Recovery and Completioncited by 9
  4. 2017Near-optimal sample complexity for convex tensor completioncited by 9
  5. 2021Nonnegative Tensor Completion via Integer Optimizationcited by 4
  6. 2015Zero-Truncated Poisson Tensor Factorization for Massive Binary Tensorscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 1; 2026: 1.

3 papers.