Sciweavers

267 search results - page 29 / 54
» Convex optimization for the design of learning machines
Sort
View
CORR
2006
Springer
130views Education» more  CORR 2006»
13 years 9 months ago
Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...
Christian Gagné, Marc Schoenauer, Mich&egra...
ICML
2009
IEEE
14 years 10 months ago
Uncertainty sampling and transductive experimental design for active dual supervision
Dual supervision refers to the general setting of learning from both labeled examples as well as labeled features. Labeled features are naturally available in tasks such as text c...
Vikas Sindhwani, Prem Melville, Richard D. Lawrenc...
ECCV
2010
Springer
13 years 11 months ago
Learning PDEs for Image Restoration via Optimal Control
Partial differential equations (PDEs) have been successfully applied to many computer vision and image processing problems. However, designing PDEs requires high mathematical skill...
MLG
2007
Springer
14 years 3 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
JMLR
2008
209views more  JMLR 2008»
13 years 9 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger