Sciweavers

1413 search results - page 118 / 283
» A Theory for Memory-Based Learning
Sort
View
174
Voted
ML
2007
ACM
108views Machine Learning» more  ML 2007»
15 years 5 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov
179
Voted
ATAL
2009
Springer
15 years 4 months ago
Replicator Dynamics for Multi-agent Learning: An Orthogonal Approach
Today's society is largely connected and many real life applications lend themselves to be modeled as multi-agent systems. Although such systems as well as their models are d...
Michael Kaisers, Karl Tuyls
177
Voted
JDCTA
2010
160views more  JDCTA 2010»
15 years 28 days ago
Learning and Decision Making in Human During a Game of Matching Pennies
To gain insights into the neural basis of such adaptive decision-making processes, we investigated the nature of learning process in humans playing a competitive game with binary ...
Jianfeng Hu, Xiaofeng Li, Jinghai Yin
ICML
2009
IEEE
16 years 7 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas
ICML
2007
IEEE
16 years 7 months ago
Spectral feature selection for supervised and unsupervised learning
Feature selection aims to reduce dimensionality for building comprehensible learning models with good generalization performance. Feature selection algorithms are largely studied ...
Zheng Zhao, Huan Liu