@COMMENT This file was generated by bib2html.pl <https://sourceforge.net/projects/bib2html/> version 0.94
@COMMENT written by Patrick Riley <http://sourceforge.net/users/patstg/>
@COMMENT This file came from Martha White's publication directory www.cs.ualberta.ca/~whitem/research
@InProceedings(11aaai-sparse,
  Title = "Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions",
  Author = "Xinhua Zhang, Yaoliang Yu, Martha White, Ruitong Huang, Dale Schuurmans",
  Abstract="Automated feature discovery is a fundamental problem in machine learning.
Although classical feature discovery methods do not guarantee optimal solutions in general, it has been recently noted that certain subspace learning and sparse coding problems can be solved efficiently, provided the number of features is not restricted a priori. We provide an extended characterization of this optimality result and describe the nature of the solutions under an expanded set of practical contexts. In particular, we apply the framework to a semi-supervised learning problem, and demonstrate that feature discovery can co-occur with input reconstruction and supervised training while still admitting globally optimal solutions. A comparison to existing semi-supervised feature discovery methods shows improved generalization and efficiency.",
  Year = "2011",
  Booktitle = "Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI)",
  AcceptRate = "24.8\%",
  AcceptNumbers = "242 of 975"
  bib2html_dl_pdf="../publications/11aaai-sparse.pdf"
)