Sciweavers

7978 search results - page 584 / 1596
» Combining shared-coin algorithms
Sort
View
AMAI
2011
Springer
14 years 7 months ago
Multi-armed bandits with episode context
A multi-armed bandit episode consists of n trials, each allowing selection of one of K arms, resulting in payoff from a distribution over [0, 1] associated with that arm. We assum...
Christopher D. Rosin
DAC
2011
ACM
14 years 7 months ago
Supervised design space exploration by compositional approximation of Pareto sets
Technology scaling allows the integration of billions of transistors on the same die but CAD tools struggle in keeping up with the increasing design complexity. Design productivit...
Hung-Yi Liu, Ilias Diakonikolas, Michele Petracca,...
JMLR
2012
13 years 9 months ago
Random Search for Hyper-Parameter Optimization
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
James Bergstra, Yoshua Bengio
KDD
2012
ACM
229views Data Mining» more  KDD 2012»
13 years 9 months ago
Finding trendsetters in information networks
Influential people have an important role in the process of information diffusion. However, there are several ways to be influential, for example, to be the most popular or the...
Diego Sáez-Trumper, Giovanni Comarela, Virg...
CVPR
2009
IEEE
17 years 2 months ago
Epitomized Priors for Multi-labeling Problems
Image parsing remains difficult due to the need to combine local and contextual information when labeling a scene. We approach this problem by using the epitome as a prior over ...
Jonathan Warrell, Simon J. D. Prince, Alastair P. ...