Skip to main content
added 66 characters in body
Source Link
bolzano
  • 143
  • 4

Assume that we have a random set $\mathcal A$$B$ which is constructed by selecting elements from $U = \{ X_1, \dots, X_n \}$ where $X_i$ are independent samples from Gaussians with means (concentrated around their expectations$\mu_i$ and variances $\mathbb E[X_i]$),$\sigma_i^2 = 1$.

I am interested at is selecting a subset of $m \le n$ vectors that are closest to the origin according to some rule $\kappa$their Euclidean norm. 

Let $A$ be the set constructed by applying thesame rule $\kappa$ to the set $W = \{ \mathbb E[X_1], \dots, \mathbb E[X_n] \}$$W = \{ \mathbb E[X_1], \dots, \mathbb E[X_n] \} = \{ \mu_1, \dots, \mu_n \}$. I want to ask if there are such problems in probability/learning theory literature and whether there are concentration (or anti-concentration) bounds for them. More specifically I am interested in bounds that bound the following event

$$\Pr[ |A \ominus \mathcal A| \ge t]$$$$\Pr[ |A \ominus B| \ge t]$$

where $A \ominus \mathcal A = (A \setminus \mathcal A) \cup (\mathcal A \setminus A)$$A \ominus B = (A \setminus B) \cup (B \setminus A)$ (i.e. the symmetric difference between $A$ and $\mathcal A$$B$) and $t \in \mathbb N - \{ 0 \}$.

Intuitively I want to find references where the "expected set" $A$ is "close" (or not) to the actual set $\mathcal A$$B$.

Assume that we have a random set $\mathcal A$ which is constructed by selecting elements from $U = \{ X_1, \dots, X_n \}$ where $X_i$ are independent samples (concentrated around their expectations $\mathbb E[X_i]$), according to some rule $\kappa$. Let $A$ be the set constructed by applying the rule $\kappa$ to the set $W = \{ \mathbb E[X_1], \dots, \mathbb E[X_n] \}$. I want to ask if there are such problems in probability/learning theory literature and whether there are concentration (or anti-concentration) bounds for them. More specifically I am interested in bounds that bound the following event

$$\Pr[ |A \ominus \mathcal A| \ge t]$$

where $A \ominus \mathcal A = (A \setminus \mathcal A) \cup (\mathcal A \setminus A)$ (i.e. the symmetric difference between $A$ and $\mathcal A$) and $t \in \mathbb N - \{ 0 \}$.

Intuitively I want to find references where the "expected set" $A$ is "close" (or not) to the actual set $\mathcal A$.

Assume that we have a random set $B$ which is constructed by selecting elements from $U = \{ X_1, \dots, X_n \}$ where $X_i$ are independent samples from Gaussians with means $\mu_i$ and variances $\sigma_i^2 = 1$.

I am interested at is selecting a subset of $m \le n$ vectors that are closest to the origin according to their Euclidean norm. 

Let $A$ be the set constructed by applying same rule to the set $W = \{ \mathbb E[X_1], \dots, \mathbb E[X_n] \} = \{ \mu_1, \dots, \mu_n \}$. I want to ask if there are such problems in probability/learning theory literature and whether there are concentration (or anti-concentration) bounds for them. More specifically I am interested in bounds that bound the following event

$$\Pr[ |A \ominus B| \ge t]$$

where $A \ominus B = (A \setminus B) \cup (B \setminus A)$ (i.e. the symmetric difference between $A$ and $B$) and $t \in \mathbb N - \{ 0 \}$.

Intuitively I want to find references where the "expected set" $A$ is "close" (or not) to the actual set $B$.

added 32 characters in body
Source Link
bolzano
  • 143
  • 4

Assume that we have a random set $\mathcal A$ which is constructed by selecting elements from $U = \{ X_1, \dots, X_n \}$ where $X_i$ are independent samples (concentrated around their expectations $\mathbb E[X_i]$), according to some rule $\kappa$. Let $A$ be the set constructed by applying the rule $\kappa$ to the set $W = \{ \mathbb E[X_1], \dots, \mathbb E[X_n] \}$. I want to ask if there are such problems in probability/learning theory literature and whether there are concentration (or anti-concentration) bounds for them. More specifically I am interested in bounds that bound the following event

$$\Pr[ |A \ominus \mathcal A| \ge t]$$

where $A \ominus \mathcal A = (A \setminus \mathcal A) \cup (\mathcal A \setminus A)$ (i.e. the symmetric difference between $A$ and $\mathcal A$) and $t \in \mathbb N - \{ 0 \}$.

Intuitively I want to find references where the "expected set" $A$ is "close" (or not) to the actual set $\mathcal A$.

Assume that we have a random set $\mathcal A$ which is constructed by selecting elements from $U = \{ X_1, \dots, X_n \}$ where $X_i$ are independent samples (concentrated around their expectations $\mathbb E[X_i]$), according to some rule $\kappa$. Let $A$ be the set constructed by applying the rule $\kappa$ to the set $W = \{ \mathbb E[X_1], \dots, \mathbb E[X_n] \}$. I want to ask if there are such problems in probability/learning theory literature and whether there are concentration (or anti-concentration) bounds for them. More specifically I am interested in bounds that bound the following event

$$\Pr[ |A \ominus \mathcal A| \ge t]$$

where $A \ominus \mathcal A = (A \setminus \mathcal A) \cup (\mathcal A \setminus A)$ (i.e. the symmetric difference between $A$ and $\mathcal A$).

Intuitively I want to find references where the "expected set" $A$ is "close" (or not) to the actual set $\mathcal A$.

Assume that we have a random set $\mathcal A$ which is constructed by selecting elements from $U = \{ X_1, \dots, X_n \}$ where $X_i$ are independent samples (concentrated around their expectations $\mathbb E[X_i]$), according to some rule $\kappa$. Let $A$ be the set constructed by applying the rule $\kappa$ to the set $W = \{ \mathbb E[X_1], \dots, \mathbb E[X_n] \}$. I want to ask if there are such problems in probability/learning theory literature and whether there are concentration (or anti-concentration) bounds for them. More specifically I am interested in bounds that bound the following event

$$\Pr[ |A \ominus \mathcal A| \ge t]$$

where $A \ominus \mathcal A = (A \setminus \mathcal A) \cup (\mathcal A \setminus A)$ (i.e. the symmetric difference between $A$ and $\mathcal A$) and $t \in \mathbb N - \{ 0 \}$.

Intuitively I want to find references where the "expected set" $A$ is "close" (or not) to the actual set $\mathcal A$.

Source Link
bolzano
  • 143
  • 4

Concentration inequalities for sets

Assume that we have a random set $\mathcal A$ which is constructed by selecting elements from $U = \{ X_1, \dots, X_n \}$ where $X_i$ are independent samples (concentrated around their expectations $\mathbb E[X_i]$), according to some rule $\kappa$. Let $A$ be the set constructed by applying the rule $\kappa$ to the set $W = \{ \mathbb E[X_1], \dots, \mathbb E[X_n] \}$. I want to ask if there are such problems in probability/learning theory literature and whether there are concentration (or anti-concentration) bounds for them. More specifically I am interested in bounds that bound the following event

$$\Pr[ |A \ominus \mathcal A| \ge t]$$

where $A \ominus \mathcal A = (A \setminus \mathcal A) \cup (\mathcal A \setminus A)$ (i.e. the symmetric difference between $A$ and $\mathcal A$).

Intuitively I want to find references where the "expected set" $A$ is "close" (or not) to the actual set $\mathcal A$.