Staff View
Optimization for sparse and accurate classifiers

Descriptive

TypeOfResource
Text
TitleInfo (ID = T-1)
Title
Optimization for sparse and accurate classifiers
SubTitle
PartName
PartNumber
NonSort
Identifier (displayLabel = ); (invalid = )
ETD_2228
Identifier (type = hdl)
http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052113
Language (objectPart = )
LanguageTerm (authority = ISO639-2); (type = code)
eng
Genre (authority = marcgt)
theses
Subject (ID = SBJ-1); (authority = RUETD)
Topic
Operations Research
Subject (ID = SBJ-2); (authority = ETD-LCSH)
Topic
Mathematical optimization
Abstract
Classification and supervised learning problems in general aim to choose a function that best describes a relation between a set of observed attributes and their corresponding outputs. We focus on binary classification, where the output is a binary response variable. In this dissertation, we seek motivation within statistical learning theory, which attempts to estimate how well a classification function generalizes with respect to unseen data in a probabilistic setting.
We study linear programming formulations for finding a hyperplane that separates two sets of points. Such formulations were initially given by Mangasarian (1965) for the separable case, and more recently extended by "soft margin'' formulations that maximize the margin of separation subject to a penalty proportional to the sum of margin violations. LP-Boost is a boosting algorithm which solves the large scale linear program in a high dimensional space of features using a column generation solution technique.
While many authors have developed different boosting algorithms that assume the existence of effective base learning algorithms for generating a feature or base classifier (e.g., solving the pricing problem with a column generation approach), there has not been much work done to propose such algorithms. In this dissertation, we propose a branch-and-bound algorithm for finding a Boolean monomial that best agrees with the given set of data. This problem has been known as maximum monomial agreement and has been mostly studied in the computational complexity and learning communities in the context of negative computational complexity results. Here we propose an algorithm that finds the monomial that best agrees with the given data and show that it is computationally efficient in practice for UCI datasets.
Revisiting the problem of finding weighted voting classifiers, we consider the problem of balancing the sparsity of the vector of weights and accuracy with respect to the given the training data. It has been suggested by several authors to minimize the L1-norm of the normal vector of the separating hyperplane in order to find sparse solutions. In contrast, we formulate the discrete optimization problem of minimizing the sum of disagreements of a weighted voting classifier and a penalty proportional to the number of nonzero components of the hyperplane's normal vector. The problem that we propose extends the NP-hard Minimum Disagreement Halfspace problem studied in computational learning theory. We are able to formulate this problem as a Mixed Integer Linear Program (MILP), and show that the continuous relaxation of the MILP is equivalent to the well-known L1-norm minimizing LP for finding weighted voting classifiers. We proceed by suggesting novel cutting planes to tighten the continuous relaxation. Finally, we propose and test a novel boosting algorithm that solves the relaxation by dynamic generation of columns and cuts. The algorithm used for generating the columns in this procedure generalizes our algorithm for maximum monomial agreement. In our experiments with the novel MILP relaxation, we demonstrate that our formulation, as well as solution technique, provide an effective approach for constructing sparse and accurate classifiers, and balancing the tradeoff between the two.
PhysicalDescription
Form (authority = gmd)
electronic resource
Extent
viii, 89 p. : ill.
InternetMediaType
application/pdf
InternetMediaType
text/xml
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references (p. 83-87)
Note (type = statement of responsibility)
by Noam Goldberg
Name (ID = NAME-1); (type = personal)
NamePart (type = family)
Goldberg
NamePart (type = given)
Noam
NamePart (type = termsOfAddress)
NamePart (type = date)
1974-
Role
RoleTerm (authority = RULIB); (type = )
author
Description
DisplayForm
Noam Goldberg
Name (ID = NAME-2); (type = personal)
NamePart (type = family)
Eckstein
NamePart (type = given)
Jonathan
Role
RoleTerm (authority = RULIB); (type = )
chair
Affiliation
Advisory Committee
DisplayForm
Jonathan Eckstein
Name (ID = NAME-3); (type = personal)
NamePart (type = family)
Boros
NamePart (type = given)
Endre
Role
RoleTerm (authority = RULIB); (type = )
internal member
Affiliation
Advisory Committee
DisplayForm
Endre Boros
Name (ID = NAME-4); (type = personal)
NamePart (type = family)
Kantor
NamePart (type = given)
Paul
Role
RoleTerm (authority = RULIB); (type = )
internal member
Affiliation
Advisory Committee
DisplayForm
Paul Kantor
Name (ID = NAME-5); (type = personal)
NamePart (type = family)
Stratila
NamePart (type = given)
Dan
Role
RoleTerm (authority = RULIB); (type = )
internal member
Affiliation
Advisory Committee
DisplayForm
Dan Stratila
Name (ID = NAME-6); (type = personal)
NamePart (type = family)
Schapire
NamePart (type = given)
Robert
Role
RoleTerm (authority = RULIB); (type = )
outside member
Affiliation
Advisory Committee
DisplayForm
Robert Schapire
Name (ID = NAME-1); (type = corporate)
NamePart
Rutgers University
Role
RoleTerm (authority = RULIB); (type = )
degree grantor
Name (ID = NAME-2); (type = corporate)
NamePart
Graduate School - New Brunswick
Role
RoleTerm (authority = RULIB); (type = )
school
OriginInfo
DateCreated (point = ); (qualifier = exact)
2010
DateOther (qualifier = exact); (type = degree)
2010-01
Place
PlaceTerm (type = code)
xx
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
RelatedItem (type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier (type = local)
rucore19991600001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/T3DR2VN1
Genre (authority = ExL-Esploro)
ETD doctoral
Back to the top

Rights

RightsDeclaration (AUTHORITY = GS); (ID = rulibRdec0006)
The author owns the copyright to this work.
Copyright
Status
Copyright protected
Notice
Note
Availability
Status
Open
Reason
Permission or license
Note
RightsHolder (ID = PRH-1); (type = personal)
Name
FamilyName
Goldberg
GivenName
Noam
Role
Copyright Holder
RightsEvent (ID = RE-1); (AUTHORITY = rulib)
Type
Permission or license
Label
Place
DateTime
2009-10-20 15:21:11
Detail
AssociatedEntity (ID = AE-1); (AUTHORITY = rulib)
Role
Copyright holder
Name
Noam Goldberg
Affiliation
Rutgers University. Graduate School - New Brunswick
AssociatedObject (ID = AO-1); (AUTHORITY = rulib)
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Back to the top

Technical

ContentModel
ETD
MimeType (TYPE = file)
application/pdf
MimeType (TYPE = container)
application/x-tar
FileSize (UNIT = bytes)
942080
Checksum (METHOD = SHA1)
ab30dc0d5a2071873ad01aa194dee306fec72fdf
Back to the top
Version 8.4.8
Rutgers University Libraries - Copyright ©2022