Anna Ma

Orcid: 0000-0002-1650-6917

According to our database1, Anna Ma authored at least 31 papers between 2014 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches.
SIAM J. Matrix Anal. Appl., December, 2023

AVIDA: An alternating method for visualizing and integrating data.
J. Comput. Sci., April, 2023

A Note on Randomized Kaczmarz Algorithm for Solving Doubly-Noisy Linear Systems.
CoRR, 2023

Efficient and Robust Bayesian Selection of Hyperparameters in Dimension Reduction for Visualization.
CoRR, 2023

You Sound Depressed: A Case Study on Sonde Health's Diagnostic Use of Voice Analysis AI.
Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, 2023

Block-missing data in linear systems: An unbiased stochastic gradient descent approach.
Proceedings of the 59th Annual Allerton Conference on Communication, 2023

On Subsampled Quantile Randomized Kaczmarz.
Proceedings of the 59th Annual Allerton Conference on Communication, 2023

Stochastic Natural Thresholding Algorithms.
Proceedings of the 57th Asilomar Conference on Signals, Systems, and Computers, ACSSC 2023, Pacific Grove, CA, USA, October 29, 2023

2022
AVIDA: Alternating method for Visualizing and Integrating Data.
CoRR, 2022

2021
Greed Works: An Improved Analysis of Sampling Kaczmarz-Motzkin.
SIAM J. Math. Data Sci., 2021

On the Number of Faces and Radii of Cells Induced by Gaussian Spherical Tessellations.
CoRR, 2021

Data-driven algorithm selection and tuning in optimization and signal processing.
Ann. Math. Artif. Intell., 2021

2020
Randomized Kaczmarz for Tensor Linear Systems.
CoRR, 2020

Stochastic Iterative Hard Thresholding for Low-Tucker-Rank Tensor Recovery.
Proceedings of the Information Theory and Applications Workshop, 2020

2019
An Approximate Message Passing Framework for Side Information.
IEEE Trans. Signal Process., 2019

Greed Works: An Improved Analysis of Sampling Kaczmarz-Motkzin.
CoRR, 2019

Iterative Hard Thresholding for Low CP-rank Tensor Models.
CoRR, 2019

Data-driven Algorithm Selection and Parameter Tuning: Two Case studies in Optimization and Signal Processing.
CoRR, 2019

Fast Hyperspectral Diffuse Optical Imaging Method with Joint Sparsity.
Proceedings of the 41st Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2019

Jointly Sparse Signal Recovery with Prior Info.
Proceedings of the 53rd Asilomar Conference on Signals, Systems, and Computers, 2019

2018
Iterative Methods for Solving Factorized Linear Systems.
SIAM J. Matrix Anal. Appl., 2018

Unsupervised record matching with noisy and incomplete data.
Int. J. Data Sci. Anal., 2018

Analysis of Fast Structured Dictionary Learning.
CoRR, 2018

Compressed Anomaly Detection with Multiple Mixed Observations.
CoRR, 2018

Analysis of Fast Alternating Minimization for Structured Dictionary Learning.
Proceedings of the 2018 Information Theory and Applications Workshop, 2018

A Gradient Descent Approach for Incomplete Linear Systems.
Proceedings of the 52nd Asilomar Conference on Signals, Systems, and Computers, 2018

2017
Sparse Randomized Kaczmarz for Support Recovery of Jointly Sparse Corrupted Multiple Measurement Vectors.
CoRR, 2017

Stochastic Greedy Algorithms For Multiple Measurement Vectors.
CoRR, 2017

Conditional approximate message passing with side information.
Proceedings of the 51st Asilomar Conference on Signals, Systems, and Computers, 2017

2015
Convergence Properties of the Randomized Extended Gauss-Seidel and Kaczmarz Methods.
SIAM J. Matrix Anal. Appl., 2015

2014
Improving image clustering using sparse text and the wisdom of the crowds.
Proceedings of the 48th Asilomar Conference on Signals, Systems and Computers, 2014


  Loading...