Learning with incomplete information in the committee machine

DOI10.1007/S00422-009-0345-2zbMATH Open1371.68228OpenAlexW2107912903WikidataQ43248841 ScholiaQ43248841MaRDI QIDQ309499FDOQ309499

Authors: Urs M. Bergmann, R. Kühn, Ion-Olimpiu Stamatescu 

Publication date: 7 September 2016

Published in: Biological Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00422-009-0345-2

Recommendations

• Learning with incomplete information and the mathematical structure behind it
• On-line learning in the committee machine
• Can a student learn optimally from two different teachers?
• scientific article; zbMATH DE number 1569108
• Perfect loss of generalization due to noise in K=2 parity machines

zbMATH Keywords

online learningreinforcement learningcoarsegrained analysiscommittee machinecredit assignment

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Approximation by superpositions of a sigmoidal function
• Learning with incomplete information and the mathematical structure behind it
• Dynamics of batch training in a perceptron
• Transient dynamics of on-line learning in two-layered neural networks
• New method for studying the dynamics of disordered spin systems without finite-size effects
• Learning structured data from unspecific reinforcement
• Learning by on-line gradient descent
• A two-step algorithm for learning from unspecific reinforcement

Cited In (4)

• Can a student learn optimally from two different teachers?
• Learning in ultrametric committee machines
• The committee machine: computational to statistical gaps in learning a two-layers neural network
• Learning with incomplete information and the mathematical structure behind it

This page was built for publication: Learning with incomplete information in the committee machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309499)