Grant: Discovery Grants Program - Individual
University of Toronto
$60,000.00
New Directions in Complexity Theory
FY 2017-18
Summary
Computational complexity studies the inherent limits of computation, in terms of resources such as time,space, randomness, and nondeterminism, and how these resources arerelated.Proof complexity (the study of propositional proofs) istightly connected to complexity theory: methods fromcommunication complexity and circuit complexity have been heavilyused to obtain proof complexity lower bounds, and conversely lower bounds in proof complexity can be used to rule out largeclasses of natural algorithms for solving optimization problems. Ipropose to attack several new directions in complexity theory and proof complexity.In recent work we have developed the hardness escalation method in communication complexity, and used this method to prove a variety of new circuit lower bounds (i.e., the best known monotone depth lower bounds, as well as the first exponential-size lower bounds for monotone span programs and secret sharing schemes.) This has been quite successful so far, and many problems remain to be studied. For example, we would like to prove a hardness escalation theorem for randomized (BPP) communication, which should lead to new circuit lower bounds.Secondly, I want to prove super-quadratic lower bounds for branching programs and comparator circuits, breaking the longstanding barrier from the 1960's.Thirdly, in proof complexity, I want toprove size lower boundsfor Cutting Planes proof systems (and related matrix cut systems),and I want to further develop a new connection between algebraic circuit complexity andproof complexity that I initiated with Grochow. Using this approach, I hope to prove lower bounds for AC0[p]-Frege systems,a long-standing open problem in proof complexity. My second research area aims to understand andto develop mathematical solutions for several inter-related issues that arise from large data:privacy, fairness, and controlling false discovery in adaptive data analysis.The first topic is data privacy -- how can sensitive but important data (such as census data or medical records) beused for the good of society, while simultaneously protectingprivacy? Differential privacy is a promising approach and has resulted in a toolbox ofalgorithms for privatizing data. I propose to continue to work in this area, to make the methodsmore usable in practice as well as to discover links to related areas where stability is important (such as machine learning, and adaptive data analysis). A related issue is fairness : with increasing reliance on learning algorithms to make decisions,how can we be sure that these decisions are fairand not a result of an underlying bias?We have made partial progress on some ofthese questions (fairness in classification, and generalization in adaptivedata analysis) but have only begun to scratch the surface.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2017-06399
Name nom
Pitassi, Toniann
Department département
Computer Science (St. George Campus) - Computer Science (St. George Campus)
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2017
Competition year année de concours
2017
Award amount
60000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2703
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Complexity
Research subject fr
Complexité
Partie
1
Nb partie
5
Application title
New Directions in Complexity Theory
Keyword
NSERC
Application summary
Computational complexity studies the inherent limits of computation, in terms of resources such as time,space, randomness, and nondeterminism, and how these resources arerelated.Proof complexity (the study of propositional proofs) istightly connected to complexity theory: methods fromcommunication complexity and circuit complexity have been heavilyused to obtain proof complexity lower bounds, and conversely lower bounds in proof complexity can be used to rule out largeclasses of natural algorithms for solving optimization problems. Ipropose to attack several new directions in complexity theory and proof complexity.In recent work we have developed the hardness escalation method in communication complexity, and used this method to prove a variety of new circuit lower bounds (i.e., the best known monotone depth lower bounds, as well as the first exponential-size lower bounds for monotone span programs and secret sharing schemes.) This has been quite successful so far, and many problems remain to be studied. For example, we would like to prove a hardness escalation theorem for randomized (BPP) communication, which should lead to new circuit lower bounds.Secondly, I want to prove super-quadratic lower bounds for branching programs and comparator circuits, breaking the longstanding barrier from the 1960's.Thirdly, in proof complexity, I want toprove size lower boundsfor Cutting Planes proof systems (and related matrix cut systems),and I want to further develop a new connection between algebraic circuit complexity andproof complexity that I initiated with Grochow. Using this approach, I hope to prove lower bounds for AC0[p]-Frege systems,a long-standing open problem in proof complexity. My second research area aims to understand andto develop mathematical solutions for several inter-related issues that arise from large data:privacy, fairness, and controlling false discovery in adaptive data analysis.The first topic is data privacy -- how can sensitive but important data (such as census data or medical records) beused for the good of society, while simultaneously protectingprivacy? Differential privacy is a promising approach and has resulted in a toolbox ofalgorithms for privatizing data. I propose to continue to work in this area, to make the methodsmore usable in practice as well as to discover links to related areas where stability is important (such as machine learning, and adaptive data analysis). A related issue is fairness : with increasing reliance on learning algorithms to make decisions,how can we be sure that these decisions are fairand not a result of an underlying bias?We have made partial progress on some ofthese questions (fairness in classification, and generalization in adaptivedata analysis) but have only begun to scratch the surface.