Sparseness vs estimating conditional probabilities: some asymptotic results

MaRDI QIDQ3174098zbMATH OpenFDO

Authors Peter L. Bartlett, Ambuj Tewari

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v8/bartlett07a.html

zbMATH Keywords

kernel methodssupport vector machinessparsenessestimating conditional probabilities

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning Theory
• 10.1162/1532443041827925
• Sparse probabilistic classifier
• scientific article; zbMATH DE number 5957340
• Sparse kernel SVMs via cutting-plane training

Cited in

(15)

• Evidential calibration of binary SVM classifiers
• On the proliferation of support vectors in high dimensions*
• Group online adaptive learning
• Coherence functions with applications in large-margin classification methods
• Learning ordinal data
• Learning Theory
• Asymmetric least squares support vector machine classifiers
• Deformation of log-likelihood loss function for multiclass boosting
• Sparse probabilistic classifier
• 10.1162/1532443041827925
• Statistical analysis of kernel-based least-squares density-ratio estimation
• Non-crossing large-margin probability estimation and its application to robust SVM via pre\-condi\-tion\-ing
• Confidence sets based on sparse estimators are necessarily large
• An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods
• scientific article; zbMATH DE number 7626737 (Why is no real title available?)

This page was built for publication: Sparseness vs estimating conditional probabilities: some asymptotic results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174098)