Adaptive Mollifiers for High Resolution Recovery of Piecewise Smooth Data from its Spectral Information. - Eitan Tadmor; Jared Tanner (Found. Comput. Math., 2002)

Thresholds for the Recovery of Sparse Solutions via L1 Minimization. - David L. Donoho; Jared Tanner (CISS, 2006)

Optimal filter and mollifier for piecewise smooth spectral data. - Jared Tanner (Math. Comput., 2006)

Fast Reconstruction Methods for Bandlimited Functions from Periodic Nonuniform Sampling. - Thomas Strohmer; Jared Tanner (SIAM J. Numer. Anal., 2006)

Fast Reconstruction Algorithms for Periodic Nonuniform Sampling with Applications to Time-Interleaved ADCs. - Thomas Strohmer; Jared Tanner (ICASSP (3), 2007)

Identification of Matrices Having a Sparse Representation. - Götz E. Pfander; Holger Rauhut; Jared Tanner (IEEE Trans. Signal Process., 2008)

Observed Universality of Phase Transitions in High-Dimensional Geometry, with Implications for Modern Data Analysis and Signal Processing - David L. Donoho; Jared Tanner (CoRR, 2009)

Decay Properties of Restricted Isometry Constants. - Jeffrey D. Blanchard; Coralia Cartis; Jared Tanner (IEEE Signal Process. Lett., 2009)

Phase Transitions for Greedy Sparse Approximation Algorithms - Jeffrey D. Blanchard; Coralia Cartis; Jared Tanner; Andrew Thompson 001 (CoRR, 2010)

Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications. - David L. Donoho; Jared Tanner (Discret. Comput. Geom., 2010)

Introduction to the Issue on Compressive Sensing. - Rick Chartrand; Richard G. Baraniuk; Yonina C. Eldar; Mário A. T. Figueiredo; Jared Tanner (IEEE J. Sel. Top. Signal Process., 2010)

Precise Undersampling Theorems. - David L. Donoho; Jared Tanner (Proc. IEEE, 2010)

Improved Bounds on Restricted Isometry Constants for Gaussian Matrices. - Bubacarr Bah; Jared Tanner (SIAM J. Matrix Anal. Appl., 2010)

Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by random sampling. - David L. Donoho; Jared Tanner (IEEE Trans. Inf. Theory, 2010)

Compressed Sensing: How Sharp Is the Restricted Isometry Property? - Jeffrey D. Blanchard; Coralia Cartis; Jared Tanner (SIAM Rev., 2011)

Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices - Bubacarr Bah; Jared Tanner (CoRR, 2012)

Matrix completion algorithms with optimal phase transition. - Jared Tanner; Ke Wei 001 (EUSIPCO, 2013)

On construction and analysis of sparse random matrices and expander graphs with applications to compressed sensing. - Bubacarr Bah; Jared Tanner (CoRR, 2013)

GPU accelerated greedy algorithms for compressed sensing. - Jeffrey D. Blanchard; Jared Tanner (Math. Program. Comput., 2013)

Normalized Iterative Hard Thresholding for Matrix Completion. - Jared Tanner; Ke Wei 001 (SIAM J. Sci. Comput., 2013)

Vanishingly Sparse Matrices and Expander Graphs, With Application to Compressed Sensing. - Bubacarr Bah; Jared Tanner (IEEE Trans. Inf. Theory, 2013)

Expander ℓ0-Decoding. - Rodrigo Mendoza-Smith; Jared Tanner (CoRR, 2015)

Performance comparisons of greedy algorithms in compressed sensing. - Jeffrey D. Blanchard; Jared Tanner (Numer. Linear Algebra Appl., 2015)

Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing. - Jeffrey D. Blanchard; Jared Tanner; Ke Wei 001 (IEEE Trans. Signal Process., 2015)

Non-Negative Super-Resolution is Stable. - Armin Eftekhari; Jared Tanner; Andrew Thompson 001; Bogdan Toader; Hemant Tyagi (DSW, 2018)

Deep CNN Sparse Coding Analysis: Towards Average Case. - Michael Murray; Jared Tanner (DSW, 2018)

Sparse non-negative super-resolution - simplified and stabilised. - Armin Eftekhari; Jared Tanner; Andrew Thompson 001; Bogdan Toader; Hemant Tyagi (CoRR, 2018)

Towards an understanding of CNNs: analysing the recovery of activation pathways via Deep Convolutional Sparse Coding. - Michael Murray; Jared Tanner (CoRR, 2018)

On the Construction of Sparse Matrices From Expander Graphs. - Bubacarr Bah; Jared Tanner (Frontiers Appl. Math. Stat., 2018)

A Robust Parallel Algorithm for Combinatorial Compressed Sensing. - Rodrigo Mendoza-Smith; Jared Tanner; Florian Wechsung (IEEE Trans. Signal Process., 2018)

Multispectral Snapshot Demosaicing Via Non-Convex Matrix Completion. - Giancarlo A. Antonucci; Simon Vary; David Humphreys; Robert A. Lamb; Jonathan Piper; Jared Tanner (DSW, 2019)

Multilspectral snapshot demosaicing via non-convex matrix completion. - Giancarlo A. Antonucci; Simon Vary; David Humphreys; Robert A. Lamb; Jonathan Piper; Jared Tanner (CoRR, 2019)

Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion. - Jared Tanner; Andrew Thompson 001; Simon Vary (SIAM J. Math. Data Sci., 2019)

An Approximate Message Passing Algorithm For Rapid Parameter-Free Compressed Sensing MRI. - Charles Millard; Aaron T. Hess; Boris Mailhé; Jared Tanner (ICIP, 2020)

A Model-Based Derivative-Free Approach to Black-Box Adversarial Examples: BOBYQA. - Giuseppe Ughi; Vinayak Abrol; Jared Tanner (CoRR, 2020)

Approximate Message Passing with a Colored Aliasing Model for Variable Density Fourier Sampled Images. - Charles Millard; Aaron T. Hess; Boris Mailhé; Jared Tanner (CoRR, 2020)

The Permuted Striped Block Model and its Factorization - Algorithms with Recovery Guarantees. - Michael Murray; Jared Tanner (CoRR, 2020)

Compressed sensing of low-rank plus sparse matrices. - Jared Tanner; Simon Vary (CoRR, 2020)

An Empirical Study of Derivative-Free-Optimization Algorithms for Targeted Black-Box Attacks in Deep Neural Networks. - Giuseppe Ughi; Vinayak Abrol; Jared Tanner (CoRR, 2020)

Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offset. - Ilan Price; Jared Tanner (ICML, 2021)

Trajectory growth lower bounds for random sparse deep ReLU networks. - Ilan Price; Jared Tanner (ICMLA, 2021)

Mutual Information of Neural Network Initialisations: Mean Field Approximations. - Jared Tanner; Giuseppe Ughi (ISIT, 2021)

Activation function design for deep networks: linearity and effective initialisation. - Michael Murray; Vinayak Abrol; Jared Tanner (CoRR, 2021)

Tuning-free multi-coil compressed sensing MRI with Parallel Variable Density Approximate Message Passing (P-VDAMP). - Charles Millard; Mark Chiew; Jared Tanner; Aaron T. Hess; Boris Mailhé (CoRR, 2022)

Encoder Blind Combinatorial Compressed Sensing. - Michael Murray; Jared Tanner (IEEE Trans. Inf. Theory, 2022)

Improved Projection Learning for Lower Dimensional Feature Maps. - Ilan Price; Jared Tanner (ICASSP, 2023)

Optimal Approximation Complexity of High-Dimensional Functions with Neural Networks. - Vincent P. H. Goverse; Jad Hamdan; Jared Tanner (CoRR, 2023)

On the Initialisation of Wide Low-Rank Feedforward Neural Networks. - Thiziri Nait Saada; Jared Tanner (CoRR, 2023)

Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs. - Yuxin Zhang 002; Lirui Zhao; Mingbao Lin; Yunyun Sun; Yiwu Yao; Xingjia Han; Jared Tanner; Shiwei Liu 003; Rongrong Ji (ICLR, 2024)

Deep Neural Network Initialization with Sparsity Inducing activations. - Ilan Price; Nicholas Daultry Ball; Adam C. Jones; Samuel C. H. Lam; Jared Tanner (ICLR, 2024)

Beyond IID weights: sparse and low-rank deep Neural Networks are also Gaussian Processes. - Thiziri Nait Saada; Alireza Naderi; Jared Tanner (ICLR, 2024)

Mind the Gap: a Spectral Analysis of Rank Collapse and Signal Propagation in Transformers. - Alireza Naderi; Thiziri Nait Saada; Jared Tanner (CoRR, 2024)