Sciweavers

76 search results - page 11 / 16
» Negative Results for Active Learning with Convex Losses
Sort
View
CORR
2012
Springer
232views Education» more  CORR 2012»
12 years 3 months ago
Smoothing Proximal Gradient Method for General Structured Sparse Learning
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input...
Xi Chen, Qihang Lin, Seyoung Kim, Jaime G. Carbone...
JMLR
2008
188views more  JMLR 2008»
13 years 7 months ago
Maximal Causes for Non-linear Component Extraction
We study a generative model in which hidden causes combine competitively to produce observations. Multiple active causes combine to determine the value of an observed variable thr...
Jörg Lücke, Maneesh Sahani
COLT
1999
Springer
14 years 7 days ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
FSKD
2008
Springer
174views Fuzzy Logic» more  FSKD 2008»
13 years 9 months ago
A Hybrid Re-sampling Method for SVM Learning from Imbalanced Data Sets
Support Vector Machine (SVM) has been widely studied and shown success in many application fields. However, the performance of SVM drops significantly when it is applied to the pr...
Peng Li, Pei-Li Qiao, Yuan-Chao Liu
BMCBI
2008
228views more  BMCBI 2008»
13 years 8 months ago
Adaptive diffusion kernel learning from biological networks for protein function prediction
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...
Liang Sun, Shuiwang Ji, Jieping Ye