Timeline for Request for references about computing or estimating Rademacher complexity
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| May 23, 2016 at 15:42 | comment | added | Aryeh Kontorovich | Hi, perhaps you can contact me off-line via email so we can discuss the precise nature of the result you're looking for... | |
| May 18, 2016 at 23:53 | comment | added | Student | Yes to both your queries! | |
| May 18, 2016 at 19:48 | comment | added | Aryeh Kontorovich | Re: your question about the Rademacher complexity of $n$-variate polynomials. Do you prefer to work on a cube or a sphere (or another kind of bounded set)? Are you OK with restricting all of the coefficients to have absolute value bounded by, say $K$? | |
| May 18, 2016 at 19:11 | comment | added | Student | Oh! Wow! Turns out I was infact looking at your paper when I was writing this question, arxiv.org/pdf/1111.4470.pdf :D | |
| May 18, 2016 at 19:09 | vote | accept | Student | ||
| May 18, 2016 at 18:41 | comment | added | Student | Thanks for the helpful references! So is anything specifically known about the Rademacher complexity of the set of all polynomials? (or any specific subset of them?) Can I hope that some simplification would occur for this set as compared to the corresponding number for what these papers are assuming i.e all Lipschitz functions of maybe bounded norm? | |
| May 18, 2016 at 8:06 | history | answered | Aryeh Kontorovich | CC BY-SA 3.0 |