Sparse multinomial logistic regression: fast algorithms and generalization bounds

Volume: 27, Issue: 6, Pages: 957 - 968
Published: Jun 1, 2005
Abstract
Recently developed methods for learning sparse classifiers are among the state-of-the-art in supervised learning. These methods learn classifiers that incorporate weighted sums of basis functions with sparsity-promoting priors encouraging the weight estimates to be either significantly large or exactly zero. From a learning-theoretic perspective, these methods control the capacity of the learned classifier by minimizing the number of basis...
Paper Details
Title
Sparse multinomial logistic regression: fast algorithms and generalization bounds
Published Date
Jun 1, 2005
Volume
27
Issue
6
Pages
957 - 968
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.