2223 search results - page 78 / 445 » Implicit Online Learning |
140
click to vote
JSAC
2010
15 years 2 months ago
2010
Abstract—In this paper, we study how to optimize the transmission decisions of nodes aimed at supporting mission-critical applications, such as surveillance, security monitoring,...
193
click to vote
JMLR
2012
13 years 7 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...
144
click to vote
CIKM
2010
Springer
15 years 3 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...
136
click to vote
AIED
2005
Springer
15 years 10 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...
122
click to vote
CVPR
2007
IEEE
16 years 6 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...