Sciweavers

20 search results - page 1 / 4
» BoltzRank: learning to maximize expected ranking gain
Sort
View
ICML
2009
IEEE
14 years 5 months ago
BoltzRank: learning to maximize expected ranking gain
Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to o...
Maksims Volkovs, Richard S. Zemel
IAT
2010
IEEE
13 years 2 months ago
Selecting Operator Queries Using Expected Myopic Gain
When its human operator cannot continuously supervise (much less teleoperate) an agent, the agent should be able to recognize its limitations and ask for help when it risks making...
Robert Cohn, Michael Maxim, Edmund H. Durfee, Sati...
ICML
2009
IEEE
14 years 5 months ago
Optimized expected information gain for nonlinear dynamical systems
This paper addresses the problem of active model selection for nonlinear dynamical systems. We propose a novel learning approach that selects the most informative subset of time-d...
Alberto Giovanni Busetto, Cheng Soon Ong, Joachim ...
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
13 years 6 months ago
On-Line Difference Maximization
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
Ming-Yang Kao, Stephen R. Tate
CIKM
2010
Springer
13 years 3 months ago
Learning to rank relevant and novel documents through user feedback
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...
Abhimanyu Lad, Yiming Yang