default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJared Tanner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]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- [c13]Ilan Price, Nicholas Daultry Ball, Adam C. Jones, Samuel C. H. Lam, Jared Tanner:
Deep Neural Network Initialization with Sparsity Inducing activations. ICLR 2024 - [c12]Thiziri Nait Saada, Alireza Naderi, Jared Tanner:
Beyond IID weights: sparse and low-rank deep Neural Networks are also Gaussian Processes. ICLR 2024 - [i32]Ilan Price, Nicholas Daultry Ball, Samuel C. H. Lam
, Adam C. Jones, Jared Tanner:
Deep Neural Network Initialization with Sparsity Inducing Activations. CoRR abs/2402.16184 (2024) - 2023
- [c11]Ilan Price, Jared Tanner:
Improved Projection Learning for Lower Dimensional Feature Maps. ICASSP 2023: 1-5 - [i31]Vincent P. H. Goverse, Jad Hamdan, Jared Tanner:
Optimal Approximation Complexity of High-Dimensional Functions with Neural Networks. CoRR abs/2301.13091 (2023) - [i30]Thiziri Nait Saada, Jared Tanner:
On the Initialisation of Wide Low-Rank Feedforward Neural Networks. CoRR abs/2301.13710 (2023) - [i29]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 abs/2310.08915 (2023) - [i28]Thiziri Nait Saada, Alireza Naderi, Jared Tanner:
Beyond IID weights: sparse and low-rank deep Neural Networks are also Gaussian Processes. CoRR abs/2310.16597 (2023) - 2022
- [j20]Michael Murray, Jared Tanner:
Encoder Blind Combinatorial Compressed Sensing. IEEE Trans. Inf. Theory 68(12): 8310-8341 (2022) - [i27]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 abs/2203.04180 (2022) - [i26]Ilan Price, Jared Tanner:
Improved Projection Learning for Lower Dimensional Feature Maps. CoRR abs/2210.15170 (2022) - 2021
- [c10]Ilan Price, Jared Tanner:
Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offset. ICML 2021: 8620-8629 - [c9]Ilan Price, Jared Tanner:
Trajectory growth lower bounds for random sparse deep ReLU networks. ICMLA 2021: 1004-1009 - [c8]Jared Tanner, Giuseppe Ughi:
Mutual Information of Neural Network Initialisations: Mean Field Approximations. ISIT 2021: 813-818 - [i25]Jared Tanner, Giuseppe Ughi:
Mutual Information of Neural Network Initialisations: Mean Field Approximations. CoRR abs/2102.04374 (2021) - [i24]Ilan Price, Jared Tanner:
Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offset. CoRR abs/2102.07655 (2021) - [i23]Michael Murray, Vinayak Abrol, Jared Tanner:
Activation function design for deep networks: linearity and effective initialisation. CoRR abs/2105.07741 (2021) - 2020
- [c7]Charles Millard, Aaron T. Hess, Boris Mailhé, Jared Tanner:
An Approximate Message Passing Algorithm For Rapid Parameter-Free Compressed Sensing MRI. ICIP 2020: 91-95 - [i22]Giuseppe Ughi, Vinayak Abrol, Jared Tanner:
A Model-Based Derivative-Free Approach to Black-Box Adversarial Examples: BOBYQA. CoRR abs/2002.10349 (2020) - [i21]Charles Millard, Aaron T. Hess, Boris Mailhé, Jared Tanner:
Approximate Message Passing with a Colored Aliasing Model for Variable Density Fourier Sampled Images. CoRR abs/2003.02701 (2020) - [i20]Michael Murray, Jared Tanner:
The Permuted Striped Block Model and its Factorization - Algorithms with Recovery Guarantees. CoRR abs/2004.05094 (2020) - [i19]Jared Tanner, Simon Vary:
Compressed sensing of low-rank plus sparse matrices. CoRR abs/2007.09457 (2020) - [i18]Giuseppe Ughi, Vinayak Abrol, Jared Tanner:
An Empirical Study of Derivative-Free-Optimization Algorithms for Targeted Black-Box Attacks in Deep Neural Networks. CoRR abs/2012.01901 (2020)
2010 – 2019
- 2019
- [j19]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): 537-554 (2019) - [c6]Giancarlo A. Antonucci, Simon Vary, David Humphreys, Robert A. Lamb, Jonathan Piper, Jared Tanner:
Multispectral Snapshot Demosaicing Via Non-Convex Matrix Completion. DSW 2019: 227-231 - [i17]Giancarlo A. Antonucci, Simon Vary, David Humphreys, Robert A. Lamb, Jonathan Piper, Jared Tanner:
Multilspectral snapshot demosaicing via non-convex matrix completion. CoRR abs/1902.11032 (2019) - [i16]Charles Millard, Aaron T. Hess, Boris Mailhé, Jared Tanner:
An Approximate Message Passing Algorithm for Rapid Parameter-Free Compressed Sensing MRI. CoRR abs/1911.01234 (2019) - [i15]Ilan Price, Jared Tanner:
Trajectory growth lower bounds for random sparse deep ReLU networks. CoRR abs/1911.10651 (2019) - 2018
- [j18]Bubacarr Bah, Jared Tanner:
On the Construction of Sparse Matrices From Expander Graphs. Frontiers Appl. Math. Stat. 4: 39 (2018) - [j17]Rodrigo Mendoza-Smith, Jared Tanner, Florian Wechsung:
A Robust Parallel Algorithm for Combinatorial Compressed Sensing. IEEE Trans. Signal Process. 66(8): 2167-2177 (2018) - [c5]Michael Murray, Jared Tanner:
Deep CNN Sparse Coding Analysis: Towards Average Case. DSW 2018: 95-99 - [c4]Armin Eftekhari, Jared Tanner, Andrew Thompson, Bogdan Toader, Hemant Tyagi:
Non-Negative Super-Resolution is Stable. DSW 2018: 100-104 - [i14]Armin Eftekhari, Jared Tanner, Andrew Thompson, Bogdan Toader, Hemant Tyagi:
Sparse non-negative super-resolution - simplified and stabilised. CoRR abs/1804.01490 (2018) - [i13]Bubacarr Bah, Jared Tanner:
On the construction of sparse matrices from expander graphs. CoRR abs/1804.09212 (2018) - [i12]Michael Murray, Jared Tanner:
Towards an understanding of CNNs: analysing the recovery of activation pathways via Deep Convolutional Sparse Coding. CoRR abs/1806.09888 (2018) - [i11]Jared Tanner, Andrew Thompson, Simon Vary:
Matrix rigidity and the ill-posedness of Robust PCA and matrix completion. CoRR abs/1811.05919 (2018) - 2017
- [i10]Rodrigo Mendoza-Smith, Jared Tanner, Florian Wechsung:
A robust parallel algorithm for combinatorial compressed sensing. CoRR abs/1704.09012 (2017) - 2015
- [j16]Jeffrey D. Blanchard, Jared Tanner:
Performance comparisons of greedy algorithms in compressed sensing. Numer. Linear Algebra Appl. 22(2): 254-282 (2015) - [j15]Jeffrey D. Blanchard, Jared Tanner, Ke Wei:
Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing. IEEE Trans. Signal Process. 63(2): 528-537 (2015) - [i9]Rodrigo Mendoza-Smith, Jared Tanner:
Expander ℓ0-Decoding. CoRR abs/1508.01256 (2015) - 2013
- [j14]Jeffrey D. Blanchard, Jared Tanner:
GPU accelerated greedy algorithms for compressed sensing. Math. Program. Comput. 5(3): 267-304 (2013) - [j13]Jared Tanner, Ke Wei:
Normalized Iterative Hard Thresholding for Matrix Completion. SIAM J. Sci. Comput. 35(5) (2013) - [j12]Bubacarr Bah, Jared Tanner:
Vanishingly Sparse Matrices and Expander Graphs, With Application to Compressed Sensing. IEEE Trans. Inf. Theory 59(11): 7491-7508 (2013) - [c3]Jared Tanner, Ke Wei:
Matrix completion algorithms with optimal phase transition. EUSIPCO 2013: 1-2 - [i8]Bubacarr Bah, Jared Tanner:
On construction and analysis of sparse random matrices and expander graphs with applications to compressed sensing. CoRR abs/1307.6477 (2013) - 2012
- [i7]Bubacarr Bah, Jared Tanner:
Vanishingly Sparse Matrices and Expander Graphs, with application to compressed sensing. CoRR abs/1207.3094 (2012) - [i6]Bubacarr Bah, Jared Tanner:
Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices. CoRR abs/1207.4883 (2012) - 2011
- [j11]Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner:
Compressed Sensing: How Sharp Is the Restricted Isometry Property? SIAM Rev. 53(1): 105-125 (2011) - 2010
- [j10]David L. Donoho, Jared Tanner:
Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications. Discret. Comput. Geom. 43(3): 522-541 (2010) - [j9]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): 241-243 (2010) - [j8]David L. Donoho, Jared Tanner:
Precise Undersampling Theorems. Proc. IEEE 98(6): 913-924 (2010) - [j7]Bubacarr Bah, Jared Tanner:
Improved Bounds on Restricted Isometry Constants for Gaussian Matrices. SIAM J. Matrix Anal. Appl. 31(5): 2882-2898 (2010) - [j6]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): 2002-2016 (2010) - [i5]Bubacarr Bah, Jared Tanner:
Improved Bounds on Restricted Isometry Constants for Gaussian Matrices. CoRR abs/1003.3299 (2010) - [i4]Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner, Andrew Thompson:
Phase Transitions for Greedy Sparse Approximation Algorithms. CoRR abs/1004.1821 (2010) - [i3]Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner:
Compressed Sensing: How sharp is the Restricted Isometry Property. CoRR abs/1004.5026 (2010)
2000 – 2009
- 2009
- [j5]Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner:
Decay Properties of Restricted Isometry Constants. IEEE Signal Process. Lett. 16(7): 572-575 (2009) - [i2]David L. Donoho, Jared Tanner:
Observed Universality of Phase Transitions in High-Dimensional Geometry, with Implications for Modern Data Analysis and Signal Processing. CoRR abs/0906.2530 (2009) - 2008
- [j4]Götz E. Pfander, Holger Rauhut, Jared Tanner:
Identification of Matrices Having a Sparse Representation. IEEE Trans. Signal Process. 56(11): 5376-5388 (2008) - [i1]David L. Donoho, Jared Tanner:
Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications. CoRR abs/0807.3590 (2008) - 2007
- [c2]Thomas Strohmer, Jared Tanner:
Fast Reconstruction Algorithms for Periodic Nonuniform Sampling with Applications to Time-Interleaved ADCs. ICASSP (3) 2007: 881-884 - 2006
- [j3]Jared Tanner:
Optimal filter and mollifier for piecewise smooth spectral data. Math. Comput. 75(254): 767-790 (2006) - [j2]Thomas Strohmer, Jared Tanner:
Fast Reconstruction Methods for Bandlimited Functions from Periodic Nonuniform Sampling. SIAM J. Numer. Anal. 44(3): 1073-1094 (2006) - [c1]David L. Donoho, Jared Tanner:
Thresholds for the Recovery of Sparse Solutions via L1 Minimization. CISS 2006: 202-206 - 2002
- [j1]Eitan Tadmor, Jared Tanner:
Adaptive Mollifiers for High Resolution Recovery of Piecewise Smooth Data from its Spectral Information. Found. Comput. Math. 2(2): 155-189 (2002)
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-08-08 19:18 CEST 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:
