Under-Counted Matrix Completion Without Detection Features
Under-counted matrix completion (UC-MC) has many important applications, especially in epidemiology and ecology where the observed data are often smaller than the actual numbers. Existing works model the under-counting effects using entry-wise miss detection probabilities, which are usually formulated as functions of detection-related side information or features (e.g., weather conditions for observing a certain species). However, such features are not always available. This work proposes a model for UC-MC that circumvents using such side information. By assuming that the detection probabilities for a large proportion of entries are similar, the under-counting probabilities are approximated by a specially structured (i.e., rank-one plus sparse) matrix. This way, a structure-regularized UC-MC formulation is attained, and no detection-related side information is used. A re-parameterization-based implementation is proposed, allowing us to employ off-the-shelf gradient-based optimizers to tackle the loss function of interest. Simulations are used to demonstrate the effectiveness of the proposed approach.
Authors
- Shahana Ibrahim (ORCID: https://orcid.org/0000-0003-1951-5234)
- Xiao Fu (ORCID: https://orcid.org/0000-0003-4847-9586)
- Tri Nguyen (ORCID: https://orcid.org/0000-0003-1986-9841)
- Rebecca Hutchinson (ORCID: https://orcid.org/0000-0003-3816-7394)
Institutions
- University of Central Florida (US)
- Oregon State University (US)
Publication Details
- Published
- 2025-03-12
- DOI
- https://doi.org/10.1109/icassp49660.2025.10888717
- Primary Topic
- Neural Networks and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation