We have 4 of 13 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.
An algorithm for the special case of self-aware graphs, in which every vertex has a self-loop and a map whose fixed points yield sampling distributions that control the one-round regret remainder in terms of the learner's loss and the graph's independence number is constructed.
We study last-iterate convergence in unknown two-player zero-sum discounted Markov games with bandit feedback. The players learn independently along a single trajectory without observing each other's actions. We develop Adaptive Regularized TD Learning (ARTD), which achieves a $\widetilde{\mathcal{O}}(t^{-1/4})$ dualit...
Optimistic Payoff Balancing (OPB), which achieves instance-dependent instance-dependent $\mathcal{O}(\log^2 T)$ Nash regret against arbitrary adaptive opponents, including games with nonunique equilibria, is developed.
Coupled Calibration and Learning (CCL) is proposed, an LLM distillation algorithm that couples teacher calibration with student updates through token-level branching, using reward feedback only on source questions.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
