Sciweavers

647 search results - page 76 / 130
» Costs of General Purpose Learning
Sort
View
WETICE
2002
IEEE
15 years 9 months ago
A Flexible Architecture for Collaborative Browsing
Collaborative Browsing is a new and promising research area whose purpose is to provide new collaboration schemes among users browsing the Web. To become an efficient collaboratio...
Guillermo de Jesús Hoyos-Rivera, Roberta Li...
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 4 months ago
Efficient Minimization of Decomposable Submodular Functions
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
Peter Stobbe, Andreas Krause
JMLR
2010
135views more  JMLR 2010»
15 years 2 months ago
Bundle Methods for Regularized Risk Minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
Choon Hui Teo, S. V. N. Vishwanathan, Alex J. Smol...
COLT
2006
Springer
15 years 7 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
NIPS
2007
15 years 5 months ago
A New View of Automatic Relevance Determination
Automatic relevance determination (ARD) and the closely-related sparse Bayesian learning (SBL) framework are effective tools for pruning large numbers of irrelevant features leadi...
David P. Wipf, Srikantan S. Nagarajan