We have 2 of 63 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
Natural gradient descent requires asymptotically at least \(R\) times as many steps as an optimizer following the Fisher--Rao geodesic, a practical computational cost under a per-step Fisher-chord budget.
A path-level regret bound for PathUCB that decomposes regret over suboptimal paths via a per-path complexity C(pi) combining each edge's prefix and suffix reliability, complementary to the edge-level CCB bound and more informative on structured graphs with polynomially many source-to-goal paths.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
