Online Learning with Gated Linear Networks

By Joel Veness, Tor Lattimore, Avishkar Bhoopchand, Agnieszka Grabska-Barwinska, Christopher Mattern, Peter Toth. 2017

26 citations recorded by the source corpus.

This paper describes a family of probabilistic architectures designed for online learning under the logarithmic loss. Rather than relying on non-linear transfer functions, our method gains representational power by the use of data conditioning. We state under general conditions a learnable capacity theorem that shows this approach can in principle learn any bounded Borel-measurable function on a compact subset of euclidean space; the result is stronger than many universality results for connectionist architectures because we provide both the model and the learning procedure for which convergence is guaranteed.

Subfields: Artificial Intelligence, Computer Networks and Communications, Management Science and Operations Research, Optimization & Training

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Sergey Levine
  2. Yoshua Bengio
  3. Quoc V. Le
  4. Pieter Abbeel
  5. Mohit Bansal
  6. Ruslan Salakhutdinov
  7. Jianfeng Gao
  8. Kyunghyun Cho

In Computer Networks and Communications

  1. Oriol Vinyals
  2. Nando de Freitas
  3. Caglar Gulcehre
  4. Shane Legg

In Management Science and Operations Research

  1. Yannis Assael
  2. Yutian Chen
  3. Scott E. Reed
  4. David Krueger
  5. Oriol Vinyals
  6. Heiga Zen
  7. Nando de Freitas
  8. Caglar Gulcehre

In Optimization & Training

  1. Yutian Chen
  2. Nando de Freitas
  3. Yannis Assael
  4. Caglar Gulcehre
  5. Oriol Vinyals
  6. Scott E. Reed
  7. David Krueger
  8. Heiga Zen

Citations in the corpus