Timeline for metric entropy for Lipschitz functions
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 1, 2018 at 13:09 | comment | added | Aryeh Kontorovich | Yes, see my answer here mathoverflow.net/questions/303777/… | |
| Jul 1, 2018 at 6:08 | comment | added | gradstudent | Can this Kolmogorov-Tihomirov lowerbound on the metric entropy in the infinity-norm be used to get a lowerbound on the packing number of the same function space in some data-dependent pseuodo-metric? (On the function space I am assuming a a pseudo metric which is defined as follows : i.e for any $2$ functions $f$ and $g$ we have, the distance between them defined as, $d(f,g) = \frac{1}{n} \sum_{i=1}^n \vert f(x_i) - g(x_i) \vert$ for some choice of $n$ points $\{ x_1,..,x_n\}$ in the common domain of the functions) | |
| Jan 13, 2014 at 12:32 | history | asked | Aryeh Kontorovich | CC BY-SA 3.0 |