Sparseness vs estimating conditional probabilities: some asymptotic results

zbMATH Open1222.68141MaRDI QIDQ3174098FDOQ3174098

Ambuj Tewari, Peter L. Bartlett

Publication date: 12 October 2011

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

Recommendations

• Learning Theory
• 10.1162/1532443041827925
• Sparse probabilistic classifier
• scientific article
• Sparse kernel SVMs via cutting-plane training

zbMATH Keywords

kernel methodssupport vector machinessparsenessestimating conditional probabilities

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited In (12)

• Evidential calibration of binary SVM classifiers
• Asymmetric least squares support vector machine classifiers
• Statistical analysis of kernel-based least-squares density-ratio estimation
• Learning ordinal data
• 10.1162/1532443041827925
• Title not available (Why is that?)
• On the proliferation of support vectors in high dimensions*
• Learning Theory
• Deformation of log-likelihood loss function for multiclass boosting
• Group online adaptive learning
• 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

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)