Sciweavers

1131 search results - page 21 / 227
» Generalization Improvement in Multi-Objective Learning
Sort
View
JMLR
2012
11 years 10 months ago
Beyond Logarithmic Bounds in Online Learning
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
Francesco Orabona, Nicolò Cesa-Bianchi, Cla...
ICML
2007
IEEE
14 years 8 months ago
Robust multi-task learning with t-processes
Most current multi-task learning frameworks ignore the robustness issue, which means that the presence of "outlier" tasks may greatly reduce overall system performance. ...
Shipeng Yu, Volker Tresp, Kai Yu
SIGIR
2011
ACM
12 years 10 months ago
A boosting approach to improving pseudo-relevance feedback
Pseudo-relevance feedback has proven effective for improving the average retrieval performance. Unfortunately, many experiments have shown that although pseudo-relevance feedback...
Yuanhua Lv, ChengXiang Zhai, Wan Chen
SIAMMAX
2010
189views more  SIAMMAX 2010»
13 years 2 months ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng
WILF
2007
Springer
170views Fuzzy Logic» more  WILF 2007»
14 years 1 months ago
Time-Series Alignment by Non-negative Multiple Generalized Canonical Correlation Analysis
Background: Quantitative analysis of differential protein expressions requires to align temporal elution measurements from liquid chromatography coupled to mass spectrometry (LC/M...
Bernd Fischer, Volker Roth, Joachim M. Buhmann