Goto

Collaborating Authors

 Optimization









Acceleration through Optimistic No-Regret Dynamics

Neural Information Processing Systems

Zero-sum games can be solved using online learning dynamics, where a classical technique involves simulating two no-regret algorithms that play against each other and, afterT rounds, the average iterate is guaranteed to solve the original optimization problem with error decaying asO(logT/T). In this paper we show that the technique can be enhanced to a rate ofO(1/T2) by extending recent work [22, 25] that leverages optimistic learning to speed upequilibrium computation.



GraphStructuredPredictionEnergyNetworks

Neural Information Processing Systems

Specifically,GSPENs combine thecapabilities ofclassicalstructured prediction models andSPENs andhavetheability toexplicitly model localstructure whenknown or assumed, while providing the ability to learn an unknown or more global structure implicitly.