Sciweavers

240 search results - page 32 / 48
» Laplacian Spectrum Learning
Sort
View
ICML
2008
IEEE
14 years 9 months ago
No-regret learning in convex games
Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated...
Geoffrey J. Gordon, Amy R. Greenwald, Casey Marks
SDM
2009
SIAM
112views Data Mining» more  SDM 2009»
14 years 6 months ago
A Re-evaluation of the Over-Searching Phenomenon in Inductive Rule Learning.
Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluat...
Frederik Janssen, Johannes Fürnkranz
LAMAS
2005
Springer
14 years 2 months ago
An Overview of Cooperative and Competitive Multiagent Learning
Abstract Multi-agent systems (MASs) is an area of distributed artificial intelligence that emphasizes the joint behaviors of agents with some degree of autonomy and the complexiti...
Pieter Jan't Hoen, Karl Tuyls, Liviu Panait, Sean ...
FOCS
2009
IEEE
13 years 6 months ago
Learning and Smoothed Analysis
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua T...
ILP
2004
Springer
14 years 2 months ago
Learning Ensembles of First-Order Clauses for Recall-Precision Curves: A Case Study in Biomedical Information Extraction
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. Our research has focused on Information Extraction (IE), a task that typically invol...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik