Sciweavers

3411 search results - page 512 / 683
» Adaptive Transfer Learning
Sort
View
ECTEL
2006
Springer
15 years 5 months ago
A Method for Capitalizing upon and Synthesizing Analyses of Human Interactions
It is often the case that analyses of human interactive activity are lost once an article is written about the results obtained. Although it is clear that corpora are gathered in o...
Annie Corbel, Jean-Jacques Girardot, Kristine Lund
COLT
2008
Springer
15 years 5 months ago
Regret Bounds for Sleeping Experts and Bandits
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
Robert D. Kleinberg, Alexandru Niculescu-Mizil, Yo...
COLT
2008
Springer
15 years 5 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
134
Voted
ESANN
2007
15 years 5 months ago
Estimation of tangent planes for neighborhood graph correction
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
Karina Zapien Arreola, Gilles Gasso, Stépha...
FLAIRS
2006
15 years 5 months ago
Managing Student Emotions in Intelligent Tutoring Systems
1 In the classic educational context, observing and identifying learner's emotional response allow the teacher to adapt the lesson, with the aim of improving the quality of th...
Roger Nkambou