2026-09-20T09:43:38Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1128182026-06-06T00:55:16Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Gregory Wornell.
Ajjanagadde, Ganesh
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2017-12-20T17:23:55Z
2017-12-20T17:23:55Z
2016
2016
http://hdl.handle.net/1721.1/112818
1014171329
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 51-53).
This thesis explores the problems of learning analysis of variance (ANOVA) decompositions over GF(2) and R, as well as a general regression setup. For the problem of learning ANOVA decompositions, we obtain fundamental limits in the case of GF(2) under both sparsity and degree structures. We show how the degree or sparsity level is a useful measure of the complexity of such models, and in particular how the statistical complexity ranges from linear to exponential in the dimension, thus forming a "learning hierarchy". Furthermore, we discuss the problem in both an "adaptive" as well as a "one-shot" setting, where in the adaptive case query choice can depend on the entire past history. Somewhat surprisingly, we show that the "adaptive" setting does not yield significant statistical gains. In the case of R, under query access, we demonstrate an approach that achieves a similar hierarchy of complexity with respect to the dimension. For the general regression setting, we outline a viewpoint that captures a variety of popular methods based on locality and partitioning of some kind. We demonstrate how "data independent" partitioning may still yield statistically consistent estimators, and illustrate this by a lattice based partitioning approach.
by Ganesh Ajjanagadde.
M.Eng.
53 pages
eng
Massachusetts Institute of Technology
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
A learning hierarchy for classification and regression
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="98ebc971-2bde-4570-b895-37ef6ef32288">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>A learning hierarchy for classification and regression</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2016</PublicationDate>
<Authors>
<Author>
<DisplayName>Ajjanagadde, Ganesh</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>This thesis explores the problems of learning analysis of variance (ANOVA) decompositions over GF(2) and R, as well as a general regression setup. For the problem of learning ANOVA decompositions, we obtain fundamental limits in the case of GF(2) under both sparsity and degree structures. We show how the degree or sparsity level is a useful measure of the complexity of such models, and in particular how the statistical complexity ranges from linear to exponential in the dimension, thus forming a "learning hierarchy". Furthermore, we discuss the problem in both an "adaptive" as well as a "one-shot" setting, where in the adaptive case query choice can depend on the entire past history. Somewhat surprisingly, we show that the "adaptive" setting does not yield significant statistical gains. In the case of R, under query access, we demonstrate an approach that achieves a similar hierarchy of complexity with respect to the dimension. For the general regression setting, we outline a viewpoint that captures a variety of popular methods based on locality and partitioning of some kind. We demonstrate how "data independent" partitioning may still yield statistically consistent estimators, and illustrate this by a lattice based partitioning approach.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>