1955 search results - page 81 / 391 » Online Multitask Learning |
151
click to vote
JMLR
2012
13 years 3 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
108
Voted
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
Traditional machine-learned ranking algorithms for web search are trained in batch mode, which assume static relevance of documents for a given query. Although such a batch-learni...
101
click to vote
AIED
2005
Springer
15 years 6 months ago
2005
Springer
Abundance of user contributions does not necessarily indicate sustainability of an online community. On the contrary, excessive contributions in the systems may result in informati...
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper, we introduce the semantic network model (SNM), a generalization of the hidden Markov model (HMM) that uses factorization of state transition probabilities to reduce...
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Recent research in object recognition has demonstrated the advantages of representing objects and scenes through localized patterns such as small image templates. In this paper we...