default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Ma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]El Houcine Bergou
, Soumia Boucherouite, Aritra Dutta, Xin Li, Anna Ma:
A Note on the Randomized Kaczmarz Algorithm for Solving Doubly Noisy Linear Systems. SIAM J. Matrix Anal. Appl. 45(2): 992-1006 (2024)- [i23]Hengrui Luo, Anna Ma:
Frontal Slice Approaches for Tensor Linear Systems. CoRR abs/2408.13547 (2024) - [i22]Emeric Battaglia, Anna Ma:
Reverse Quantile-RK and its Application to Quantile-RK. CoRR abs/2410.13395 (2024) - 2023
- [j8]Kathryn Dover, Zixuan Cang, Anna Ma, Qing Nie, Roman Vershynin:
AVIDA: An alternating method for visualizing and integrating data. J. Comput. Sci. 68: 101998 (2023) - [j7]Anna Ma, Dominik Stöger, Yizhe Zhu:
Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches. SIAM J. Matrix Anal. Appl. 44(4): 1566-1588 (2023) - [c11]Rachel Grotheer, Shuang Li, Anna Ma, Deanna Needell, Jing Qin:
Stochastic Natural Thresholding Algorithms. ACSSC 2023: 832-836 - [c10]Jamie Haddock, Anna Ma, Elizaveta Rebrova:
On Subsampled Quantile Randomized Kaczmarz. Allerton 2023: 1-8 - [c9]Chelsea Huynh, Anna Ma, Michael Strand:
Block-missing data in linear systems: An unbiased stochastic gradient descent approach. Allerton 2023: 1-7 - [c8]Anna Ma, Elizabeth Patitsas, Jonathan Sterne:
You Sound Depressed: A Case Study on Sonde Health's Diagnostic Use of Voice Analysis AI. FAccT 2023: 639-650 - [i21]Yin-Ting Liao, Hengrui Luo, Anna Ma:
Efficient and Robust Bayesian Selection of Hyperparameters in Dimension Reduction for Visualization. CoRR abs/2306.00357 (2023) - [i20]Rachel Grotheer, Shuang Li, Anna Ma, Deanna Needell, Jing Qin:
Stochastic Natural Thresholding Algorithms. CoRR abs/2306.04730 (2023) - [i19]Jamie Haddock, Anna Ma, Elizaveta Rebrova:
On Subsampled Quantile Randomized Kaczmarz. CoRR abs/2308.07987 (2023) - [i18]El Houcine Bergou, Soumia Boucherouite, Aritra Dutta, Xin Li, Anna Ma:
A Note on Randomized Kaczmarz Algorithm for Solving Doubly-Noisy Linear Systems. CoRR abs/2308.16904 (2023) - [i17]Chelsea Huynh, Anna Ma, Michael Strand:
Block-missing data in linear systems: An unbiased stochastic gradient descent approach. CoRR abs/2310.10147 (2023) - 2022
- [i16]Kathryn Dover, Zixuan Cang, Anna Ma, Qing Nie, Roman Vershynin:
AVIDA: Alternating method for Visualizing and Integrating Data. CoRR abs/2206.00135 (2022) - [i15]Anna Ma, Dominik Stöger, Yizhe Zhu:
Robust recovery of low-rank matrices and low-tubal-rank tensors from noisy sketches. CoRR abs/2206.00803 (2022) - 2021
- [j6]Jesús A. De Loera, Jamie Haddock, Anna Ma, Deanna Needell:
Data-driven algorithm selection and tuning in optimization and signal processing. Ann. Math. Artif. Intell. 89(7): 711-735 (2021) - [j5]Jamie Haddock, Anna Ma:
Greed Works: An Improved Analysis of Sampling Kaczmarz-Motzkin. SIAM J. Math. Data Sci. 3(1): 342-368 (2021) - [i14]Eric Lybrand, Anna Ma, Rayan Saab:
On the Number of Faces and Radii of Cells Induced by Gaussian Spherical Tessellations. CoRR abs/2108.13523 (2021) - 2020
- [c7]Rachel Grotheer, Shuang Li, Anna Ma, Deanna Needell, Jing Qin:
Stochastic Iterative Hard Thresholding for Low-Tucker-Rank Tensor Recovery. ITA 2020: 1-5 - [i13]Anna Ma, Denali Molitor:
Randomized Kaczmarz for Tensor Linear Systems. CoRR abs/2006.01246 (2020)
2010 – 2019
- 2019
- [j4]Anna Ma, You Joe Zhou, Cynthia Rush, Dror Baron, Deanna Needell:
An Approximate Message Passing Framework for Side Information. IEEE Trans. Signal Process. 67(7): 1875-1888 (2019) - [c6]Natalie Durgin, Rachel Grotheer, Chenxi Huang, Shuang Li, Anna Ma, Deanna Needell, Jing Qin:
Jointly Sparse Signal Recovery with Prior Info. ACSSC 2019: 645-649 - [c5]Natalie Durgin, Rachel Grotheer, Chenxi Huang, Shuang Li, Anna Ma, Deanna Needell, Jing Qin:
Fast Hyperspectral Diffuse Optical Imaging Method with Joint Sparsity. EMBC 2019: 4758-4761 - [i12]Jesús A. De Loera, Jamie Haddock, Anna Ma, Deanna Needell:
Data-driven Algorithm Selection and Parameter Tuning: Two Case studies in Optimization and Signal Processing. CoRR abs/1905.13404 (2019) - [i11]Rachel Grotheer, Shuang Li, Anna Ma, Deanna Needell, Jing Qin:
Iterative Hard Thresholding for Low CP-rank Tensor Models. CoRR abs/1908.08479 (2019) - [i10]Rachel Grotheer, Shuang Li, Anna Ma, Deanna Needell, Jing Qin:
Stochastic Iterative Hard Thresholding for Low-Tucker-Rank Tensor Recovery. CoRR abs/1909.10132 (2019) - [i9]Jamie Haddock, Anna Ma:
Greed Works: An Improved Analysis of Sampling Kaczmarz-Motkzin. CoRR abs/1912.03544 (2019) - 2018
- [j3]Yves van Gennip, Blake Hunter, Anna Ma, Daniel Moyer, Ryan de Vera, Andrea L. Bertozzi:
Unsupervised record matching with noisy and incomplete data. Int. J. Data Sci. Anal. 6(2): 109-129 (2018) - [j2]Anna Ma, Deanna Needell, Aaditya Ramdas:
Iterative Methods for Solving Factorized Linear Systems. SIAM J. Matrix Anal. Appl. 39(1): 104-122 (2018) - [c4]Anna Ma, Deanna Needell:
A Gradient Descent Approach for Incomplete Linear Systems. ACSSC 2018: 764-768 - [c3]Saiprasad Ravishankar, Anna Ma, Deanna Needell:
Analysis of Fast Alternating Minimization for Structured Dictionary Learning. ITA 2018: 1-9 - [i8]Natalie Durgin, Rachel Grotheer, Chenxi Huang, Shuang Li, Anna Ma, Deanna Needell, Jing Qin:
Compressed Anomaly Detection with Multiple Mixed Observations. CoRR abs/1801.10264 (2018) - [i7]Saiprasad Ravishankar, Anna Ma, Deanna Needell:
Analysis of Fast Alternating Minimization for Structured Dictionary Learning. CoRR abs/1802.00518 (2018) - [i6]Saiprasad Ravishankar, Anna Ma, Deanna Needell:
Analysis of Fast Structured Dictionary Learning. CoRR abs/1805.12529 (2018) - [i5]Anna Ma, You Joe Zhou, Cynthia Rush, Dror Baron, Deanna Needell:
An Approximate Message Passing Framework for Side Information. CoRR abs/1807.04839 (2018) - 2017
- [c2]Dror Baron, Anna Ma, Deanna Needell, Cynthia Rush, Tina Woolf:
Conditional approximate message passing with side information. ACSSC 2017: 430-434 - [i4]Yves van Gennip, Blake Hunter, Anna Ma, Daniel Moyer, Ryan de Vera, Andrea L. Bertozzi:
Unsupervised record matching with noisy and incomplete data. CoRR abs/1704.02955 (2017) - [i3]Jing Qin, Shuang Li, Deanna Needell, Anna Ma, Rachel Grotheer, Chenxi Huang, Natalie Durgin:
Stochastic Greedy Algorithms For Multiple Measurement Vectors. CoRR abs/1711.01521 (2017) - [i2]Natalie Durgin, Rachel Grotheer, Chenxi Huang, Shuang Li, Anna Ma, Deanna Needell, Jing Qin:
Sparse Randomized Kaczmarz for Support Recovery of Jointly Sparse Corrupted Multiple Measurement Vectors. CoRR abs/1711.02743 (2017) - 2015
- [j1]Anna Ma, Deanna Needell, Aaditya Ramdas:
Convergence Properties of the Randomized Extended Gauss-Seidel and Kaczmarz Methods. SIAM J. Matrix Anal. Appl. 36(4): 1590-1604 (2015) - 2014
- [c1]Anna Ma, Arjuna Flenner, Deanna Needell, Allon G. Percus:
Improving image clustering using sparse text and the wisdom of the crowds. ACSSC 2014: 1555-1557 - [i1]Anna Ma, Arjuna Flenner, Deanna Needell, Allon G. Percus:
Improving Image Clustering using Sparse Text and the Wisdom of the Crowds. CoRR abs/1405.2102 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-04 21:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
