paper-with-me

Papers

Smooth markets: A basic mechanism for organizing gradient-based learners

2020-01-14 · ICLR 2020 1 · David Balduzzi, Wojciech M. Czarnecki, Thomas W. Anthony, Ian M Gemp, Edward Hughes, Joel Z. Leibo, Georgios Piliouras, Thore Graepel

With the success of modern machine learning, it is becoming increasingly important to understand and control how learning algorithms interact. Unfortunately, negative results from game theory show there is little hope of understanding or controlling general n-player games. We therefore introduce smooth markets (SM-games), a class of n-player games with pairwise zero sum interactions. SM-games codify a common design pattern in machine learning that includes (some) GANs, adversarial training, and other recent algorithms. We show that SM-games are amenable to analysis and optimization using first-order methods.

📄 PDF Abstract BibTeX arXiv:2001.04678

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine Learning

Similar Papers 제목 키워드 기반

AdaGrad does not adapt to Hölder-smoothness for composite objectives

2026-06-29 · Matia Bojovic, Saverio Salzo, Massimiliano Pontil arxiv

We exhibit a simple deterministic one-dimensional convex composite optimization problem for which AdaGrad scheme does not achieve the classical convergence rate $\mathcal{O}(n^{-(1+ν)/2})$ associated with Hölder-smooth o…

Smooth Quadratic Prediction Markets

2025-05-05 · Enrique Nueve, Bo Waggoner

When agents trade in a Duality-based Cost Function prediction market, they collectively implement the learning algorithm Follow-The-Regularized-Leader. We ask whether other learning algorithms could be used to inspire th…

Prediction

Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization

2011-12-01 · NeurIPS 2011 12 · Mark Schmidt, Nicolas L. Roux, Francis R. Bach

We consider the problem of optimizing the sum of a smooth convex function and a non-smooth convex function using proximal-gradient methods, where an error is present in the calculation of the gradient of the smooth term …

Gradient Gating for Deep Multi-Rate Learning on Graphs

2022-10-02 · T. Konstantin Rusch, Benjamin P. Chamberlain, Michael W. Mahoney, Michael M. Bronstein 외

We present Gradient Gating (G$^2$), a novel framework for improving the performance of Graph Neural Networks (GNNs). Our framework is based on gating the output of GNN layers with a mechanism for multi-rate flow of messa…

Graph LearningNode Classification

Speculation and Power Law

2016-12-27

It is now well established empirically that financial price changes are distributed according to a power law, with cubic exponent. This is a fascinating regularity, as it holds for various classes of securities, on vario…