Explore >> Select a destination
|
You are here 
|
mkatkov.wordpress.com | ||
| | | | |
extremal010101.wordpress.com
|
|
| | | | | With Alexandros Eskenazis we posted a paper on arxiv "Learning low-degree functions from a logarithmic number of random queries" exponentially improving randomized query complexity for low degree functions. Perhaps a very basic question one asks in learning theory is as follows: there is an unknown function $latex f : \{-1,1\}^{n} \to \mathbb{R}$, and we are... | |
| | | | |
thehighergeometer.wordpress.com
|
|
| | | | | Here's a fun thing: if you want to generate a random finite $latex T_0$ space, instead select a random subset from $latex \mathbb{S}^n$, the $latex n$-fold power of the Sierpinski space $latex \mathbb{S}$, since every $latex T_0$ space embeds into some (arbitrary) product of copies of the Sierpinski space. (Recall that $latex \mathbb{S}$ has underlying... | |
| | | | |
djalil.chafai.net
|
|
| | | | | This post provides the solution to a tiny exercise of probability theory, answering the question asked by a student during the MAP-432 class yesterday. Let \( {(\Omega,\mathcal{F},\mathbb{P})} \) be a probability space equipped with a filtration \( {{(\mathcal{F}_n)}_{n\geq0}} \). Recall that a random variable \( {\tau} \) taking values in \( {\mathbb{N}=\{0,1,\ldots\}} \) is a stopping time when \( {\{\tau=n\}\in\mathcal{F}_n}... | |
| | | | |
battletankpower.blogspot.com
|
|
| | | ....... i think it's enough ....... | ||
