arXiv:2603.10219v1 Announce Type: cross
Abstract: We study a continuous-time diffusion approximation of policy gradient for $k$-armed stochastic bandits. We prove that with a learning rate $eta = O(Delta^2/log(n))$ the regret is $O(k log(k) log(n) / eta)$ where $n$ is the horizon and $Delta$ the minimum gap. Moreover, we construct an instance with only logarithmically many arms for which the regret is linear unless $eta = O(Delta^2)$.
Measuring and Exploiting Confirmation Bias in LLM-Assisted Security Code Review
arXiv:2603.18740v1 Announce Type: cross Abstract: Security code reviews increasingly rely on systems integrating Large Language Models (LLMs), ranging from interactive assistants to autonomous agents in