Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
203
votes
Accepted
Is it possible to have a pair of Gaussian random variables for which the joint distribution ...
varphi(\Phi^{-1}(u)) \varphi(\Phi^{-1}(v))} \>,
$$
where the numerator is the bivariate normal distribution with correlation $\rho$ evaluated at $\Phi^{-1}(u)$ and $\Phi^{-1}(v)$. … (x),\Phi(y))$ is
$$
f(x,y) = \varphi(x) \varphi(y) c(\Phi(x), \Phi(y)) \> .
$$
Note that by applying the Gaussian copula in the above equation, we recover the bivariate normal density. …
186
votes
Accepted
Difference between logit and probit models
In Logit:
$\Pr(Y=1 \mid X) = [1 + e^{-X'\beta}]^{-1} $
In Probit:
$\Pr(Y=1 \mid X) = \Phi(X'\beta)$ (Cumulative standard normal pdf)
In other way, logistic has slightly flatter tails. i.e the probit …
181
votes
Comprehensive list of activation functions in neural networks with pros/cons
Alternatively, it can be expressed as
$$a^i_j = \sigma(z^i_j) = \phi(z^i_j)$$.
Where $\phi $is the Cumulative distribution function (CDF). See here for means of approximating this. …
140
votes
Is normality testing 'essentially useless'?
Under regularity assumptions, we obtain the following asymptotic expansion for the cdf of the test statistic $T_n$:
$$P(T_n\leq x)=\Phi(x)+n^{-1/2}\frac{1}{6}\gamma(2x^2+1)\phi(x)-n^{-1}x\Big(\frac{1}{ … 12}\kappa (x^2-3)-\frac{1}{18}\gamma^2(x^4+2x^2-3)-\frac{1}{4}(x^2+3)\Big)\phi(x)+o(n^{-1}),$$
where $\Phi(\cdot)$ is the cdf and $\phi(\cdot)$ is the pdf of the standard normal distribution. …
133
votes
Accepted
How to visualize what canonical correlation analysis does (in comparison to what principal c...
Instead, they are found (extracted) so as to minimize the angle $\phi$ between them. Cosine of that angle is the canonical correlation. …
117
votes
Accepted
Wald test for logistic regression
The dispersion parameter $\phi$ indicates if we have more or less than the expected variance. … If $\phi=1$ this means we observe the expected amount of variance, whereas $\phi<1$ means that we have less than the expected variance (called underdispersion) and $\phi>1$ means that we have extra variance …
113
votes
Accepted
Consider the sum of $n$ uniform distributions on $[0,1]$, or $Z_n$. Why does the cusp in the...
t) \phi(t) dt = \frac{-i}{2\pi} \int_{-\infty}^\infty t \exp(-i x t) \phi(t) dt.$$
For this to be well-defined, the last integral must converge absolutely; that is,
$$\int_{-\infty}^\infty |t \exp(- … i x t) \phi(t)| dt = \int_{-\infty}^\infty |t| |\phi(t)| dt$$
must converge to a finite value. …
111
votes
How does the reparameterization trick for VAEs work and why is it important?
Intuitively, in its original form, VAEs sample from a random node $z$ which is approximated by the parametric model $q(z \mid \phi, x)$ of the true posterior. …
99
votes
Accepted
What is the difference between a "link function" and a "canonical link function" for GLM
For $i=1,\dots,n$ independent observations, the distribution of each $y_i$ is an exponential family with density
$$
f(y_i;\theta_i,\phi)=\exp\left(\frac{y_i\theta_i-\gamma(\theta_i)}{\phi}+\tau(y_i,\phi … )\right) = \alpha(y_i, \phi)\exp\left(\frac{y_i\theta_i-\gamma(\theta_i)}{\phi}\right)
$$
Here, the parameter of interest (natural or canonical parameter) is $\theta_i$, $\phi$ is a scale parameter (known …
92
votes
How does a Support Vector Machine (SVM) work?
\left(\mathbf{x}^{\text {test}}\right)+b\right) \\
&= \text {sign}\left(\sum_{i =1}^{N}\alpha^{(i)}y^{(i)}\phi\left(x^{(i)}\right)^T\phi\left(\mathbf{x}^{\text {test}}\right)+b \right)
\end{align*}
The … Kernel trick
One can observe that the optimization problem uses the $\phi\left(\mathbf{x}^{(i)}\right)$ only in the inner product $\phi\left(\mathbf{x}^{(i)}\right)^T \phi\left(\mathbf{x}^{(j)}\right) …
88
votes
How to intuitively explain what a kernel is?
x_1^2, \ x_2^2) \ \begin{pmatrix} \sqrt{2}x_1'x_2' \\ x_1'^2 \\ x_2'^2 \end{pmatrix}
\end{aligned}
$$ k(\begin{pmatrix} x_1 \\ x_2 \end{pmatrix}, \begin{pmatrix} x_1' \\ x_2' \end{pmatrix} ) = \phi … (\mathbf{x})^T \phi(\mathbf{x'})$$
$$ \phi(\begin{pmatrix} x_1 \\ x_2 \end{pmatrix}) =\begin{pmatrix} \sqrt{2}x_1x_2 \\ x_1^2 \\ x_2^2 \end{pmatrix}$$
Visualizing the feature map and the resulting boundary …
85
votes
How can I calculate $\int^{\infty}_{-\infty}\Phi\left(\frac{w-a}{b}\right)\phi(w)\,\mathrm dw$
}\phi(w)\,\mathrm dw
= \int_{-\infty}^\infty \Phi\left(\frac{w-a}{b}\right)\phi(w)\,\mathrm dw.$$
Now, $P\{X \leq Y\} = P\{X-Y \leq 0\}$ can be expressed in terms of $\Phi(\cdot)$ by noting that $X-Y \ … sim N(a,b^2+1)$, and thus we get
$$\int_{-\infty}^\infty \Phi\left(\frac{w-a}{b}\right)\phi(w)\,\mathrm dw = \Phi\left(\frac{-a}{\sqrt{b^2+1}}\right)$$
which is the same as the result in whuber's answer …
85
votes
Accepted
Training a decision tree against unbalanced data
It is defined as the arithmetic mean of the class-specific accuracies, $\phi := \frac{1}{2}\left(\pi^+ + \pi^-\right),$ where $\pi^+$ and $\pi^-$ represent the accuracy obtained on positive and negative …
80
votes
Accepted
Pdf of the square of a general normal random variable
We have then
$$ \begin{align} F_Y (y) = P\left( |X|\leq \sqrt{y} \right) = P\left(-\sqrt{y} < X <\sqrt{y} \right) = \Phi\left(\sqrt{y}\right) - \Phi \left(- \sqrt{y}\right) \end{align} $$
where $\Phi … phi(\sqrt{y}) $$
where $\phi(.)$ is now the pdf of a standard normal variable and we have used the fact that it is symmetric about zero. …
77
votes
Can you explain Parzen window (kernel) density estimation in layman's terms?
The main idea is that you approximate $f$ by a mixture of continuous distributions $K$ (using your notation $\phi$), called kernels, that are centered at $x_i$ datapoints and have scale (bandwidth) equal …