Jared Tanner - RankMe

70 papers A* 5B 2C 1Misc 2Journal 55Unranked 5

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