Sciweavers

234 search results - page 19 / 47
» Rademacher Margin Complexity
Sort
View
JMLR
2012
11 years 9 months ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
TEC
2010
173views more  TEC 2010»
13 years 2 months ago
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
CCECE
2006
IEEE
14 years 1 months ago
Group-Optimal Linear Space-Time Multiuser Detection
Multiuser detection (MUD) techniques are known to improve the performance of CDMA cellular communication systems. This performance improvement usually comes at a large computation...
Benoit Pelletier, Benoît Champagne
JMLR
2008
140views more  JMLR 2008»
13 years 7 months ago
Aggregation of SVM Classifiers Using Sobolev Spaces
This paper investigates statistical performances of Support Vector Machines (SVM) and considers the problem of adaptation to the margin parameter and to complexity. In particular ...
Sébastien Loustau
JMLR
2006
137views more  JMLR 2006»
13 years 7 months ago
Bounds for Linear Multi-Task Learning
Abstract. We give dimension-free and data-dependent bounds for linear multi-task learning where a common linear operator is chosen to preprocess data for a vector of task speci...c...
Andreas Maurer