English
Related papers

Related papers: What needles do sparse neural networks find in non…

200 papers

To fit sparse linear associations, a LASSO sparsity inducing penalty with a single hyperparameter provably allows to recover the important features (needles) with high probability in certain regimes even if the sample size is smaller than…

Machine Learning · Statistics 2022-01-24 Xiaoyu Ma , Sylvain Sardy , Nick Hengartner , Nikolai Bobenko , Yen Ting Lin

Neural networks are usually not the tool of choice for nonparametric high-dimensional problems where the number of input features is much larger than the number of observations. Though neural networks can approximate complex multivariate…

Methodology · Statistics 2019-06-25 Jean Feng , Noah Simon

Artificial neural networks (ANNs) especially deep convolutional networks are very popular these days and have been proved to successfully offer quite reliable solutions to many vision problems. However, the use of deep neural networks is…

Machine Learning · Computer Science 2020-07-28 Yangzi Guo , Yiyuan She , Adrian Barbu

Deep neural networks achieve state-of-the-art performance in a variety of tasks by extracting a rich set of features from unstructured data, however this performance is closely tied to model size. Modern techniques for inducing sparsity and…

Machine Learning · Computer Science 2021-03-02 Skyler Seto , Martin T. Wells , Wenyu Zhang

Deep convolutional neural networks have liberated its extraordinary power on various tasks. However, it is still very challenging to deploy state-of-the-art models into real-world applications due to their high computational complexity. How…

Computer Vision and Pattern Recognition · Computer Science 2018-09-06 Zehao Huang , Naiyan Wang

Regularized regression approaches such as the Lasso have been widely adopted for constructing sparse linear models in high-dimensional datasets. A complexity in fitting these models is the tuning of the parameters which control the level of…

Methodology · Statistics 2019-03-12 Ellis Patrick , Samuel Mueller

Feature selection is one of the most decisive tools in understanding data and machine learning models. Among other methods, sparsity induced by $L^{1}$ penalty is one of the simplest and best studied approaches to this problem. Although…

Machine Learning · Computer Science 2020-07-09 Andrii Trelin , Aleš Procházka

Artificial Neural Networks (ANNs) have emerged as hot topics in the research community. Despite the success of ANNs, it is challenging to train and deploy modern ANNs on commodity hardware due to the ever-increasing model size and the…

Neural and Evolutionary Computing · Computer Science 2021-01-19 Shiwei Liu , Decebal Constantin Mocanu , Amarsagar Reddy Ramapuram Matavalam , Yulong Pei , Mykola Pechenizkiy

In high-dimensional and/or non-parametric regression problems, regularization (or penalization) is used to control model complexity and induce desired structure. Each penalty has a weight parameter that indicates how strongly the structure…

Machine Learning · Statistics 2017-03-30 Jean Feng , Noah Simon

Neural networks have seen limited use in prediction for high-dimensional data with small sample sizes, because they tend to overfit and require tuning many more hyperparameters than existing off-the-shelf machine learning methods. With…

Machine Learning · Statistics 2020-05-12 Jean Feng , Noah Simon

Simultaneous feature selection and non-linear function estimation is challenging in modeling, especially in high-dimensional settings where the number of variables exceeds the available sample size. In this article, we investigate the…

Machine Learning · Statistics 2026-01-05 Bin Luo , Susan Halabi

Neural networks (NNs) are primarily developed within the frequentist statistical framework. Nevertheless, frequentist NNs lack the capability to provide uncertainties in the predictions, and hence their robustness can not be adequately…

Computational Engineering, Finance, and Science · Computer Science 2023-10-26 Nastaran Dabiran , Brandon Robinson , Rimple Sandhu , Mohammad Khalil , Dominique Poirel , Abhijit Sarkar

The task of using machine learning to approximate the mapping $\mathbf{x}\mapsto\sum_{i=1}^d x_i^2$ with $x_i\in[-1,1]$ seems to be a trivial one. Given the knowledge of the separable structure of the function, one can design a sparse…

Machine Learning · Computer Science 2020-05-19 Jiefu Zhang , Leonardo Zepeda-Núñez , Yuan Yao , Lin Lin

Recurrent Neural Networks (RNN) are widely used to solve a variety of problems and as the quantity of data and the amount of available compute have increased, so have model sizes. The number of parameters in recent state-of-the-art networks…

Machine Learning · Computer Science 2017-11-08 Sharan Narang , Erich Elsen , Gregory Diamos , Shubho Sengupta

Convolutional neural networks (CNNs) are reported to be overparametrized. The search for optimal (minimal) and sufficient architecture is an NP-hard problem as the hyperparameter space for possible network configurations is vast. Here, we…

Computer Vision and Pattern Recognition · Computer Science 2024-04-09 Tin Barisin , Illia Horenko

Recent theoretical studies proved that deep neural network (DNN) estimators obtained by minimizing empirical risk with a certain sparsity constraint can attain optimal convergence rates for regression and classification problems. However,…

Statistics Theory · Mathematics 2021-08-10 Ilsang Ohn , Yongdai Kim

The brain, as the source of inspiration for Artificial Neural Networks (ANN), is based on a sparse structure. This sparse structure helps the brain to consume less energy, learn easier and generalize patterns better than any other ANN. In…

Machine Learning · Computer Science 2021-03-16 Seyed Majid Naji , Azra Abtahi , Farokh Marvasti

Sparsification of neural networks is one of the effective complexity reduction methods to improve efficiency and generalizability. We consider the problem of learning a one hidden layer convolutional neural network with ReLU activation…

Optimization and Control · Mathematics 2020-02-26 Thu Dinh , Jack Xin

We consider high-dimensional binary classification by sparse logistic regression. We propose a model/feature selection procedure based on penalized maximum likelihood with a complexity penalty on the model size and derive the non-asymptotic…

Statistics Theory · Mathematics 2018-11-20 Felix Abramovich , Vadim Grinshtein

The robustness and anomaly detection capability of neural networks are crucial topics for their safe adoption in the real-world. Moreover, the over-parameterization of recent networks comes with high computational costs and raises questions…

Machine Learning · Computer Science 2022-07-12 Morgane Ayle , Bertrand Charpentier , John Rachwan , Daniel Zügner , Simon Geisler , Stephan Günnemann
‹ Prev 1 2 3 10 Next ›