Julia Kempe

According to our database, Julia Kempe authored at least 41 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Mind the GAP: Improving Robustness to Subpopulation Shifts with Group-Aware Priors.

Tim G. J. Rudner, Ya Shi Zhang, Andrew Gordon Wilson, Julia Kempe

CoRR, 2024

Model Collapse Demystified: The Case of Regression.

Elvis Dohmatob, Yunzhen Feng, Julia Kempe

CoRR, 2024

A Tale of Tails: Model Collapse as a Change of Scaling Laws.

Elvis Dohmatob, Yunzhen Feng, Pu Yang, François Charton, Julia Kempe

CoRR, 2024

Deconstructing the Goldilocks Zone of Neural Network Initialization.

Artem Vysogorets, Anna Dawid, Julia Kempe

CoRR, 2024

2023

Connectivity Matters: Neural Network Pruning Through the Lens of Effective Sparsity.

Artem Vysogorets, Julia Kempe

J. Mach. Learn. Res., 2023

Discovering Galaxy Features via Dataset Distillation.

Haowen Guan, Xuan Zhao, Zishi Wang, Zhiyang Li, Julia Kempe

CoRR, 2023

On the Robustness of Neural Collapse and the Neural Collapse of Robustness.

Jingtong Su, Ya Shi Zhang, Nikolaos Tsilivis, Julia Kempe

CoRR, 2023

Embarassingly Simple Dataset Distillation.

Yunzhen Feng, Ramakrishna Vedantam, Julia Kempe

CoRR, 2023

Kernels, Data & Physics.

Francesco Cagnetta, Deborah Oliveira, Mahalakshmi Sabanayagam, Nikolaos Tsilivis, Julia Kempe

CoRR, 2023

Wavelets Beat Monkeys at Adversarial Robustness.

Jingtong Su, Julia Kempe

CoRR, 2023

2022

ImpressLearn: Continual Learning via Combined Task Impressions.

Dhrupad Bhardwaj, Julia Kempe, Artem Vysogorets, Angela M. Teng, Evaristus C. Ezekwem

CoRR, 2022

Can we achieve robustness from data alone?

Nikolaos Tsilivis, Jingtong Su, Julia Kempe

CoRR, 2022

What Can the Neural Tangent Kernel Tell Us About Adversarial Robustness?

Nikolaos Tsilivis, Julia Kempe

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2014

Hardness of approximation for quantum problems.

Sevag Gharibian, Julia Kempe

Quantum Inf. Comput., 2014

2012

Two-Source Extractors Secure Against Quantum Adversaries.

Roy Kasher, Julia Kempe

Theory Comput., 2012

Approximation Algorithms for QMA-Complete Problems.

Sevag Gharibian, Julia Kempe

SIAM J. Comput., 2012

A quantum lovász local lemma.

Andris Ambainis, Julia Kempe, Or Sattath

J. ACM, 2012

2011

Entangled Games Are Hard to Approximate.

Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick

SIAM J. Comput., 2011

Parallel repetition of entangled games.

Julia Kempe, Thomas Vidick

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010

Unique Games with Entangled Provers Are Easy.

Julia Kempe, Oded Regev, Ben Toner

SIAM J. Comput., 2010

Upper bounds on the noise threshold for fault-tolerant quantum computing.

Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf

Quantum Inf. Comput., 2010

No Strong Parallel Repetition with Entangled and Non-signaling Provers.

Julia Kempe, Oded Regev

Proceedings of the 25th Annual IEEE Conference on Computational Complexity, 2010

2009

Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity.

Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf

SIAM J. Comput., 2009

Using Entanglement in Quantum Multi-Prover Interactive Proofs.

Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick

Comput. Complex., 2009

2008

Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation.

Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev

SIAM Rev., 2008

Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography.

Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf

SIAM J. Comput., 2008

2007

Exponential separations for one-way quantum communication complexity, with applications to cryptography.

Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

The Power of Quantum Systems on a Line.

Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

The Unique Games Conjecture with Entangled Provers is False.

Julia Kempe, Oded Regev, Ben Toner

Proceedings of the Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007, 2007

2006

Generalized Performance of Concatenated Quantum Codes - A Dynamical Systems Approach.

Jesse Fern, Julia Kempe, Slobodan N. Simic, Shankar Sastry

IEEE Trans. Autom. Control., 2006

The Complexity of the Local Hamiltonian Problem.

Julia Kempe, Alexei Y. Kitaev, Oded Regev

SIAM J. Comput., 2006

Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function.

Dmitry Gavinsky, Julia Kempe, Ronald de Wolf

Electron. Colloquium Comput. Complex., 2006

Strengths and Weaknesses of Quantum Fingerprinting.

Dmitry Gavinsky, Julia Kempe, Ronald de Wolf

Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006

2005

The hidden subgroup problem and permutation group theory.

Julia Kempe, Aner Shalev

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Coins make quantum walks faster.

Andris Ambainis, Julia Kempe, Alexander Rivosh

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Quantum Communication Cannot Simulate a Public Coin

Dmitry Gavinsky, Julia Kempe, Ronald de Wolf

CoRR, 2004

2003

3-local Hamiltonian is QMA-complete.

Julia Kempe, Oded Regev

Quantum Inf. Comput., 2003

Discrete Quantum Walks Hit Exponentially Faster.

Julia Kempe

Proceedings of the Approximation, 2003

2002

Quantum Random Walks Hit Exponentially Faster

Julia Kempe

CoRR, 2002

2001

Encoded universality from a single physical interaction.

Julia Kempe, David Bacon, David P. DiVincenzo, K. Brigitta Whaley

Quantum Inf. Comput., 2001

Quantum walks on graphs.

Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001