Toniann Pitassi

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 121

Top Venues

Electron. Colloquium Comput. Complex.

CoRR

STOC

FOCS

Publications

Oliver Korten, Toniann Pitassi
Strong vs. Weak Range Avoidance and the Linear Ordering Principle. Electron. Colloquium Comput. Complex. (2024)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
KRW Composition Theorems via Lifting. Comput. Complex. 33 (1) (2024)
Thomas P. Zollo, Todd Morrill, Zhun Deng, Jake Snell, Toniann Pitassi, Richard S. Zemel
Prompt Risk Control: A Rigorous Framework for Responsible Deployment of Large Language Models. ICLR (2024)
Noah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere
Black-Box PPP is not Turing-Closed. Electron. Colloquium Comput. Complex. (2024)
Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, Or Zamir
Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. ICALP (2024)
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
An Improved Protocol for ExactlyN with More Than 3 Players. ITCS (2024)
Noah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere
Black-Box PPP Is Not Turing-Closed. STOC (2024)
Nicola Galesi, Joshua A. Grochow, Toniann Pitassi, Adrian She
On the Algebraic Proof Complexity of Tensor Isomorphism. CCC (2023)
Jake Snell, Thomas P. Zollo, Zhun Deng, Toniann Pitassi, Richard S. Zemel
Quantile Risk Control: A Flexible Framework for Bounding the Probability of High-Loss Predictions. ICLR (2023)
Toniann Pitassi, Morgan Shirley, Adi Shraibman
The Strength of Equality Oracles in Communication. ITCS (2023)
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
An improved protocol for ExactlyN with more than 3 players. Electron. Colloquium Comput. Complex. (2023)
Zhun Deng, Thomas P. Zollo, Jake Snell, Toniann Pitassi, Richard S. Zemel
Distribution-Free Statistical Dispersion Control for Societal Applications. NeurIPS (2023)
Nicola Galesi, Joshua A. Grochow, Toniann Pitassi, Adrian She
On the algebraic proof complexity of Tensor Isomorphism. CoRR (2023)
Kasper Green Larsen, Rasmus Pagh, Toniann Pitassi, Or Zamir
Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. CoRR (2023)
Thomas P. Zollo, Todd Morrill, Zhun Deng, Jake C. Snell, Toniann Pitassi, Richard S. Zemel
Prompt Risk Control: A Rigorous Framework for Responsible Deployment of Large Language Models. CoRR (2023)
Russell Impagliazzo, Sasank Mouli, Toniann Pitassi
Lower Bounds for Polynomial Calculus with Extension Variables over Finite Fields. CCC (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. CoRR (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. STOC (2023)
Zhun Deng, Thomas P. Zollo, Jake C. Snell, Toniann Pitassi, Richard S. Zemel
Distribution-Free Statistical Dispersion Control for Societal Applications. CoRR (2023)
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman
An improved protocol for ExactlyN with more than 3 players. CoRR (2023)
Alexander Edmonds, Aleksandar Nikolov, Toniann Pitassi
On Learning and Refutation in Noninteractive Local Differential Privacy. NeurIPS (2022)
Toniann Pitassi, Morgan Shirley, Adi Shraibman
The Strength of Equality Oracles in Communication. Electron. Colloquium Comput. Complex. (2022)
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi
Secret Sharing, Slice Formulas, and Monotone Real Circuits. Electron. Colloquium Comput. Complex. 29 (2022)
Jake C. Snell, Thomas P. Zollo, Zhun Deng, Toniann Pitassi, Richard S. Zemel
Quantile Risk Control: A Flexible Framework for Bounding the Probability of High-Loss Predictions. CoRR (2022)
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi
Secret Sharing, Slice Formulas, and Monotone Real Circuits. ITCS (2022)
Alexander Edmonds, Aleksandar Nikolov, Toniann Pitassi
Learning versus Refutation in Noninteractive Local Differential Privacy. CoRR (2022)
Noah Fleming, Toniann Pitassi, Robert Robere
Extremely Deep Proofs. ITCS (2022)
Shachar Lovett, Raghu Meka, Ian Mertz, Toniann Pitassi, Jiapeng Zhang
Lifting with Sunflowers. ITCS (2022)
Toniann Pitassi, Prasanna Ramakrishnan, Li-Yang Tan
Tradeoffs for small-depth Frege proofs. FOCS (2022)
Russell Impagliazzo, Rex Lei, Toniann Pitassi, Jessica Sorrell
Reproducibility in Learning. CoRR (2022)
Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes. J. ACM 69 (3) (2022)
Russell Impagliazzo, Sasank Mouli, Toniann Pitassi
Lower bounds for Polynomial Calculus with extension variables over finite fields. Electron. Colloquium Comput. Complex. (2022)
Russell Impagliazzo, Rex Lei, Toniann Pitassi, Jessica Sorrell
Reproducibility in learning. STOC (2022)
Gal Vardi, Daniel Reichman, Toniann Pitassi, Ohad Shamir
Size and Depth Separation in Approximating Benign Functions with Neural Networks. COLT (2021)
Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov
Automating algebraic proof systems is NP-hard. STOC (2021)
Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
On the Power and Limitations of Branch and Cut. CoRR (2021)
Toniann Pitassi, Prasanna Ramakrishnan, Li-Yang Tan
Tradeoffs for small-depth Frege proofs. CoRR (2021)
Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
On the Power and Limitations of Branch and Cut. Electron. Colloquium Comput. Complex. 28 (2021)
Toniann Pitassi, Morgan Shirley, Thomas Watson
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. Comput. Complex. 30 (2) (2021)
Gal Vardi, Daniel Reichman, Toniann Pitassi, Ohad Shamir
Size and Depth Separation in Approximating Natural Functions with Neural Networks. CoRR (2021)
Toniann Pitassi
Algebraic Proof Systems (Invited Talk). ICALP (2021)
Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
On the Power and Limitations of Branch and Cut. Computational Complexity Conference (2021)
Shafi Goldwasser, Russell Impagliazzo, Toniann Pitassi, Rahul Santhanam
On the Pseudo-Deterministic Query Complexity of NP Search Problems. Computational Complexity Conference (2021)
Noah Fleming, Toniann Pitassi
Reflections on Proof Complexity and Counting Principles. Electron. Colloquium Comput. Complex. 28 (2021)
Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi
Query-to-Communication Lifting Using Low-Discrepancy Gadgets. SIAM J. Comput. 50 (1) (2021)
Noah Fleming, Toniann Pitassi, Robert Robere
Extremely Deep Proofs. Electron. Colloquium Comput. Complex. 28 (2021)
James Lucas, Mengye Ren, Irene Raissa Kameni, Toniann Pitassi, Richard S. Zemel
Theoretical bounds on estimation error for meta-learning. ICLR (2021)
Toniann Pitassi, Prasanna Ramakrishnan, Li-Yang Tan
Tradeoffs for small-depth Frege proofs. FOCS (2021)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
KRW Composition Theorems via Lifting. FOCS (2020)
Russell Impagliazzo, Sasank Mouli, Toniann Pitassi
The Surprising Power of Constant Depth Algebraic Proofs. LICS (2020)
Elliot Creager, David Madras, Toniann Pitassi, Richard S. Zemel
Causal Modeling for Fairness In Dynamical Systems. ICML (2020)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. CoRR (2020)
James Lucas, Mengye Ren, Irene Kameni, Toniann Pitassi, Richard S. Zemel
Theoretical bounds on estimation error for meta-learning. CoRR (2020)
Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh
Towards a Complexity-theoretic Understanding of Restarts in SAT solvers. CoRR (2020)
Toniann Pitassi, Morgan Shirley, Thomas Watson
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. ICALP (2020)
Ian Mertz, Toniann Pitassi
Lifting: As Easy As 1, 2, 3. Electron. Colloquium Comput. Complex. 27 (2020)
Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh
Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers. SAT (2020)
Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov, Susanna F. de Rezende
Automating Algebraic Proof Systems is NP-Hard. Electron. Colloquium Comput. Complex. 27 (2020)
Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi
Automating Cutting Planes is NP-Hard}. CoRR (2020)
Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi
Automating cutting planes is NP-hard. STOC (2020)
Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi
Automating Cutting Planes is NP-Hard. Electron. Colloquium Comput. Complex. 27 (2020)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. FOCS (2020)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
KRW Composition Theorems via Lifting. CoRR (2020)
Mika Göös, Toniann Pitassi, Thomas Watson
Query-to-Communication Lifting for BPP. SIAM J. Comput. 49 (4) (2020)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
KRW Composition Theorems via Lifting. Electron. Colloquium Comput. Complex. 27 (2020)
Noah Fleming, Pravesh Kothari, Toniann Pitassi
Semialgebraic Proofs and Efficient Algorithm Design. Electron. Colloquium Comput. Complex. 26 (2019)
Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi
Query-To-Communication Lifting for BPP Using Inner Product. ICALP (2019)
Russell Impagliazzo, Sasank Mouli, Toniann Pitassi
The Surprising Power of Constant Depth Algebraic Proofs. Electron. Colloquium Comput. Complex. 26 (2019)
Noah Fleming, Pravesh Kothari, Toniann Pitassi
Semialgebraic Proofs and Efficient Algorithm Design. Found. Trends Theor. Comput. Sci. 14 (1-2) (2019)
Nati Linial, Toniann Pitassi, Adi Shraibman
On the Communication Complexity of High-Dimensional Permutations. ITCS (2019)
Ian Mertz, Toniann Pitassi, Yuanhao Wei
Short Proofs Are Hard to Find. ICALP (2019)
Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
Correction to: Query-to-Communication Lifting for P NP. Comput. Complex. 28 (3) (2019)
David Madras, Elliot Creager, Toniann Pitassi, Richard S. Zemel
Fairness through Causal Awareness: Learning Causal Latent-Variable Models for Biased Data. FAT (2019)
Toniann Pitassi
Progress in Lifting and Applications in Lower Bounds (Invited Talk). FSTTCS (2019)
Elliot Creager, David Madras, Jörn-Henrik Jacobsen, Marissa A. Weis, Kevin Swersky, Toniann Pitassi, Richard S. Zemel
Flexibly Fair Representation Learning by Disentanglement. ICML (2019)
Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
Query-to-Communication Lifting for P NP. Comput. Complex. 28 (1) (2019)
Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi
Query-to-Communication Lifting Using Low-Discrepancy Gadgets. Electron. Colloquium Comput. Complex. 26 (2019)
Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi
Query-to-communication lifting for BPP using inner product. CoRR (2019)
Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Susanna F. de Rezende
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. Electron. Colloquium Comput. Complex. 26 (2019)
Toniann Pitassi, Morgan Shirley, Thomas Watson
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. Electron. Colloquium Comput. Complex. 26 (2019)
Elliot Creager, David Madras, Jörn-Henrik Jacobsen, Marissa A. Weis, Kevin Swersky, Toniann Pitassi, Richard S. Zemel
Flexibly Fair Representation Learning by Disentanglement. CoRR (2019)
Elliot Creager, David Madras, Toniann Pitassi, Richard S. Zemel
Causal Modeling for Fairness in Dynamical Systems. CoRR (2019)
David Madras, Toniann Pitassi, Richard S. Zemel
Predict Responsibly: Increasing Fairness by Learning to Defer. ICLR (Workshop) (2018)
Mika Göös, Toniann Pitassi
Communication Lower Bounds via Critical Block Sensitivity. SIAM J. Comput. 47 (5) (2018)
Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere
Stabbing Planes. ITCS (2018)
David Madras, Elliot Creager, Toniann Pitassi, Richard S. Zemel
Learning Adversarially Fair and Transferable Representations. ICML (2018)
Mika Göös, Toniann Pitassi, Thomas Watson
Deterministic Communication vs. Partition Number. SIAM J. Comput. 47 (6) (2018)
David Madras, Toniann Pitassi, Richard S. Zemel
Predict Responsibly: Improving Fairness and Accuracy by Learning to Defer. NeurIPS (2018)
Toniann Pitassi, Robert Robere
Lifting nullstellensatz to monotone span programs over any field. STOC (2018)
David Madras, Elliot Creager, Toniann Pitassi, Richard S. Zemel
Learning Adversarially Fair and Transferable Representations. CoRR (2018)
Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi
Hardness of Function Composition for Semantic Read once Branching Programs. Computational Complexity Conference (2018)
Mika Göös, Toniann Pitassi, Thomas Watson
The Landscape of Communication Complexity Classes. Comput. Complex. 27 (2) (2018)
Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
Randomized Communication versus Partition Number. ACM Trans. Comput. Theory 10 (1) (2018)
Joshua A. Grochow, Toniann Pitassi
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing: The Ideal Proof System. J. ACM 65 (6) (2018)
David Madras, Elliot Creager, Toniann Pitassi, Richard S. Zemel
Fairness Through Causal Awareness: Learning Latent-Variable Models for Biased Data. CoRR (2018)
Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
Query-to-Communication Lifting for P^NP. Electron. Colloquium Comput. Complex. 24 (2017)
Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth
Guilt-free data reuse. Commun. ACM 60 (4) (2017)
Mika Göös, Toniann Pitassi, Thomas Watson
Query-to-Communication Lifting for BPP. Electron. Colloquium Comput. Complex. 24 (2017)
Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
Random Θ(log n)-CNFs Are Hard for Cutting Planes. FOCS (2017)
Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson
Query-to-Communication Lifting for P^NP. Computational Complexity Conference (2017)

Toniann Pitassi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Toniann Pitassi