Under-Counted Tensor Completion with Neural Incorporation of Attributes
Not on the map. Why?
Abstract (arXiv)
Systematic under-counting effects are observed in data collected across many disciplines, e.g., epidemiology and ecology. Under-counted tensor completion (UC-TC) is well-motivated for many data analytics tasks, e.g., inferring the case numbers of infectious diseases at unobserved locations from under-counted case numbers in neighboring regions. However, existing methods for similar problems often lack supports in theory, making it hard to understand the underlying principles and conditions beyond empirical successes. In this work, a low-rank Poisson tensor model with an expressive unknown nonlinear side information extractor is proposed for under-counted multi-aspect data. A joint low-rank tensor completion and neural network learning algorithm is designed to recover the model. Moreover, the UC-TC formulation is supported by theoretical analysis showing that the fully counted entries of the tensor and each entry's under-counting probability can be provably recovered from partial observations -- under reasonable conditions. To our best knowledge, the result is the first to offer theoretical supports for under-counted multi-aspect data completion. Simulations and real-data experiments corroborate the theoretical claims.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 23 of its 79 references that are in the map. First posted on arXiv 5 Jun 2023.
Builds on
23 of 79 references.
References · 23
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2021Convex optimizationcited by 2,479
- 2019TuckER: Tensor Factorization for Knowledge Graph Completioncited by 290
- 2015Exact tensor completion using t-SVDcited by 70
- 2015Modeling User Exposure in Recommendationcited by 69
- 2017Hyperspectral Image Restoration via Total Variation Regularized Low-rank Tensor Decompositioncited by 61
- 2013Square Deal: Lower Bounds and Improved Relaxations for Tensor Recoverycited by 37
- 2014On Tensor Completion via Nuclear Norm Minimizationcited by 32
- 2016Spectral algorithms for tensor completioncited by 27
- 2019Generalization Bounds for Convolutional Neural Networkscited by 21
- 2015Bayesian Poisson Tensor Factorization for Inferring Multilateral Relations from Sparse Dyadic Event Countscited by 19
- 2019Spectrum Cartography via Coupled Block-Term Tensor Decompositioncited by 18
11 more
- 2020Computing Large-Scale Matrix and Tensor Decomposition with Structured Factors: A Unified Nonconvex Optimization Perspectivecited by 14
- 2018Learning tensors from partial binary measurementscited by 13
- 2019Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorizationcited by 12
- 2020Hyperspectral Super-Resolution via Interpretable Block-Term Tensor Modelingcited by 10
- 2015Poisson Matrix Recovery and Completioncited by 9
- 2020Tensor denoising and completion based on ordinal observationscited by 8
- 2019Tensor Completion from Regular Sub-Nyquist Samplescited by 7
- 2019Link Prediction Under Imperfect Detection: Collaborative Filtering for Ecological Networkscited by 4
- 2021Stochastic Mirror Descent for Low-Rank Tensor Decomposition Under Non-Euclidean Lossescited by 4
- 2017Probabilistic Count Matrix Factorization for Single Cell Expression Data Analysiscited by 2
- 2017Bayesian Markov Switching Tensor Regression for Time-varying Networkscited by 2
Built on by
Citing papers per year: 2024: 1.
1 paper.