701 search results - page 96 / 141 » Self Bounding Learning Algorithms |
130
Voted
NIPS
2008
15 years 2 months ago
2008
This paper addresses the important tradeoff between privacy and learnability, when designing algorithms for learning from private databases. We focus on privacy-preserving logisti...
JMLR
2010
14 years 7 months ago
2010
Hsu et al. (2009) recently proposed an efficient, accurate spectral learning algorithm for Hidden Markov Models (HMMs). In this paper we relax their assumptions and prove a tighte...
144
Voted
KDD
2012
ACM
13 years 3 months ago
2012
ACM
Multi-task learning (MTL) aims to improve the performance of multiple related tasks by exploiting the intrinsic relationships among them. Recently, multi-task feature learning alg...
91
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
We are interested in supervised ranking with the following twist: our goal is to design algorithms that perform especially well near the top of the ranked list, and are only requir...
78
Voted
NIPS
2007
15 years 2 months ago
2007
We present a globally convergent method for regularized risk minimization problems. Our method applies to Support Vector estimation, regression, Gaussian Processes, and any other ...