On-line learning in the committee machine
DOI10.1088/0305-4470/28/6/016zbMATH Open0848.92002OpenAlexW2058047059MaRDI QIDQ4889332FDOQ4889332
Authors: Mauro Copelli, Nestor Caticha 
Publication date: 31 October 1996
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3fbb02b6a911862ac015d7a755ae561f065b69d8
Recommendations
variational analysisperceptronon-line algorithmsoptimal algorithmlearning from examplesmean generalizationnon-overlapping committee machinenorm of the student synaptic vectorstudent-teacher overlap
Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20) Memory and learning in psychology (91E40) Neural nets applied to problems in time-dependent statistical mechanics (82C32)
Cited In (13)
- Title not available (Why is that?)
- Learning with incomplete information in the committee machine
- Can a student learn optimally from two different teachers?
- On-line learning of a mixture-of-experts neural network
- Phase diagram of stochastic gradient descent in high-dimensional two-layer neural networks
- A learning rule for very simple universal approximators consisting of a single layer of perceptrons
- A committee machine with two-layer expert nets
- Learning dynamics: a replica approach
- Ensemble Learning of Linear Perceptrons: On-Line Learning Theory
- Learning in ultrametric committee machines
- The committee machine: computational to statistical gaps in learning a two-layers neural network
- On-line learning in parity machines
- Online learning via congregational gradient descent
This page was built for publication: On-line learning in the committee machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889332)
