The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
We present a bandit algorithm, SAO (Stochastic and Adversarial Optimal), whose regret is, essentially, optimal both for adversarial rewards and for stochastic rewards. Specifical...
We present a minimax framework for classification that considers stochastic adversarial perturbations to the training data. We show that for binary classification it is equivale...
Over the past several decades, the compiler research community has developed a number of sophisticated and powerful algorithms for a varierty of code improvements. While there are...
Bruce R. Childers, Jack W. Davidson, Mary Lou Soff...
We report on an investigation of the learning of coordination in cooperative multi-agent systems. Specifically, we study solutions that are applicable to independent agents i.e. ...
Spiros Kapetanakis, Daniel Kudenko, Malcolm J. A. ...