Toniann Pitassi

Generating author description...

All published works

Action	Title	Year	Authors
+	Strong vs. Weak Range Avoidance and the Linear Ordering Principle	2024	Oliver Korten Toniann Pitassi
+ PDF Chat	Improving Predictor Reliability with Selective Recalibration	2024	Thomas P. Zollo Zhun Deng Jake C. Snell Toniann Pitassi Richard S. Zemel
+	Stability Is Stable: Connections between Replicability, Privacy, and Adaptive Generalization	2023	Mark Bun Marco Gaboardi Max Hopkins Russell Impagliazzo Rex Lei Toniann Pitassi Satchit Sivakumar Jessica Sorrell
+	Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization	2023	Mark Bun Marco Gaboardi Max Hopkins Russell Impagliazzo Rex Lei Toniann Pitassi Jessica Sorrell Satchit Sivakumar
+	On the algebraic proof complexity of Tensor Isomorphism	2023	Nicola Galesi Joshua A. Grochow Toniann Pitassi Adrian She
+	Optimal Non-Adaptive Cell Probe Dictionaries and Hashing	2023	Kasper Green Larsen Rasmus Pagh Toniann Pitassi Or Zamir
+	An improved protocol for ExactlyN with more than 3 players	2023	Lianna Hambardzumyan Toniann Pitassi Suhail Sherif Morgan Shirley Adi Shraibman
+	Distribution-Free Statistical Dispersion Control for Societal Applications	2023	Zhun Deng Thomas P. Zollo Jake C. Snell Toniann Pitassi Richard S. Zemel
+	Prompt Risk Control: A Rigorous Framework for Responsible Deployment of Large Language Models	2023	Thomas P. Zollo Todd Morrill Zhun Deng Jake C. Snell Toniann Pitassi Richard S. Zemel
+	Reproducibility in learning	2022	Russell Impagliazzo Rex Lei Toniann Pitassi Jessica Sorrell
+ PDF Chat	Tradeoffs for small-depth Frege proofs	2022	Toniann Pitassi Prasanna Ramakrishnan Li-Yang Tan
+	Reproducibility in Learning	2022	Russell Impagliazzo Rex Lei Toniann Pitassi Jessica Sorrell
+	Learning versus Refutation in Noninteractive Local Differential Privacy	2022	Alexander Edmonds Aleksandar Nikolov Toniann Pitassi
+	Quantile Risk Control: A Flexible Framework for Bounding the Probability of High-Loss Predictions	2022	Jake C. Snell Thomas P. Zollo Zhun Deng Toniann Pitassi Richard S. Zemel
+	On the power and limitations of branch and cut	2021	Noah Fleming Mika Göös Russell Impagliazzo Toniann Pitassi Robert Robere Li-Yang Tan Avi Wigderson
+ PDF Chat	Query-to-Communication Lifting Using Low-Discrepancy Gadgets	2021	Arkadev Chattopadhyay Yuval Filmus Sajin Koroth Or Meir Toniann Pitassi
+	Size and Depth Separation in Approximating Benign Functions with Neural Networks	2021	Gal Vardi Daniel Reichman Toniann Pitassi Ohad Shamir
+	On the Power and Limitations of Branch and Cut	2021	Noah Fleming Mika Göös Russell Impagliazzo Toniann Pitassi Robert Robere Li-Yang Tan Avi Wigderson
+	Tradeoffs for small-depth Frege proofs	2021	Toniann Pitassi Prasanna Ramakrishnan Li-Yang Tan
+ PDF Chat	Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity	2020	Susanna F. de Rezende Or Meir Jakob Nordström Toniann Pitassi Robert Robere Marc Vinyals
+ PDF Chat	KRW Composition Theorems via Lifting	2020	Susanna F. de Rezende Or Meir Jakob Nordström Toniann Pitassi Robert Robere
+	Theoretical bounds on estimation error for meta-learning	2020	James Lucas Mengye Ren Irene Raissa Kameni Kameni Toniann Pitassi Richard S. Zemel
+	Causal Modeling for Fairness In Dynamical Systems	2020	Elliot Creager David Madras Toniann Pitassi Richard S. Zemel
+ PDF Chat	Automating cutting planes is NP-hard	2020	Mika Göös Sajin Koroth Ian Mertz Toniann Pitassi
+	Automating Cutting Planes is NP-Hard}	2020	Mika Göös Sajin Koroth Ian Mertz Toniann Pitassi
+	Towards a Complexity-theoretic Understanding of Restarts in SAT solvers	2020	Chunxiao Li Noah Fleming Marc Vinyals Toniann Pitassi Vijay Ganesh
+ PDF Chat	Query-to-Communication Lifting for BPP	2020	Mika Göös Toniann Pitassi Thomas Watson
+	Theoretical bounds on estimation error for meta-learning	2020	James Lucas Mengye Ren Irene Raissa Kameni Kameni Toniann Pitassi Richard S. Zemel
+	KRW Composition Theorems via Lifting	2020	Susanna F. de Rezende Or Meir Jakob Nordström Toniann Pitassi Robert Robere
+	Automating Cutting Planes is NP-Hard}	2020	Mika Göös Sajin Koroth Ian Mertz Toniann Pitassi
+	Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity	2020	Susanna F. de Rezende Or Meir Jakob Nordström Toniann Pitassi Robert Robere Marc Vinyals
+	Query-to-communication lifting for BPP using inner product	2019	Arkadev Chattopadhyay Yuval Filmus Sajin Koroth Or Meir Toniann Pitassi
+	Query-to-Communication Lifting Using Low-Discrepancy Gadgets.	2019	Arkadev Chattopadhyay Yuval Filmus Sajin Koroth Or Meir Toniann Pitassi
+	Fairness through Causal Awareness	2019	David Madras Elliot Creager Toniann Pitassi Richard S. Zemel
+	Flexibly Fair Representation Learning by Disentanglement	2019	Elliot Creager David Madras Jörn-Henrik Jacobsen Marissa A. Weis Kevin Swersky Toniann Pitassi Richard S. Zemel
+	Causal Modeling for Fairness in Dynamical Systems	2019	Elliot Creager David Madras Toniann Pitassi Richard S. Zemel
+	The Surprising Power of Constant Depth Algebraic Proofs.	2019	Russell Impagliazzo Sasank Mouli Toniann Pitassi
+	Query-to-Communication Lifting Using Low-Discrepancy Gadgets	2019	Arkadev Chattopadhyay Yuval Filmus Sajin Koroth Or Meir Toniann Pitassi
+ PDF Chat	Circuit Complexity, Proof Complexity, and Polynomial Identity Testing	2018	Joshua A. Grochow Toniann Pitassi
+	Fairness Through Causal Awareness: Learning Latent-Variable Models for Biased Data.	2018	David Madras Elliot Creager Toniann Pitassi Richard S. Zemel
+	Learning Adversarially Fair and Transferable Representations	2018	David Madras Elliot Creager Toniann Pitassi Richard S. Zemel
+	Predict Responsibly: Increasing Fairness by Learning to Defer	2018	David Madras Toniann Pitassi Richard S. Zemel
+ PDF Chat	Communication Lower Bounds via Critical Block Sensitivity	2018	Mika Göös Toniann Pitassi
+	Learning Adversarially Fair and Transferable Representations	2018	David Madras Elliot Creager Toniann Pitassi Richard S. Zemel
+	On the Communication Complexity of High-Dimensional Permutations	2018	Nati Linial Toniann Pitassi Adi Shraibman
+	Fairness Through Causal Awareness: Learning Latent-Variable Models for Biased Data	2018	David Madras Elliot Creager Toniann Pitassi Richard S. Zemel
+	Predict Responsibly: Increasing Fairness by Learning To Defer	2017	David Madras Toniann Pitassi Richard S. Zemel
+	Stabbing Planes	2017	Paul Beame Noah Fleming Russell Impagliazzo Antonina Kolokolova Denis Pankratov Toniann Pitassi Robert Robere
+ PDF Chat	Query-to-Communication Lifting for BPP	2017	Mika Göös Toniann Pitassi Thomas Watson
+ PDF Chat	Guilt-free data reuse	2017	Cynthia Dwork Vitaly Feldman Moritz Hardt Toniann Pitassi Omer Reingold Aaron Roth
+	Query-to-Communication Lifting for BPP	2017	Mika Göös Toniann Pitassi Thomas Watson
+	Random CNFs are Hard for Cutting Planes	2017	Noah Fleming Denis Pankratov Toniann Pitassi Robert Robere
+	Predict Responsibly: Improving Fairness and Accuracy by Learning to Defer	2017	David Madras Toniann Pitassi Richard S. Zemel
+	Random CNFs are Hard for Cutting Planes.	2017	Noah Fleming Denis Pankratov Toniann Pitassi Robert Robere
+	Query-to-Communication Lifting for BPP	2017	Mika Göös Toniann Pitassi Thomas J. Watson
+	Stabbing Planes	2017	Paul Beame Noah Fleming Russell Impagliazzo Antonina Kolokolova Denis Pankratov Toniann Pitassi Robert Robere
+	The reusable holdout: Preserving validity in adaptive data analysis	2015	Cynthia Dwork Vitaly Feldman Moritz Hardt Toniann Pitassi Omer Reingold Aaron Roth
+ PDF Chat	Preserving Statistical Validity in Adaptive Data Analysis	2015	Cynthia Dwork Vitaly Feldman Moritz Hardt Toniann Pitassi Omer Reingold Aaron Roth
+	Generalization in Adaptive Data Analysis and Holdout Reuse	2015	Cynthia Dwork Vitaly Feldman Moritz Hardt Toniann Pitassi Omer Reingold Aaron Roth
+	Preserving Statistical Validity in Adaptive Data Analysis	2014	Cynthia Dwork Vitaly Feldman Moritz Hardt Toniann Pitassi Omer Reingold Aaron Roth
+ PDF Chat	Circuit Complexity, Proof Complexity, and Polynomial Identity Testing	2014	Joshua A. Grochow Toniann Pitassi
+ PDF Chat	Communication lower bounds via critical block sensitivity	2014	Mika Göös Toniann Pitassi
+	Circuit complexity, proof complexity, and polynomial identity testing	2014	Joshua A. Grochow Toniann Pitassi
+	Circuit complexity, proof complexity, and polynomial identity testing	2014	Joshua A. Grochow Toniann Pitassi
+	Preserving Statistical Validity in Adaptive Data Analysis	2014	Cynthia Dwork Vitaly Feldman Moritz Hardt Toniann Pitassi Omer Reingold Aaron Roth
+	Communication Lower Bounds via Critical Block Sensitivity	2013	Mika Göös Toniann Pitassi
+	Tight Bounds for Set Disjointness in the Message Passing Model	2013	Mark Braverman Faith Ellen Rotem Oshman Toniann Pitassi Vinod Vaikuntanathan
+	Communication Lower Bounds via Critical Block Sensitivity	2013	Mika Göös Toniann Pitassi
+	Value Elimination: Bayesian Inference via Backtracking Search	2012	Fahiem Bacchus Shannon Dalmao Toniann Pitassi
+ PDF Chat	Fairness through awareness	2012	Cynthia Dwork Moritz Hardt Toniann Pitassi Omer Reingold Richard S. Zemel
+	Value Elimination: Bayesian Inference via Backtracking Search	2012	Fahiem Bacchus Shannon Dalmao Toniann Pitassi
+ PDF Chat	Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems	2012	Yu Wu Per Austrin Toniann Pitassi David Liu
+	Fairness Through Awareness	2011	Cynthia Dwork Moritz Hardt Toniann Pitassi Omer Reingold Rich Zemel
+	Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems	2011	Per Austrin Toniann Pitassi Yu Wu
+	Fairness Through Awareness	2011	Cynthia Dwork Moritz Hardt Toniann Pitassi Omer Reingold Rich Zemel
+ PDF Chat	Hardness amplification in proof complexity	2010	Paul Beame Trinh Huynh Toniann Pitassi
+ PDF Chat	Solving #SAT and Bayesian Inference with Backtracking Search	2009	Fahiem Bacchus Shannon Dalmao Toniann Pitassi
+	Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures	2009	Toniann Pitassi Nathan Segerlind
+	Exponential lower bounds and Integrality Gaps for Tree-like Lovász-Schrijver Procedures	2009	Toniann Pitassi Nathan Segerlind
+	Hardness Amplification in Proof Complexity	2009	Paul Beame Trinh Huynh Toniann Pitassi
+	Separating NOF communication complexity classes RP and NP	2008	Matei David Toniann Pitassi
+	Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy	2007	Konstantinos Georgiou Avner Magen Toniann Pitassi Iannis Tourlakis
+	Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity	2007	Paul Beame Matei David Toniann Pitassi Philipp Woelfel
+ PDF Chat	None	2007	Michael Alekhnovich Jan Johannsen Toniann Pitassi Alasdair Urquhart
+	Lower bounds for Lovasz-Schrijver systems and beyond follow from multiparty communication complexity	2005	Paul Beame Toniann Pitassi Nathan Segerlind
+	Homogenization and the polynomial calculus	2002	Joshua Buresh-Oppenheim Matthew Clegg Russell Impagliazzo Toniann Pitassi
+ PDF Chat	An exponential separation between regular and general resolution	2002	Michael Alekhnovich Jan Johannsen Toniann Pitassi Alasdair Urquhart
+ PDF Chat	An exponential separation between regular and general resolution	2002	Michael Alekhnovich Jan Johannsen Toniann Pitassi Alasdair Urquhart
+	Regular resolution lower bounds for the weak pigeonhole principle	2001	Toniann Pitassi Ran Raz
+	Linear and Negative Resolution are weaker than Resolution	2001	J. Buresh-Oppenheim David G. M. Mitchell Toniann Pitassi
+	Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract).	1999	Samuel R. Buss Dima Grigoriev Russell Impagliazzo Toniann Pitassi
+	Lower bounds for cutting planes proofs with small coefficients	1997	Marı́a Luisa Bonet Toniann Pitassi Ran Raz
+	An exponential separation between the parity principle and the pigeonhole principle	1996	Paul Beame Toniann Pitassi
+	Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs	1996	Paul Beame Russell Impagliazzo Jan Krajı́ček Toniann Pitassi Pavel Pudlák
+	Exponential lower bounds for the tree-like Hajós calculus	1995	Kazuo Iwama Toniann Pitassi

Common Coauthors

Coauthor	Papers Together
Richard S. Zemel	18
Mika Göös	13
Russell Impagliazzo	12
David Madras	11
Robert Robere	10
Omer Reingold	9
Cynthia Dwork	9
Moritz Hardt	9
Paul Beame	8
Or Meir	8
Elliot Creager	8
Noah Fleming	7
Sajin Koroth	7
Aaron Roth	6
Vitaly Feldman	6
Joshua A. Grochow	5
Jakob Nordström	4
Jessica Sorrell	4
Rex Lei	4
Li-Yang Tan	4
Thomas P. Zollo	4
Arkadev Chattopadhyay	4
Zhun Deng	4
Yuval Filmus	4
Susanna F. de Rezende	4
Jake C. Snell	4
Nathan Segerlind	3
Fahiem Bacchus	3
Michael Alekhnovich	3
Marc Vinyals	3
Ian Mertz	3
Jan Johannsen	3
Alasdair Urquhart	3
Shannon Dalmao	3
Thomas Watson	3
Mark Bun	2
Rich Zemel	2
Irene Raissa Kameni Kameni	2
Marco Gaboardi	2
Antonina Kolokolova	2
Yu Wu	2
Avi Wigderson	2
Mengye Ren	2
Prasanna Ramakrishnan	2
Per Austrin	2
Trinh Huynh	2
Denis Pankratov	2
Ran Raz	2
Matei David	2
Satchit Sivakumar	2

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Edmonds polytopes and a hierarchy of combinatorial problems	1973	Vašek Chvátal	7
+	A Note on Screening Regression Equations	1983	David A. Freedman David A. Freedman	5
+	Multi-party protocols	1983	Ashok Chandra Merrick L. Furst Richard J. Lipton	5
+	Lower bounds for cutting planes proofs with small coefficients	1997	Marı́a Luisa Bonet Toniann Pitassi Ran Raz	5
+	Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs	1996	Paul Beame Russell Impagliazzo Jan Krajı́ček Toniann Pitassi Pavel Pudlák	4
+	On the Dangers of Cross-Validation. An Experimental Evaluation	2008	R. Bharat Rao Glenn Fung Rómer Rosales	4
+ PDF Chat	Communication Lower Bounds via Critical Block Sensitivity	2018	Mika Göös Toniann Pitassi	4
+	Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization	2006	Sayan Mukherjee Partha Niyogi Tomaso Poggio Ryan Rifkin	4
+	Adam: A Method for Stochastic Optimization	2014	Diederik P. Kingma Jimmy Ba	4
+	The Ladder: A Reliable Leaderboard for Machine Learning Competitions	2015	Avrim Blum Moritz Hardt	4
+ PDF Chat	Outline of an algorithm for integer solutions to linear programs	1958	Ralph E. Gomory	4
+	Counterfactual Fairness	2017	Matt J. Kusner Joshua R. Loftus Chris Russell Ricardo Silva	4
+ PDF Chat	Approximate Constraint Satisfaction Requires Large LP Relaxations	2016	Siu On Chan James R. Lee Prasad Raghavendra David Steurer	4
+ PDF Chat	Pebble Games, Proof Complexity, and Time-Space Trade-offs	2013	Jakob Nordström	4
+ PDF Chat	Preserving Statistical Validity in Adaptive Data Analysis	2015	Cynthia Dwork Vitaly Feldman Moritz Hardt Toniann Pitassi Omer Reingold Aaron Roth	4
+	An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle	1995	Jan Krajı́ček Pavel Pudlák Alan R. Woods	4
+	Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple Testing	1995	Yoav Benjamini Yosef Hochberg	4
+	The complexity of computing the permanent	1979	Leslie G. Valiant	4
+	Equality of Opportunity in Supervised Learning	2016	Moritz Hardt Eric Price Nathan Srebro	3
+ PDF Chat	The Elements of Statistical Learning	2009	Trevor Hastie Robert Tibshirani Jerome H. Friedman	3
+	Generalization in Adaptive Data Analysis and Holdout Reuse	2015	Cynthia Dwork Vitaly Feldman Moritz Hardt Toniann Pitassi Omer Reingold Aaron Roth	3
+	Introduction To Commutative Algebra	2018	Michael Atiyah	3
+	Completeness classes in algebra	1979	Leslie G. Valiant	3
+	Graph minors. X. Obstructions to tree-decomposition	1991	Neil Robertson Paul Seymour	3
+	Context-Specific Independence in Bayesian Networks	2013	Craig Boutilier Nir Friedman Moisés Goldszmidt Daphne Koller	3
+	Semantic Versus Syntactic Cutting Planes	2016	Yuval Filmus Pavel Hrubeš Massimo Lauria	3
+	Algorithmic stability for adaptive data analysis	2016	Raef Bassily Kobbi Nissim Adam Smith Thomas Steinke Uri Stemmer Jonathan Ullman	3
+	Undergraduate Commutative Algebra	1995	Miles Reid	3
+	Learnability, Stability and Uniform Convergence	2010	Shai Shalev‐Shwartz Ohad Shamir Nathan Srebro Karthik Sridharan	3
+	Multiparty Communication Complexity of Disjointness	2008	Arkadev Chattopadhyay Anil Ada	3
+	A criterion for detectingm-regularity	1987	David Bayer Michael Stillman	3
+ PDF Chat	Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs	2000	Alan Frieze Lei Zhao	3
+ PDF Chat	Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model	2008	Troy Lee Adi Shraibman	3
+	Arithmetic circuits: The chasm at depth four gets wider	2012	Pascal Koiran	3
+	On the complexity of computing syzygies	1988	David Bayer Michael Stillman	3
+ PDF Chat	Interactive privacy via the median mechanism	2010	Aaron Roth Tim Roughgarden	3
+	Edge-Disjoint Paths in Expander Graphs	2001	Alan Frieze	3
+ PDF Chat	Fairness through awareness	2012	Cynthia Dwork Moritz Hardt Toniann Pitassi Omer Reingold Richard S. Zemel	3
+	Characterizing Valiant's algebraic complexity classes	2007	Guillaume Malod Natacha Portier	3
+	Improved sparse multivariate polynomial interpolation algorithms	1989	Erich Kaltofen Lakshman Yagati	3
+	More General Queries and Less Generalization Error in Adaptive Data Analysis	2015	Raef Bassily Adam Smith Thomas Steinke Jonathan Ullman	3
+	The complexity of partial derivatives	1983	Walter Bäur Volker Strassen	3
+ PDF Chat	<i>α</i>-Investing: a Procedure for Sequential Control of Expected False Discoveries	2008	Dean P. Foster Robert A. Stine	3
+	What can be computed in algebraic geometry?	1993	Dave Bayer David Mumford	3
+	Membership in polynomial ideals over Q is exponential space complete	2005	Ernst Mayr	3
+ PDF Chat	Complexity of Semi-algebraic Proofs	2002	Dima Grigoriev Edward Hirsch Dmitrii V. Ṗasechnik	3
+	Causal Inference Using Potential Outcomes	2005	Donald B. Rubin	3
+ PDF Chat	Constructions in algebra	1974	A. Seidenberg	3
+	Fields of large transcendence degree generated by values of elliptic functions	1983	David Masser G. Wüstholz	3
+	Hilbert's Nullstellensatz Is in the Polynomial Hierarchy	1996	Pascal Koiran	3