Questions tagged [bootstrap-sampling]

Use this tag for questions related to a statistical test or metric that relies on random sampling with replacement.

In statistics, bootstrapping is any test or metric that relies on random sampling with replacement. Bootstrapping allows one to—

  • assign measures of accuracy (e.g., bias, variance, confidence intervals, prediction error) to sample estimates,
  • estimate the sampling distribution of almost any statistic,
  • construct hypothesis tests, and
  • make statistical inferences based on the assumption of a parametric model if that assumption is in doubt, or if parametric inference is impossible or requires complicated formulas for the calculation of standard errors.

The basic idea of bootstrapping is that inference about a population from sample data (sample → population) can be modelled by resampling the sample data and performing inference about a sample from resampled data (resampled → sample). As the population is unknown, the true error in a sample statistic against its population value is unknown. In bootstrap resamples, the "population" is in fact the sample, and this is known; hence the quality of inference of the "true" sample from resampled data (resampled → sample) is measurable.

59 questions
6
votes
3 answers

The measure-theoretical definition of a bootstrap sample

I’m currently learning the bootstrap method, and I have two questions to ask about the definition of a bootstrap sample. Let $ (\Omega,\mathscr{S},\mathsf{P}) $ be a probability space. Let $ X_{1},\ldots,X_{n} $ be i.i.d. random variables on $…
5
votes
3 answers

Expected number of tries to choose x unique values

it's been a long time since I've dealt with probability so I thought I would ask here. I'm sampling elements independently and uniformly and with repetition from a population. Given that the population is of size n, how many tries (in expectation)…
4
votes
1 answer

Proof of Sampling/Importance Resampling (Weighted Bootstrap) technique

From Casella Berger exercise 5.65: Let us have $X \sim f$. Then, assume we produce $m$ i.i.d. random variables $Y_1,...,Y_m$ from another distribution $g$. Let us have $$q_i = \frac{\frac{f(Y_i)}{g(Y_i)}}{\sum_{j =…
John
  • 1,293
  • 1
  • 12
  • 22
3
votes
0 answers

Predicting optimal sampling to solve a PDE with neural net

Let's consider the classic heat equation and ignore the boundary and initial conditions for simplicity, $$u_t(t,x) = u_{xx}(t,x).$$ I have a neural network that attempts to solve this by inputting a random uniform distribution (which we call $p$)…
3
votes
1 answer

Probabilistic subsampling of an Erdős–Rényi graph

Suppose I have an Erdős–Rényi graph ${\cal G}(n,p)$, where $n$ is the total number of nodes and $p$ is the probability of an edge between any pair of nodes (edges are added independently). I subsample the graph by sampling $m$ nodes from the graph…
Abas
  • 335
  • 1
  • 10
3
votes
1 answer

When is the bootstrap sampling method not applicable?

I have used once the bootstrap sampling method to obtain a confidence interval for the expected daily returns that I had calculated using some data given. As far as I have understood, this method can be used even when the distribution of the random…
user168764
2
votes
1 answer

Proof that the bootstrap sample contains on average n*(1-1/n)^n unique samples.

I am aware that the average bootstrap sample (meaning sampling $n$ unique objects $n$ times with replacement) has an expected number of unique samples: $$n(1-(1-1/n)^n)$$ However I am having trouble justifying it. I agree that the probability of a…
Cory Nezin
  • 121
  • 3
2
votes
2 answers

How to compute probability of a bootstrap sample

The Question Consider the samples $\{1, 3, 4, 6\}$ from some distribution. a) For one random bootstrap sample, find the probability that the mean is $1$. b) For one random bootstrap sample, find the probability that the maximum is $6$. c) For one…
Ook
  • 157
  • 6
2
votes
0 answers

Variance of a bootstrap estimator

Suppose we have a sample $X_1,X_2,...,X_n \sim F$, where the distribution $F$ is unknown. Let $T_n = g(X_1,X_2,...,X_n) = \bar{X}^2$, $\mu = \mathbb{E}[X_1]$, and define the following: $$\alpha_k = \int \left | x - \mu \right | ^k dF(x) \ \ \ \ …
MathIsLife12
  • 1,527
  • 1
  • 10
  • 28
2
votes
0 answers

Is it possible to cluster particles and then resample each cluster?

Is it possible to cluster particles (in the particle filter) and then resample each cluster separately? if yes, the resampling are done parallel?
nil
  • 21
  • 3
2
votes
2 answers

Inequality regarding sample mean

I was looking at the book "Asymptotic Theory of statistics and probability, DasGupta A., 2008" and in one point of a proof they use an inequality which I have not been able to understand. Given that $X_i, i \in \{1,...,n\}$ are independent and…
2
votes
1 answer

Why does bootstrapping approach the distribution of estimator, not mean of the estimator with normal distribution?

The wiki page (https://en.wikipedia.org/wiki/Bootstrapping_(statistics)) sated that bootstrapping allow one to compute and estimate the approximate distribution of the estimator. But why does bootstrapping approach the distribution of estimator, not…
2
votes
2 answers

Intrepretation of Bootstrap method in a simple example, with uniform population to infer.

In order to understand the functionality of bootstrap, i may use a population with uniform distribution to infer. We can generate a sample of 50 points from a uniform distribution $U(0, 1)$ with $\mu=0.5$, and $\sigma=0.2887$. An example result…
Redsbefall
  • 4,610
  • 1
  • 18
  • 41
2
votes
1 answer

SVD: How to scale singular values after rotating U and V (Matlab)

I am very new to linear algebra... I construct a rectangular matrix A1 from some sampled data which is m x n where m > n [U1, S1, V1] = svd(A1) If I then construct a new matrix A2 (also m x n, m > n) using resampling for e.g. bootstrapping of the…
1
vote
1 answer

Bayesian boostrap on a weighted sample

I want to do a Bayesian bootstrap on sample $x_i$ (size $N$) that is already weighted with weights $w_i$. Weights are assumed to sum to $N$, i.e., $\sum w_i=N$. Now, when weights equal 1, i.e., $w_i=1$, one would use the Dirichlet distribution with…
dikdirk
  • 11
  • 1
1
2 3 4