Incremental Learning in Mirror Flows
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
arXiv:2502. 00753v4 Announce Type: replace-cross Abstract: Smoothness is crucial for attaining fast rates in first-order optimization.
arXiv:2608. 22834v2 Announce Type: replace-cross Abstract: We derive convergence guarantees for mirror descent and proximal mirror descent with a logarithmic barrier as the distance-generating function.
arXiv:2609.09466v2 Announce Type: replace Abstract: Online gradient descent is usually studied through external regret, where the learner competes with fixed alternatives. Recent work shows that firs...
arXiv:2608. 09218v1 Announce Type: new Abstract: Score-driven filters multiply a scaled log-likelihood score by a gain that controls the update magnitude.
arXiv:2610.14041v1 Announce Type: cross Abstract: Inverse Reinforcement Learning (IRL) is classically solved using Lagrangian optimisation, by jointly optimising a primal-dual problem with gradient d...
arXiv:2605. 23415v2 Announce Type: replace Abstract: Reinforcement learning has long struggled with poor sample efficiency.