Jared Tanner

CoRR, 2024

Beyond IID weights: sparse and low-rank deep Neural Networks are also Gaussian Processes.

[BibT_eX]

[DOI]

Thiziri Nait Saada

Alireza Naderi

Proceedings of the Twelfth International Conference on Learning Representations, 2024

Deep Neural Network Initialization with Sparsity Inducing activations.

[BibT_eX]

[DOI]

Nicholas Daultry Ball

Adam C. Jones

Samuel C. H. Lam

Proceedings of the Twelfth International Conference on Learning Representations, 2024

Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023

On the Initialisation of Wide Low-Rank Feedforward Neural Networks.

[BibT_eX]

[DOI]

Thiziri Nait Saada

CoRR, 2023

Optimal Approximation Complexity of High-Dimensional Functions with Neural Networks.

[BibT_eX]

[DOI]

Vincent P. H. Goverse

Jad Hamdan

CoRR, 2023

Improved Projection Learning for Lower Dimensional Feature Maps.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2023

2022

Encoder Blind Combinatorial Compressed Sensing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Tuning-free multi-coil compressed sensing MRI with Parallel Variable Density Approximate Message Passing (P-VDAMP).

[BibT_eX]

[DOI]

CoRR, 2022

2021

Activation function design for deep networks: linearity and effective initialisation.

[BibT_eX]

[DOI]

Vinayak Abrol

CoRR, 2021

Mutual Information of Neural Network Initialisations: Mean Field Approximations.

[BibT_eX]

[DOI]

Giuseppe Ughi

Proceedings of the IEEE International Symposium on Information Theory, 2021

Trajectory growth lower bounds for random sparse deep ReLU networks.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE International Conference on Machine Learning and Applications, 2021

Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offset.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

An Empirical Study of Derivative-Free-Optimization Algorithms for Targeted Black-Box Attacks in Deep Neural Networks.

[BibT_eX]

[DOI]

Giuseppe Ughi

Vinayak Abrol

CoRR, 2020

Compressed sensing of low-rank plus sparse matrices.

[BibT_eX]

[DOI]

Simon Vary

CoRR, 2020

The Permuted Striped Block Model and its Factorization - Algorithms with Recovery Guarantees.

[BibT_eX]

[DOI]

CoRR, 2020

Approximate Message Passing with a Colored Aliasing Model for Variable Density Fourier Sampled Images.

[BibT_eX]

[DOI]

CoRR, 2020

A Model-Based Derivative-Free Approach to Black-Box Adversarial Examples: BOBYQA.

[BibT_eX]

[DOI]

Giuseppe Ughi

Vinayak Abrol

CoRR, 2020

An Approximate Message Passing Algorithm For Rapid Parameter-Free Compressed Sensing MRI.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Image Processing, 2020

2019

Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion.

[BibT_eX]

[DOI]

Andrew Thompson

Simon Vary

SIAM J. Math. Data Sci., 2019

Multilspectral snapshot demosaicing via non-convex matrix completion.

[BibT_eX]

[DOI]

Giancarlo A. Antonucci

CoRR, 2019

Multispectral Snapshot Demosaicing Via Non-Convex Matrix Completion.

[BibT_eX]

[DOI]

Giancarlo A. Antonucci

Proceedings of the IEEE Data Science Workshop, 2019

2018

A Robust Parallel Algorithm for Combinatorial Compressed Sensing.

[BibT_eX]

[DOI]

Rodrigo Mendoza-Smith

Florian Wechsung

IEEE Trans. Signal Process., 2018

On the Construction of Sparse Matrices From Expander Graphs.

[BibT_eX]

[DOI]

Frontiers Appl. Math. Stat., 2018

Towards an understanding of CNNs: analysing the recovery of activation pathways via Deep Convolutional Sparse Coding.

[BibT_eX]

[DOI]

CoRR, 2018

Sparse non-negative super-resolution - simplified and stabilised.

[BibT_eX]

[DOI]

CoRR, 2018

Deep CNN Sparse Coding Analysis: Towards Average Case.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE Data Science Workshop, 2018

Non-Negative Super-Resolution is Stable.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE Data Science Workshop, 2018

2015

Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing.

[BibT_eX]

[DOI]

Ke Wei

IEEE Trans. Signal Process., 2015

Performance comparisons of greedy algorithms in compressed sensing.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2015

Expander ℓ<sub>0</sub>-Decoding.

[BibT_eX]

[DOI]

Rodrigo Mendoza-Smith

CoRR, 2015

2013

Vanishingly Sparse Matrices and Expander Graphs, With Application to Compressed Sensing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Normalized Iterative Hard Thresholding for Matrix Completion.

[BibT_eX]

[DOI]

Ke Wei

SIAM J. Sci. Comput., 2013

GPU accelerated greedy algorithms for compressed sensing.

[BibT_eX]

[DOI]

Math. Program. Comput., 2013

On construction and analysis of sparse random matrices and expander graphs with applications to compressed sensing.

[BibT_eX]

[DOI]

CoRR, 2013

Matrix completion algorithms with optimal phase transition.

[BibT_eX]

[DOI]

Ke Wei

Proceedings of the 21st European Signal Processing Conference, 2013

2012

Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices

[BibT_eX]

[DOI]

CoRR, 2012

2011

Compressed Sensing: How Sharp Is the Restricted Isometry Property?

[BibT_eX]

[DOI]

Coralia Cartis

SIAM Rev., 2011

2010

Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by random sampling.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Improved Bounds on Restricted Isometry Constants for Gaussian Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2010

Precise Undersampling Theorems.

[BibT_eX]

[DOI]

Proc. IEEE, 2010

Introduction to the Issue on Compressive Sensing.

[BibT_eX]

[DOI]

Rick Chartrand

Richard G. Baraniuk

Yonina C. Eldar

Mário A. T. Figueiredo

IEEE J. Sel. Top. Signal Process., 2010

Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Phase Transitions for Greedy Sparse Approximation Algorithms

[BibT_eX]

[DOI]

CoRR, 2010

2009

Decay Properties of Restricted Isometry Constants.

[BibT_eX]

[DOI]

Coralia Cartis

IEEE Signal Process. Lett., 2009

Observed Universality of Phase Transitions in High-Dimensional Geometry, with Implications for Modern Data Analysis and Signal Processing

[BibT_eX]

[DOI]

CoRR, 2009

2008

Identification of Matrices Having a Sparse Representation.

[BibT_eX]

[DOI]

Götz E. Pfander

Holger Rauhut

IEEE Trans. Signal Process., 2008

2007

Fast Reconstruction Algorithms for Periodic Nonuniform Sampling with Applications to Time-Interleaved ADCs.

[BibT_eX]

[DOI]

Thomas Strohmer

Proceedings of the IEEE International Conference on Acoustics, 2007

2006

Fast Reconstruction Methods for Bandlimited Functions from Periodic Nonuniform Sampling.

[BibT_eX]

[DOI]

Thomas Strohmer

SIAM J. Numer. Anal., 2006

Optimal filter and mollifier for piecewise smooth spectral data.

[BibT_eX]

[DOI]

Math. Comput., 2006

Thresholds for the Recovery of Sparse Solutions via L1 Minimization.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

2002

Adaptive Mollifiers for High Resolution Recovery of Piecewise Smooth Data from its Spectral Information.

[BibT_eX]

[DOI]

Eitan Tadmor