Explore >> Select a destination
|
You are here 
|
yufeizhao.com | ||
| | | | |
jaberkow.wordpress.com
|
|
| | | | | Lately I have been making use of a continuous relaxation of discrete random variables proposed in two recent papers: The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables and Categorical Reparameterization with Gumbel-Softmax. I decided to write a blog post with some motivation of the method, as well as providing some minor clarification on... | |
| | | | |
djalil.chafai.net
|
|
| | | | | Convergence in law to a constant. Let \( {{(X_n)}_{n\geq1}} \) be a sequence of random variables defined on a common probability space \( {(\Omega,\mathcal{A},\mathbb{P})} \), and taking their values in a metric space \( {(E,d)} \) equipped with its Borel sigma-field. It is well known that if \( {{(X_n)}_{n\geq1}} \) converges in law as \( {n\rightarrow\infty} \) to some Dirac... | |
| | | | |
nickhar.wordpress.com
|
|
| | | | | 1. Low-rank approximation of matrices Let $latex {A}&fg=000000$ be an arbitrary $latex {n \times m}&fg=000000$ matrix. We assume $latex {n \leq m}&fg=000000$. We consider the problem of approximating $latex {A}&fg=000000$ by a low-rank matrix. For example, we could seek to find a rank $latex {s}&fg=000000$ matrix $latex {B}&fg=000000$ minimizing $latex { \lVert A - B... | |
| | | | |
francisbach.com
|
|
| | | |||
