Sciweavers

73 search results - page 3 / 15
» Sparse Bayesian Learning Based on an Efficient Subset Select...
Sort
View
ICML
2010
IEEE
13 years 7 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
TSMC
2010
13 years 20 days ago
Efficient Sensor Selection for Active Information Fusion
In our previous paper [1], we formalized an active information fusion framework based on dynamic Bayesian networks to provide active information fusion. This paper focuses on a ce...
Yongmian Zhang, Qiang Ji
ICMLA
2009
13 years 3 months ago
Automatic Feature Selection for Model-Based Reinforcement Learning in Factored MDPs
Abstract--Feature selection is an important challenge in machine learning. Unfortunately, most methods for automating feature selection are designed for supervised learning tasks a...
Mark Kroon, Shimon Whiteson
TNN
2010
176views Management» more  TNN 2010»
13 years 20 days ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
ICML
2010
IEEE
13 years 7 months ago
Efficient Selection of Multiple Bandit Arms: Theory and Practice
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
Shivaram Kalyanakrishnan, Peter Stone