37
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Principles and Practice of Constraint Programming – CP 2007 

      SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT

      other

      Read this book at

      Buy book Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references15

          • Record: found
          • Abstract: found
          • Article: not found

          Sparse multinomial logistic regression: fast algorithms and generalization bounds.

          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 functions used, resulting in better generalization. This paper presents three contributions related to learning sparse classifiers. First, we introduce a true multiclass formulation based on multinomial logistic regression. Second, by combining a bound optimization approach with a component-wise update procedure, we derive fast exact algorithms for learning sparse multiclass classifiers that scale favorably in both the number of training samples and the feature dimensionality, making them applicable even to large data sets in high-dimensional feature spaces. To the best of our knowledge, these are the first algorithms to perform exact multinomial logistic regression with a sparsity-promoting prior. Third, we show how nontrivial generalization bounds can be derived for our classifier in the binary case. Experimental results on standard benchmark data sets attest to the accuracy, sparsity, and efficiency of the proposed methods.
            Bookmark
            • Record: found
            • Abstract: not found
            • Book Chapter: not found

            The Algorithm Selection Problem

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Algorithm portfolios

                Bookmark

                Author and book information

                Book Chapter
                : 712-727
                10.1007/978-3-540-74970-7_50
                08b2cd8f-ee80-4236-a2f6-74144e1faa0e
                History

                Comments

                Comment on this book

                Book chapters

                Similar content5,060

                Cited by14