An error bound based on a worst likely assignment

MaRDI QIDQ3096134zbMATH OpenFDO

Authors Augusto Callejas, Eric Bax

Publication date 8 November 2011

Full work available at URL http://www.jmlr.org/papers/v9/bax08a.html

zbMATH Keywords

dynamic programmingerror boundnearest neighbortransduction

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Stable Transductive Learning
• scientific article; zbMATH DE number 2243369
• Transductive Rademacher complexity and its applications
• Transductive Rademacher Complexity and Its Applications
• Validation of nearest neighbor classifiers

Cited in

(1)

• Speculate-correct error bounds for \(k\)-nearest neighbor classifiers

This page was built for publication: An error bound based on a worst likely assignment

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