Timeline for Bound the distance between two vectors on the probability simplex
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 6 at 17:01 | 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 16: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 16: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. | |
| Oct 10, 2023 at 15:28 | answer | added | icecuber | timeline score: 1 | |
| Oct 8, 2023 at 21:30 | comment | added | good bandit | The first optimization problem is the same as the second one. Expanding the norm in the second problem gives the expression in the first. An exact explicit expression for the supremum would be great. An upper bound which respects the dependance on $\delta$ (ie, if $\delta = 0$ then optimal value is 0, if $\delta \to 1$ then optimal value is at most 2) is also fine. | |
| Oct 8, 2023 at 21:14 | history | asked | good bandit | CC BY-SA 4.0 |