Sciweavers

ICML
2010
IEEE
13 years 8 months ago
Submodular Dictionary Selection for Sparse Representation
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
Andreas Krause, Volkan Cevher
ICML
2010
IEEE
13 years 8 months ago
A Language-based Approach to Measuring Scholarly Impact
Identifying the most influential documents in a corpus is an important problem in many fields, from information science and historiography to text summarization and news aggregati...
Sean Gerrish, David M. Blei
ICML
2010
IEEE
13 years 8 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
ICML
2010
IEEE
13 years 8 months ago
Robust Subspace Segmentation by Low-Rank Representation
We propose low-rank representation (LRR) to segment data drawn from a union of multiple linear (or affine) subspaces. Given a set of data vectors, LRR seeks the lowestrank represe...
Guangcan Liu, Zhouchen Lin, Yong Yu
ICML
2010
IEEE
13 years 8 months ago
Gaussian Process Change Point Models
We combine Bayesian online change point detection with Gaussian processes to create a nonparametric time series model which can handle change points. The model can be used to loca...
Yunus Saatci, Ryan Turner, Carl Edward Rasmussen
ICML
2010
IEEE
13 years 8 months ago
On learning with kernels for unordered pairs
We propose and analyze two strategies to learn over unordered pairs with kernels, and provide a common theoretical framework to compare them. The strategies are related to methods...
Martial Hue, Jean-Philippe Vert
ICML
2010
IEEE
13 years 8 months ago
Distance dependent Chinese restaurant processes
We develop the distance dependent Chinese restaurant process (CRP), a flexible class of distributions over partitions that allows for nonexchangeability. This class can be used to...
David M. Blei, Peter Frazier
ICML
2010
IEEE
13 years 8 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos
ICML
2010
IEEE
13 years 8 months ago
Interactive Submodular Set Cover
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
Andrew Guillory, Jeff Bilmes
ICML
2010
IEEE
13 years 8 months ago
Rectified Linear Units Improve Restricted Boltzmann Machines
Restricted Boltzmann machines were developed using binary stochastic hidden units. These can be generalized by replacing each binary unit by an infinite number of copies that all ...
Vinod Nair, Geoffrey E. Hinton