Jared Tanner

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 38

Top Topics

Compressed Sensing

Gaussian Process

Message Passing

Top Venues

IEEE Trans. Signal Process.

Publications

Ilan Price, Nicholas Daultry Ball, Adam C. Jones, Samuel C. H. Lam, Jared Tanner
Deep Neural Network Initialization with Sparsity Inducing activations. ICLR (2024)
Ilan Price, Nicholas Daultry Ball, Samuel C. H. Lam, Adam C. Jones, Jared Tanner
Deep Neural Network Initialization with Sparsity Inducing Activations. CoRR (2024)
Yuxin Zhang, Lirui Zhao, Mingbao Lin, Yunyun Sun, Yiwu Yao, Xingjia Han, Jared Tanner, Shiwei Liu, Rongrong Ji
Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs. ICLR (2024)
Thiziri Nait Saada, Alireza Naderi, Jared Tanner
Beyond IID weights: sparse and low-rank deep Neural Networks are also Gaussian Processes. ICLR (2024)
Thiziri Nait Saada, Jared Tanner
On the Initialisation of Wide Low-Rank Feedforward Neural Networks. CoRR (2023)
Ilan Price, Jared Tanner
Improved Projection Learning for Lower Dimensional Feature Maps. ICASSP (2023)
Thiziri Nait Saada, Alireza Naderi, Jared Tanner
Beyond IID weights: sparse and low-rank deep Neural Networks are also Gaussian Processes. CoRR (2023)
Vincent P. H. Goverse, Jad Hamdan, Jared Tanner
Optimal Approximation Complexity of High-Dimensional Functions with Neural Networks. CoRR (2023)
Yuxin Zhang, Lirui Zhao, Mingbao Lin, Yunyun Sun, Yiwu Yao, Xingjia Han, Jared Tanner, Shiwei Liu, Rongrong Ji
Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs. CoRR (2023)
Ilan Price, Jared Tanner
Improved Projection Learning for Lower Dimensional Feature Maps. CoRR (2022)
Michael Murray, Jared Tanner
Encoder Blind Combinatorial Compressed Sensing. IEEE Trans. Inf. Theory 68 (12) (2022)
Charles Millard, Mark Chiew, Jared Tanner, Aaron T. Hess, Boris Mailhé
Tuning-free multi-coil compressed sensing MRI with Parallel Variable Density Approximate Message Passing (P-VDAMP). CoRR (2022)
Ilan Price, Jared Tanner
Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offset. ICML (2021)
Jared Tanner, Giuseppe Ughi
Mutual Information of Neural Network Initialisations: Mean Field Approximations. ISIT (2021)
Jared Tanner, Giuseppe Ughi
Mutual Information of Neural Network Initialisations: Mean Field Approximations. CoRR (2021)
Ilan Price, Jared Tanner
Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offset. CoRR (2021)
Ilan Price, Jared Tanner
Trajectory growth lower bounds for random sparse deep ReLU networks. ICMLA (2021)
Michael Murray, Vinayak Abrol, Jared Tanner
Activation function design for deep networks: linearity and effective initialisation. CoRR (2021)
Charles Millard, Aaron T. Hess, Boris Mailhé, Jared Tanner
Approximate Message Passing with a Colored Aliasing Model for Variable Density Fourier Sampled Images. CoRR (2020)
Michael Murray, Jared Tanner
The Permuted Striped Block Model and its Factorization - Algorithms with Recovery Guarantees. CoRR (2020)
Charles Millard, Aaron T. Hess, Boris Mailhé, Jared Tanner
An Approximate Message Passing Algorithm For Rapid Parameter-Free Compressed Sensing MRI. ICIP (2020)
Jared Tanner, Simon Vary
Compressed sensing of low-rank plus sparse matrices. CoRR (2020)
Giuseppe Ughi, Vinayak Abrol, Jared Tanner
An Empirical Study of Derivative-Free-Optimization Algorithms for Targeted Black-Box Attacks in Deep Neural Networks. CoRR (2020)
Giuseppe Ughi, Vinayak Abrol, Jared Tanner
A Model-Based Derivative-Free Approach to Black-Box Adversarial Examples: BOBYQA. CoRR (2020)
Charles Millard, Aaron T. Hess, Boris Mailhé, Jared Tanner
An Approximate Message Passing Algorithm for Rapid Parameter-Free Compressed Sensing MRI. CoRR (2019)
Giancarlo A. Antonucci, Simon Vary, David Humphreys, Robert A. Lamb, Jonathan Piper, Jared Tanner
Multispectral Snapshot Demosaicing Via Non-Convex Matrix Completion. DSW (2019)
Jared Tanner, Andrew Thompson, Simon Vary
Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion. SIAM J. Math. Data Sci. 1 (3) (2019)
Giancarlo A. Antonucci, Simon Vary, David Humphreys, Robert A. Lamb, Jonathan Piper, Jared Tanner
Multilspectral snapshot demosaicing via non-convex matrix completion. CoRR (2019)
Ilan Price, Jared Tanner
Trajectory growth lower bounds for random sparse deep ReLU networks. CoRR (2019)
Armin Eftekhari, Jared Tanner, Andrew Thompson, Bogdan Toader, Hemant Tyagi
Non-Negative Super-Resolution is Stable. DSW (2018)
Michael Murray, Jared Tanner
Towards an understanding of CNNs: analysing the recovery of activation pathways via Deep Convolutional Sparse Coding. CoRR (2018)
Michael Murray, Jared Tanner
Deep CNN Sparse Coding Analysis: Towards Average Case. DSW (2018)
Jared Tanner, Andrew Thompson, Simon Vary
Matrix rigidity and the ill-posedness of Robust PCA and matrix completion. CoRR (2018)
Rodrigo Mendoza-Smith, Jared Tanner, Florian Wechsung
A Robust Parallel Algorithm for Combinatorial Compressed Sensing. IEEE Trans. Signal Process. 66 (8) (2018)
Armin Eftekhari, Jared Tanner, Andrew Thompson, Bogdan Toader, Hemant Tyagi
Sparse non-negative super-resolution - simplified and stabilised. CoRR (2018)
Bubacarr Bah, Jared Tanner
On the Construction of Sparse Matrices From Expander Graphs. Frontiers Appl. Math. Stat. 4 (2018)
Bubacarr Bah, Jared Tanner
On the construction of sparse matrices from expander graphs. CoRR (2018)
Rodrigo Mendoza-Smith, Jared Tanner, Florian Wechsung
A robust parallel algorithm for combinatorial compressed sensing. CoRR (2017)
Jeffrey D. Blanchard, Jared Tanner
Performance comparisons of greedy algorithms in compressed sensing. Numer. Linear Algebra Appl. 22 (2) (2015)
Rodrigo Mendoza-Smith, Jared Tanner
-Decoding. CoRR (2015)
Jeffrey D. Blanchard, Jared Tanner, Ke Wei
Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing. IEEE Trans. Signal Process. 63 (2) (2015)
Jared Tanner, Ke Wei
Matrix completion algorithms with optimal phase transition. EUSIPCO (2013)
Bubacarr Bah, Jared Tanner
Vanishingly Sparse Matrices and Expander Graphs, With Application to Compressed Sensing. IEEE Trans. Inf. Theory 59 (11) (2013)
Bubacarr Bah, Jared Tanner
On construction and analysis of sparse random matrices and expander graphs with applications to compressed sensing. CoRR (2013)
Jared Tanner, Ke Wei
Normalized Iterative Hard Thresholding for Matrix Completion. SIAM J. Sci. Comput. 35 (5) (2013)
Jeffrey D. Blanchard, Jared Tanner
GPU accelerated greedy algorithms for compressed sensing. Math. Program. Comput. 5 (3) (2013)
Bubacarr Bah, Jared Tanner
Vanishingly Sparse Matrices and Expander Graphs, with application to compressed sensing CoRR (2012)
Bubacarr Bah, Jared Tanner
Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices CoRR (2012)
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner
Compressed Sensing: How Sharp Is the Restricted Isometry Property? SIAM Rev. 53 (1) (2011)
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner, Andrew Thompson
Phase Transitions for Greedy Sparse Approximation Algorithms CoRR (2010)
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner
Compressed Sensing: How sharp is the Restricted Isometry Property CoRR (2010)
Bubacarr Bah, Jared Tanner
Improved Bounds on Restricted Isometry Constants for Gaussian Matrices CoRR (2010)
David L. Donoho, Jared Tanner
Precise Undersampling Theorems. Proc. IEEE 98 (6) (2010)
Rick Chartrand, Richard G. Baraniuk, Yonina C. Eldar, Mário A. T. Figueiredo, Jared Tanner
Introduction to the Issue on Compressive Sensing. IEEE J. Sel. Top. Signal Process. 4 (2) (2010)
David L. Donoho, Jared Tanner
Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications. Discret. Comput. Geom. 43 (3) (2010)
David L. Donoho, Jared Tanner
Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by random sampling. IEEE Trans. Inf. Theory 56 (4) (2010)
Bubacarr Bah, Jared Tanner
Improved Bounds on Restricted Isometry Constants for Gaussian Matrices. SIAM J. Matrix Anal. Appl. 31 (5) (2010)
David L. Donoho, Jared Tanner
Observed Universality of Phase Transitions in High-Dimensional Geometry, with Implications for Modern Data Analysis and Signal Processing CoRR (2009)
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner
Decay Properties of Restricted Isometry Constants. IEEE Signal Process. Lett. 16 (7) (2009)
David L. Donoho, Jared Tanner
Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications CoRR (2008)
Götz E. Pfander, Holger Rauhut, Jared Tanner
Identification of Matrices Having a Sparse Representation. IEEE Trans. Signal Process. 56 (11) (2008)
Thomas Strohmer, Jared Tanner
Fast Reconstruction Algorithms for Periodic Nonuniform Sampling with Applications to Time-Interleaved ADCs. ICASSP (3) (2007)
Jared Tanner
Optimal filter and mollifier for piecewise smooth spectral data. Math. Comput. 75 (254) (2006)
David L. Donoho, Jared Tanner
Thresholds for the Recovery of Sparse Solutions via L1 Minimization. CISS (2006)
Thomas Strohmer, Jared Tanner
Fast Reconstruction Methods for Bandlimited Functions from Periodic Nonuniform Sampling. SIAM J. Numer. Anal. 44 (3) (2006)
Eitan Tadmor, Jared Tanner
Adaptive Mollifiers for High Resolution Recovery of Piecewise Smooth Data from its Spectral Information. Found. Comput. Math. 2 (2) (2002)