Sciweavers

148 search results - page 25 / 30
» icml 2010
Sort
View
ICML
2010
IEEE
14 years 47 min ago
Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...
Niranjan Srinivas, Andreas Krause, Sham Kakade, Ma...
ICML
2010
IEEE
14 years 41 min ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
ICML
2010
IEEE
14 years 39 min ago
Proximal Methods for Sparse Hierarchical Dictionary Learning
We propose to combine two approaches for modeling data admitting sparse representations: on the one hand, dictionary learning has proven effective for various signal processing ta...
Rodolphe Jenatton, Julien Mairal, Guillaume Obozin...
ICML
2010
IEEE
14 years 55 min ago
Non-Local Contrastive Objectives
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...
David Vickrey, Cliff Chiung-Yu Lin, Daphne Koller
ICML
2010
IEEE
14 years 48 min ago
Active Learning for Networked Data
We introduce a novel active learning algorithm for classification of network data. In this setting, training instances are connected by a set of links to form a network, the label...
Mustafa Bilgic, Lilyana Mihalkova, Lise Getoor