Sciweavers

ICML
2009
IEEE
15 years 28 days ago
Boosting with structural sparsity
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
John Duchi, Yoram Singer
ICML
2009
IEEE
15 years 28 days ago
Structure learning of Bayesian networks using constraints
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
Cassio Polpo de Campos, Zhi Zeng, Qiang Ji
ICML
2009
IEEE
15 years 28 days ago
Blockwise coordinate descent procedures for the multi-task lasso, with applications to neural semantic basis discovery
We develop a cyclical blockwise coordinate descent algorithm for the multi-task Lasso that efficiently solves problems with thousands of features and tasks. The main result shows ...
Han Liu, Mark Palatucci, Jian Zhang
ICML
2009
IEEE
15 years 28 days ago
Curriculum learning
Humans and animals learn much better when the examples are not randomly presented but organized in a meaningful order which illustrates gradually more concepts, and gradually more ...
Jérôme Louradour, Jason Weston, Ronan...
ICML
2009
IEEE
15 years 28 days ago
The Bayesian group-Lasso for analyzing contingency tables
Group-Lasso estimators, useful in many applications, suffer from lack of meaningful variance estimates for regression coefficients. To overcome such problems, we propose a full Ba...
Sudhir Raman, Thomas J. Fuchs, Peter J. Wild, Edga...
ICML
2009
IEEE
15 years 28 days ago
The graphlet spectrum
Risi Imre Kondor, Nino Shervashidze, Karsten M. Bo...
ICML
2009
IEEE
15 years 28 days ago
Large-scale deep unsupervised learning using graphics processors
The promise of unsupervised learning methods lies in their potential to use vast amounts of unlabeled data to learn complex, highly nonlinear models with millions of free paramete...
Rajat Raina, Anand Madhavan, Andrew Y. Ng
ICML
2009
IEEE
15 years 28 days ago
Convex variational Bayesian inference for large scale generalized linear models
We show how variational Bayesian inference can be implemented for very large generalized linear models. Our relaxation is proven to be a convex problem for any log-concave model. ...
Hannes Nickisch, Matthias W. Seeger
ICML
2009
IEEE
15 years 28 days ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng