Sciweavers

3517 search results - page 54 / 704
» Online Learning with Queries
Sort
View
ALT
2002
Springer
15 years 8 months ago
The Complexity of Learning Concept Classes with Polynomial General Dimension
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
Johannes Köbler, Wolfgang Lindner
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
15 years 3 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
ICML
2008
IEEE
16 years 19 days ago
Learning to learn implicit queries from gaze patterns
In the absence of explicit queries, an alternative is to try to infer users' interests from implicit feedback signals, such as clickstreams or eye tracking. The interests, fo...
Antti Ajanki, Kai Puolamäki, Samuel Kaski
AH
2006
Springer
15 years 5 months ago
Assessment of Motivation in Online Learning Environments
This research outline refers to the assessment of motivation in online learning environments. It includes a presentation of previous approaches, most of them based on Keller’s AR...
Mihaela Cocea
NIPS
2003
15 years 1 months ago
Online Learning of Non-stationary Sequences
We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...
Claire Monteleoni, Tommi Jaakkola