scispace - formally typeset
Search or ask a question
Topic

Resampling

About: Resampling is a research topic. Over the lifetime, 5428 publications have been published within this topic receiving 242291 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: A general strategy for variable selection in semiparametric regression models by penalizing appropriate estimating functions by establishing a general asymptotic theory for penalized estimating functions and present suitable numerical algorithms to implement the proposed estimators.
Abstract: We propose a general strategy for variable selection in semiparametric regression models by penalizing appropriate estimating functions. Important applications include semiparametric linear regression with censored responses and semiparametric regression with missing predictors. Unlike the existing penalized maximum likelihood estimators, the proposed penalized estimating functions may not pertain to the derivatives of any objective functions and may be discrete in the regression coefficients. We establish a general asymptotic theory for penalized estimating functions and present suitable numerical algorithms to implement the proposed estimators. In addition, we develop a resampling technique to estimate the variances of the estimated regression coefficients when the asymptotic variances cannot be evaluated directly. Simulation studies demonstrate that the proposed methods perform well in variable selection and variance estimation. We illustrate our methods using data from the Paul Coverdell Stroke Registry.

154 citations

Journal ArticleDOI
TL;DR: In this article, an omnibus lack-of-fit test for linear or nonlinear quantile regression based on a cusum process of the gradient vector is proposed, which is consistent for all nonparametric alternatives without any moment conditions on the regression error, and is suitable for detecting the local alternatives of any order arbitrarily close to n−1/2 from the null hypothesis.
Abstract: We propose an omnibus lack-of-fit test for linear or nonlinear quantile regression based on a cusum process of the gradient vector. The test does not involve nonparametric smoothing but is consistent for all nonparametric alternatives without any moment conditions on the regression error. In addition, the test is suitable for detecting the local alternatives of any order arbitrarily close to n−1/2 from the null hypothesis. The limiting distribution of the proposed test statistic is non-Gaussian but can be characterized by a Gaussian process. We propose a simple sequential resampling scheme to carry out the test whose nominal levels are well approximated in our empirical study for

154 citations

Journal ArticleDOI
TL;DR: In this paper, the convergence analysis of a class of sequential Monte Carlo (SMC) methods where the times at which resampling occurs are computed online using criteria such as the effective sample size is studied.
Abstract: Sequential Monte Carlo (SMC) methods are a class of techniques to sample approximately from any sequence of probability distributions using a combination of importance sampling and resampling steps. This paper is concerned with the convergence analysis of a class of SMC methods where the times at which resampling occurs are computed online using criteria such as the effective sample size. This is a popular approach amongst practitioners but there are very few convergence results available for these methods. By combining semigroup techniques with an original coupling argument, we obtain functional central limit theorems and uniform exponential concentration estimates for these algorithms.

153 citations

01 Jan 2004
TL;DR: The computational complexity of the marginalized particle filter is analyzed and a general method to perform this analysis is given, the key is the introduction of the equivalent flop measure.
Abstract: In this paper the computational complexity of the marginalized particle lter is analyzed We introduce an equivalent flop measure to capture floating-point operations as well as other features, which cannot be measured using flops, such as the complexity in generating random numbers and performing the resampling From the analysis we conclude how to partition the estimation problem in an optimal way for some common target tracking models Some guidelines on how to increase performance based on the analysis is also given In an extensive Monte Carlo simulation we study different computational aspects and compare with theoretical results

153 citations

Journal ArticleDOI
TL;DR: This article provides a readable, self-contained introduction to the bootstrap and jackknife methodology for statistical inference; in particular, the focus is on the derivation of confidence intervals in general situations.
Abstract: As far back as the late 1970s, the impact of affordable, high-speed computers on the theory and practice of modern statistics was recognized by Efron (1979, 1982). As a result, the bootstrap and other computer-intensive statistical methods (such as subsampling and the jackknife) have been developed extensively since that time and now constitute very powerful (and intuitive) tools to do statistics with. This article provides a readable, self-contained introduction to the bootstrap and jackknife methodology for statistical inference; in particular, the focus is on the derivation of confidence intervals in general situations. A guide to the available bibliography on bootstrap methods is also offered.

153 citations


Network Information
Related Topics (5)
Estimator
97.3K papers, 2.6M citations
89% related
Inference
36.8K papers, 1.3M citations
87% related
Sampling (statistics)
65.3K papers, 1.2M citations
86% related
Regression analysis
31K papers, 1.7M citations
86% related
Markov chain
51.9K papers, 1.3M citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20251
20242
2023377
2022759
2021275
2020279