Sciweavers

76 search results - page 4 / 16
» Negative Results for Active Learning with Convex Losses
Sort
View
IMC
2007
ACM
13 years 8 months ago
On optimal probing for delay and loss measurement
Packet delay and loss are two fundamental measures of performance. Using active probing to measure delay and loss typically involves sending Poisson probes, on the basis of the PA...
François Baccelli, Sridhar Machiraju, Darry...
COLT
2010
Springer
13 years 5 months ago
Convex Games in Banach Spaces
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
Karthik Sridharan, Ambuj Tewari
ALT
2008
Springer
14 years 4 months ago
Active Learning of Group-Structured Environments
The question investigated in this paper is to what extent an input representation influences the success of learning, in particular from the point of view of analyzing agents that...
Gábor Bartók, Csaba Szepesvár...
ICML
2008
IEEE
14 years 7 months ago
Random classification noise defeats all convex potential boosters
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
Philip M. Long, Rocco A. Servedio
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 7 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...