Mark A. Iwen
Orcid: 0000-0002-8854-3186
According to our database1,
Mark A. Iwen
authored at least 64 papers
between 2002 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Neural network approximation of continuous functions in high dimensions with applications to inverse problems.
J. Comput. Appl. Math., March, 2024
On Fast Johnson-Lindenstrauss Embeddings of Compact Submanifolds of $\mathbbm {R}^N$ with Boundary.
Discret. Comput. Geom., March, 2024
CoRR, 2024
On Outer Bi-Lipschitz Extensions of Linear Johnson-Lindenstrauss Embeddings of Subsets of R<sup>N</sup>.
CoRR, 2024
2023
Fast and Low-Memory Compressive Sensing Algorithms for Low Tucker-Rank Tensor Approximation from Streamed Measurements.
CoRR, 2023
Tensor Sandwich: Tensor Completion for Low CP-Rank Tensors via Adaptive Random Sampling.
CoRR, 2023
CoRR, 2023
2022
Neural Network Approximation of Lipschitz Functions in High Dimensions with Applications to Inverse Problems.
CoRR, 2022
On Outer Bi-Lipschitz Extensions of Linear Johnson-Lindenstrauss Embeddings of Low-Dimensional Submanifolds of R<sup>N</sup>.
CoRR, 2022
2021
Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares.
SIAM J. Matrix Anal. Appl., 2021
Sparse harmonic transforms II: best s-term approximation guarantees for bounded orthonormal product bases in sublinear-time.
Numerische Mathematik, 2021
Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables.
Found. Comput. Math., 2021
Discret. Comput. Geom., 2021
CoRR, 2021
On Fast Johnson-Lindenstrauss Embeddings of Compact Submanifolds of R<sup>N</sup> with Boundary.
CoRR, 2021
Modewise Operators, the Tensor Restricted Isometry Property, and Low-Rank Tensor Recovery.
CoRR, 2021
Phase Retrieval for L<sup>2</sup>([-π, π]) via the Provably Accurate and Noise Robust Numerical Inversion of Spectrogram Measurements.
CoRR, 2021
Lower Bounds on the Low-Distortion Embedding Dimension of Submanifolds of R<sup>n</sup>.
CoRR, 2021
On the $\ell^\infty$-norms of the Singular Vectors of Arbitrary Powers of a Difference Matrix with Applications to Sigma-Delta Quantization.
CoRR, 2021
A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size.
Adv. Comput. Math., 2021
Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers, 2021
2020
Math. Comput. Simul., 2020
Sparse Fourier Transforms on Rank-1 Lattices for the Rapid and Low-Memory Approximation of Functions of Many Variables.
CoRR, 2020
A Provably Accurate Algorithm for Recovering Compactly Supported Smooth Functions from Spectrogram Measurements.
Proceedings of the 28th European Signal Processing Conference, 2020
2019
Inverting Spectrogram Measurements via Aliased Wigner Distribution Deconvolution and Angular Synchronization.
CoRR, 2019
CoRR, 2019
Adv. Comput. Math., 2019
2018
Extension of PCA to Higher Order Data Structures: An Introduction to Tensors, Tensor Decompositions, and Tensor PCA.
Proc. IEEE, 2018
2017
Numer. Algorithms, 2017
Multi-scale higher order singular value decomposition (MS-HoSVD) for resting-state FMRI compression and analysis.
Proceedings of the 2017 IEEE International Conference on Acoustics, 2017
2016
A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks.
SIAM J. Matrix Anal. Appl., 2016
Technical Report: Improved Fourier Reconstruction using Jump Information with Applications to MRI.
CoRR, 2016
Proceedings of the IEEE Statistical Signal Processing Workshop, 2016
Proceedings of the 50th Asilomar Conference on Signals, Systems and Computers, 2016
2015
Proceedings of the 2015 IEEE Global Conference on Signal and Information Processing, 2015
Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers, 2015
2014
Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data.
IEEE Signal Process. Mag., 2014
Compressed sensing with sparse binary matrices: Instance optimal error guarantees in near-optimal time.
J. Complex., 2014
2013
Improved sparse fourier approximation results: faster implementations and stronger guarantees.
Numer. Algorithms, 2013
CoRR, 2013
2012
IEEE Trans. Signal Process., 2012
On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions.
SIAM J. Matrix Anal. Appl., 2012
CoRR, 2012
A fast multiscale framework for data in high-dimensions: Measure estimation, anomaly detection, and compressive measurements.
Proceedings of the 2012 Visual Communications and Image Processing, 2012
2011
Proceedings of the Conference Record of the Forty Fifth Asilomar Conference on Signals, 2011
2010
2009
Inf. Process. Lett., 2009
Proceedings of the 43rd Annual Conference on Information Sciences and Systems, 2009
Simple deterministically constructible RIP matrices with sublinear fourier sampling requirements.
Proceedings of the 43rd Annual Conference on Information Sciences and Systems, 2009
2008
A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Proceedings of the 24th International Conference on Data Engineering, 2008
Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008
Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers, 2008
2007
Proceedings of the IEEE International Conference on Acoustics, 2007
2002
Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2002), 2002
Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2002), 2002
Automatic Problem Decomposition for Distributed Planning.
Proceedings of the International Conference on Artificial Intelligence, 2002
Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002