Sciweavers

267 search results - page 6 / 54
» Convex optimization for the design of learning machines
Sort
View
ICML
2004
IEEE
16 years 1 days ago
Multiple kernel learning, conic duality, and the SMO algorithm
While classical kernel-based classifiers are based on a single kernel, in practice it is often desirable to base classifiers on combinations of multiple kernels. Lanckriet et al. ...
Francis R. Bach, Gert R. G. Lanckriet, Michael I. ...
ICML
2009
IEEE
16 years 1 days ago
A convex formulation for learning shared structures from multiple tasks
Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. In this paper, we consider the problem of learning shared s...
Jianhui Chen, Lei Tang, Jun Liu, Jieping Ye
AAAI
2011
13 years 11 months ago
Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
Xinhua Zhang, Yaoliang Yu, Martha White, Ruitong H...
COLT
1997
Springer
15 years 3 months ago
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...
Dimitris Bertsimas, David Gamarnik, John N. Tsitsi...
NIPS
2007
15 years 19 days ago
Convex Learning with Invariances
Incorporating invariances into a learning algorithm is a common problem in machine learning. We provide a convex formulation which can deal with arbitrary loss functions and arbit...
Choon Hui Teo, Amir Globerson, Sam T. Roweis, Alex...