Sciweavers

1413 search results - page 177 / 283
» A Theory for Memory-Based Learning
Sort
View
COLT
1999
Springer
15 years 10 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
NIPS
2004
15 years 7 months ago
Maximising Sensitivity in a Spiking Network
We use unsupervised probabilistic machine learning ideas to try to explain the kinds of learning observed in real neurons, the goal being to connect abstract principles of self-or...
Anthony J. Bell, Lucas C. Parra
AIEDU
2010
15 years 1 months ago
Towards Systems That Care: A Conceptual Framework based on Motivation, Metacognition and Affect
: This paper describes a Conceptual Framework underpinning "Systems that Care" in terms of educational systems that take account of motivation, metacognition and affect, ...
Benedict du Boulay, Katerina Avramides, Rosemary L...
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
16 years 6 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...
ATAL
2009
Springer
16 years 28 days ago
A self-organizing neural network architecture for intentional planning agents
This paper presents a model of neural network embodiment of intentions and planning mechanisms for autonomous agents. The model bridges the dichotomy of symbolic and non-symbolic ...
Budhitama Subagdja, Ah-Hwee Tan