Accession Number:

ADA595375

Title:

Distributed Matrix Completion: Application to Cooperative Positioning in Noisy Environments

Descriptive Note:

Final rept. Jul 2010-Dec 2013

Corporate Author:

STANFORD UNIV CA

Personal Author(s):

Report Date:

2013-12-11

Pagination or Media Count:

7.0

Abstract:

The PI and collaborators developed novel algorithms for positioning, building on earlier developments in matrix completion and high-dimensional statistics. In particular, a distributed version of matrix completion-based positioning, and a gossip version of low-rank approximation were developed. A convex relaxation for positioning in the presence of noise was shown to be constant-optimal. Additional contributions were made in several other areas Finding dense substructures of large networks in nearly linear time Approximate message passing algorithms and in particular their application to spatially-coupled compressed sensing Measures of statistical significance in high dimension.

Subject Categories:

  • Statistics and Probability
  • Cybernetics
  • Miscellaneous Detection and Detectors

Distribution Statement:

APPROVED FOR PUBLIC RELEASE