Timeline for Matrix Bernstein's inequality: from tail probability to expectation
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 3 at 21:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 5 at 21:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 6 at 20:06 | history | edited | LSpice | CC BY-SA 4.0 |
Capitalise title, and question mark in display, while this is on the front page
|
| Jul 6 at 20:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 8 at 19:05 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 9, 2023 at 19:04 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 10, 2023 at 18:26 | answer | added | icecuber | timeline score: 0 | |
| Jun 3, 2023 at 17:44 | comment | added | Thomas Kojar | for getting an almost sure statement $|\sum X_i|\lessapprox t_{n}$, you could try a Borel-Cantelli argument for $A_{n}:=|\sum X_i|>t_{n}$ and then use the concentration inequality you mention. | |
| Jun 3, 2023 at 17:43 | comment | added | Thomas Kojar | for bounding the expectation you can use the layercake principle $E[Z]=\int_{0}^{\infty}P(Z>t)dt$ for nonnegative Z. | |
| Jun 2, 2023 at 10:34 | history | edited | happyle |
edited tags
|
|
| Jun 2, 2023 at 8:58 | history | asked | happyle | CC BY-SA 4.0 |