Sciweavers

5860 search results - page 780 / 1172
» Learning and Domain Adaptation
Sort
View
COLT
2008
Springer
15 years 8 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 8 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...
ESANN
2007
15 years 8 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 8 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
FLAIRS
2003
15 years 8 months ago
Information Filtering Using the Dynamics of the User Profile
This paper presents an adaptive algorithm for learning the user profile. The user profile is learned incrementally and continuously based on user’s initial profile, his actions ...
Costin Barbu, Marin Simina