Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
0 answers
58 views

Bounds for $\sum_{t=1}^Tn_t(s_t)^{-\alpha}\mu(s_t)$ where $n_t(s) = \sum_{1 \le t' \le t} 1_{\{s_{t'}=s\}}$ for $s \in [k]$ and $\mu \in \Delta_k$

Disclaimer: I'm not certain this is the right venue for this post, but I'll give it a try... So trying prove some bounds in my ongoing work in theoretical reinforcement learning, I encountered the ...
dohmatob's user avatar
  • 6,853
21 votes
1 answer
2k views

Is there a combinatorial proof of Cauchy-Schwarz?

I've only played with this a little for the past day or so, and haven't thought about it too hard, so it might be obvious. Obviously it's not fair to ask for a "combinatorial proof" of an inequality ...
Harrison Brown's user avatar