1062 search results - page 1 / 213 » Sublinear Optimization for Machine Learning |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
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 ...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
Clustering is of central importance in a number of disciplines including Machine Learning, Statistics, and Data Mining. This paper has two foci: 1 It describes how existing algori...
VLDB
2006
ACM
14 years 5 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
IACR
2011
12 years 5 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...