Sciweavers

145 search results - page 18 / 29
» Adversarial learning
Sort
View
ECML
2005
Springer
15 years 4 months ago
Thwarting the Nigritude Ultramarine: Learning to Identify Link Spam
The page rank of a commercial web site has an enormous economic impact because it directly influences the number of potential customers that find the site as a highly ranked sear...
Isabel Drost, Tobias Scheffer
FOCS
2008
IEEE
15 years 5 months ago
Hardness of Minimizing and Learning DNF Expressions
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
Subhash Khot, Rishi Saket
ICML
2009
IEEE
15 years 11 months ago
Piecewise-stationary bandit problems with side observations
We consider a sequential decision problem where the rewards are generated by a piecewise-stationary distribution. However, the different reward distributions are unknown and may c...
Jia Yuan Yu, Shie Mannor
COLT
2008
Springer
15 years 11 days 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...
ALT
2010
Springer
15 years 3 days ago
A Regularization Approach to Metrical Task Systems
We address the problem of constructing randomized online algorithms for the Metrical Task Systems (MTS) problem on a metric against an oblivious adversary. Restricting our attenti...
Jacob Abernethy, Peter L. Bartlett, Niv Buchbinder...