Praneeth Narayanamurthy

Orcid: 0000-0002-5761-7357

According to our database1, Praneeth Narayanamurthy authored at least 26 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Column-Based Matrix Approximation with Quasi-Polynomial Structure.
Proceedings of the IEEE International Conference on Acoustics, 2023

2022
Federated Over-Air Subspace Tracking From Incomplete and Corrupted Data.
IEEE Trans. Signal Process., 2022

Uncertainty-Based Non-Parametric Active Peak Detection.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Federated Over-Air Robust Subspace Tracking from Missing Data.
Proceedings of the IEEE International Conference on Acoustics, 2022

2020
Provable Low Rank Phase Retrieval.
IEEE Trans. Inf. Theory, 2020

Fast Robust Subspace Tracking via PCA in Sparse Data-Dependent Noise.
IEEE J. Sel. Areas Inf. Theory, 2020

Federated Over-the-Air Subspace Learning from Incomplete Data.
CoRR, 2020

2019
Provable Subspace Tracking From Missing Data and Matrix Completion.
IEEE Trans. Signal Process., 2019

Provable Dynamic Robust PCA or Robust Subspace Tracking.
IEEE Trans. Inf. Theory, 2019

Phaseless Low Rank Matrix Recovery and Subspace Tracking.
CoRR, 2019

Provable Subspace Tracking with Missing Entries.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Phaseless PCA: Low-Rank Matrix Recovery from Column-wise Phaseless Measurements.
Proceedings of the 36th International Conference on Machine Learning, 2019

Provable Memory-efficient Online Robust Matrix Completion.
Proceedings of the IEEE International Conference on Acoustics, 2019

2018
Robust Subspace Learning: Robust PCA, Robust Subspace Tracking, and Robust Subspace Recovery.
IEEE Signal Process. Mag., 2018

Static and Dynamic Robust PCA and Matrix Completion: A Review.
Proc. IEEE, 2018

Subspace Tracking from Missing and Outlier Corrupted Data.
CoRR, 2018

Static and Dynamic Robust PCA via Low-Rank + Sparse Matrix Decomposition: A Review.
CoRR, 2018

Robust PCA and Robust Subspace Tracking: A Comparative Evaluation.
Proceedings of the 2018 IEEE Statistical Signal Processing Workshop, 2018

PCA in Sparse Data-Dependent Noise.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Nearly Optimal Robust Subspace Tracking.
Proceedings of the 35th International Conference on Machine Learning, 2018

A Fast and Memory-Efficient Algorithm for Robust PCA (MEROP).
Proceedings of the 2018 IEEE International Conference on Acoustics, 2018

Nearly Optimal Robust Subspace Tracking: A Unified Approach.
Proceedings of the 2018 IEEE Data Science Workshop, 2018

2017
MEDRoP: Memory-Efficient Dynamic Robust PCA.
CoRR, 2017

Robust PCA and Robust Subspace Tracking.
CoRR, 2017

New Results for Provable Dynamic Robust PCA.
CoRR, 2017

Finite sample guarantees for PCA in non-isotropic and data-dependent noise.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017


  Loading...