paper-with-me

홈 › Papers

Scalable Subsampling Inference for Deep Neural Networks

2024-05-14 · Kejin Wu, Dimitris N. Politis

Deep neural networks (DNN) has received increasing attention in machine learning applications in the last several years. Recently, a non-asymptotic error bound has been developed to measure the performance of the fully connected DNN estimator with ReLU activation functions for estimating regression models. The paper at hand gives a small improvement on the current error bound based on the latest results on the approximation ability of DNN. More importantly, however, a non-random subsampling technique--scalable subsampling--is applied to construct a `subagged' DNN estimator. Under regularity conditions, it is shown that the subagged DNN estimator is computationally efficient without sacrificing accuracy for either estimation or prediction tasks. Beyond point estimation/prediction, we propose different approaches to build confidence and prediction intervals based on the subagged DNN estimator. In addition to being asymptotically valid, the proposed confidence/prediction intervals appear to work well in finite samples. All in all, the scalable subsampling DNN estimator offers the complete package in terms of statistical inference, i.e., (a) computational efficiency; (b) point estimation/prediction accuracy; and (c) allowing for the construction of practically useful confidence and prediction intervals.

📄 PDF Abstract BibTeX arXiv:2405.08276

Code (0)

등록된 구현이 없습니다.

Tasks

Computational EfficiencyPredictionPrediction Intervalsvalid

Similar Papers 제목 키워드 기반

Subsampling MCMC - An introduction for the survey statistician

2018-07-23 · Matias Quiroz, Mattias Villani, Robert Kohn, Minh-Ngoc Tran 외

The rapid development of computing power and efficient Markov Chain Monte Carlo (MCMC) simulation algorithms have revolutionized Bayesian statistics, making it a highly practical inference method in applied work. However…

SurveySurvey Sampling

Scalable Inference of Overlapping Communities

2012-12-01 · NeurIPS 2012 12 · Prem K. Gopalan, Sean Gerrish, Michael Freedman, David M. Blei 외

We develop a scalable algorithm for posterior inference of overlapping communities in large networks. Our algorithm is based on stochastic variational inference in the mixed-membership stochastic blockmodel. It naturall…

Variational Inference

Optimal Subsampling Approaches for Large Sample Linear Regression

2015-09-17 · Rong Zhu, Ping Ma, Michael W. Mahoney, Bin Yu

A significant hurdle for analyzing large sample data is the lack of effective statistical computing and inference methods. An emerging powerful approach for analyzing large sample data is subsampling, by which one takes …

regression

Scalable Deep Compressive Sensing

2021-01-20 · Zhonghao Zhang, Yipeng Liu, Xingyu Cao, Fei Wen 외

Deep learning has been used to image compressive sensing (CS) for enhanced reconstruction performance. However, most existing deep learning methods train different models for different subsampling ratios, which brings ad…

Compressive Sensing

Scalable Metropolis-Hastings for Exact Bayesian Inference with Large Datasets

2019-01-28 · Robert Cornish, Paul Vanetti, Alexandre Bouchard-Côté, George Deligiannidis 외

Bayesian inference via standard Markov Chain Monte Carlo (MCMC) methods is too computationally intensive to handle large datasets, since the cost per step usually scales like $\Theta(n)$ in the number of data points $n$.…

Bayesian Inference