It is demonstrated that shared randomness is necessary to achieve the complexity of distributed state certification with limited communication, and an $\Omega$ lower bound in the $\textit{private-coin}$ setting is proved.
Kenny Chen, Mina Doosti, R. Sweke et al.· 1 citation
It is proved that a resource-constrained learner cannot gain any advantage through classical interaction with an untrusted prover, and it is shown that for the vast majority of testing and learning problems, a memory-constrained quantum algorithm cannot overcome its limitations via classical communication with a memory...
Matthias C. Caro, J. Eisert, M. Hinsche et al.· arXiv.org· 4 citations
This work studies the simplified setting of reinforcement learning with a uniform generative model in which uniformly random state-action samples are available, and provides finite sample guarantees for classical kernelized Fitted Q-Iteration, with classical kernels designed to match the inductive bias of particular pa...
Pablo Rodriguez-Grasa, Sofiène Jerbi, Mikel Sanz et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.