Julia Kempe

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 23

Top Topics

Computational Efficiency

Convolution Kernel

Nonlinear Predictive Control

Top Venues

J. Mach. Learn. Res.

Publications

Artem Vysogorets, Kartik Ahuja, Julia Kempe
Robust Data Pruning: Uncovering and Overcoming Implicit Bias. CoRR (2024)
Jingtong Su, Ya Shi Zhang, Nikolaos Tsilivis, Julia Kempe
On the Robustness of Neural Collapse and the Neural Collapse of Robustness. Trans. Mach. Learn. Res. 2024 (2024)
Yunzhen Feng, Shanmukha Ramakrishna Vedantam, Julia Kempe
Embarrassingly Simple Dataset Distillation. ICLR (2024)
Nikolaos Tsilivis, Natalie Frank, Nathan Srebro, Julia Kempe
The Price of Implicit Bias in Adversarially Robust Generalization. CoRR (2024)
Yunzhen Feng, Tim G. J. Rudner, Nikolaos Tsilivis, Julia Kempe
Attacking Bayes: On the Adversarial Robustness of Bayesian Neural Networks. CoRR (2024)
Tim G. J. Rudner, Ya Shi Zhang, Andrew Gordon Wilson, Julia Kempe
Mind the GAP: Improving Robustness to Subpopulation Shifts with Group-Aware Priors. CoRR (2024)
Yunzhen Feng, Elvis Dohmatob, Pu Yang, François Charton, Julia Kempe
Beyond Model Collapse: Scaling Up with Synthesized Data Requires Reinforcement. CoRR (2024)
Elvis Dohmatob, Yunzhen Feng, Pu Yang, François Charton, Julia Kempe
A Tale of Tails: Model Collapse as a Change of Scaling Laws. CoRR (2024)
Artem Vysogorets, Anna Dawid, Julia Kempe
Deconstructing the Goldilocks Zone of Neural Network Initialization. CoRR (2024)
Elvis Dohmatob, Yunzhen Feng, Julia Kempe
Model Collapse Demystified: The Case of Regression. CoRR (2024)
Tim G. J. Rudner, Ya Shi Zhang, Andrew Gordon Wilson, Julia Kempe
Mind the GAP: Improving Robustness to Subpopulation Shifts with Group-Aware Priors. AISTATS (2024)
Vivien Cabannes, Charles Arnal, Wassim Bouaziz, Alice Yang, François Charton, Julia Kempe
Iteration Head: A Mechanistic Study of Chain-of-Thought. CoRR (2024)
Jingtong Su, Julia Kempe
Wavelets Beat Monkeys at Adversarial Robustness. CoRR (2023)
Artem Vysogorets, Julia Kempe
Connectivity Matters: Neural Network Pruning Through the Lens of Effective Sparsity. J. Mach. Learn. Res. 24 (2023)
Yunzhen Feng, Ramakrishna Vedantam, Julia Kempe
Embarassingly Simple Dataset Distillation. CoRR (2023)
Francesco Cagnetta, Deborah Oliveira, Mahalakshmi Sabanayagam, Nikolaos Tsilivis, Julia Kempe
Kernels, Data & Physics. CoRR (2023)
Haowen Guan, Xuan Zhao, Zishi Wang, Zhiyang Li, Julia Kempe
Discovering Galaxy Features via Dataset Distillation. CoRR (2023)
Jingtong Su, Ya Shi Zhang, Nikolaos Tsilivis, Julia Kempe
On the Robustness of Neural Collapse and the Neural Collapse of Robustness. CoRR (2023)
Nikolaos Tsilivis, Jingtong Su, Julia Kempe
Can we achieve robustness from data alone? CoRR (2022)
Nikolaos Tsilivis, Julia Kempe
What Can the Neural Tangent Kernel Tell Us About Adversarial Robustness? CoRR (2022)
Dhrupad Bhardwaj, Julia Kempe, Artem Vysogorets, Angela M. Teng, Evaristus C. Ezekwem
ImpressLearn: Continual Learning via Combined Task Impressions. CoRR (2022)
Nikolaos Tsilivis, Julia Kempe
What Can the Neural Tangent Kernel Tell Us About Adversarial Robustness? NeurIPS (2022)
Artem Vysogorets, Julia Kempe
Connectivity Matters: Neural Network Pruning Through the Lens of Effective Sparsity. CoRR (2021)
Sevag Gharibian, Julia Kempe
Hardness of approximation for quantum problems. Quantum Inf. Comput. 14 (5-6) (2014)
Sevag Gharibian, Julia Kempe
Hardness of Approximation for Quantum Problems. ICALP (1) (2012)
Sevag Gharibian, Julia Kempe
Approximation Algorithms for QMA-Complete Problems. SIAM J. Comput. 41 (4) (2012)
Roy Kasher, Julia Kempe
Two-Source Extractors Secure Against Quantum Adversaries. Theory Comput. 8 (1) (2012)
Sevag Gharibian, Julia Kempe
Hardness of approximation for quantum problems CoRR (2012)
Andris Ambainis, Julia Kempe, Or Sattath
A quantum lovász local lemma. J. ACM 59 (5) (2012)
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick
Entangled Games Are Hard to Approximate. SIAM J. Comput. 40 (3) (2011)
Sevag Gharibian, Julia Kempe
Approximation algorithms for QMA-complete problems CoRR (2011)
Sevag Gharibian, Julia Kempe
Approximation Algorithms for QMA-Complete Problems. Computational Complexity Conference (2011)
Julia Kempe, Thomas Vidick
Parallel repetition of entangled games. STOC (2011)
Roy Kasher, Julia Kempe
Two-Source Extractors Secure Against Quantum Adversaries CoRR (2010)
Julia Kempe, Oded Regev
No Strong Parallel Repetition with Entangled and Non-signaling Provers. Computational Complexity Conference (2010)
Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf
Upper bounds on the noise threshold for fault-tolerant quantum computing. Quantum Inf. Comput. 10 (5&6) (2010)
Andris Ambainis, Julia Kempe, Or Sattath
A quantum lovász local lemma. STOC (2010)
Julia Kempe, Oded Regev, Ben Toner
Unique Games with Entangled Provers Are Easy. SIAM J. Comput. 39 (7) (2010)
Roy Kasher, Julia Kempe
Two-Source Extractors Secure against Quantum Adversaries. APPROX-RANDOM (2010)
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity. SIAM J. Comput. 39 (1) (2009)
Andris Ambainis, Julia Kempe, Or Sattath
A Quantum Lovasz Local Lemma CoRR (2009)
Julia Kempe, Oded Regev
No Strong Parallel Repetition with Entangled and Non-signaling Provers CoRR (2009)
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick
Using Entanglement in Quantum Multi-Prover Interactive Proofs. Comput. Complex. 18 (2) (2009)
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick
Entangled Games are Hard to Approximate. FOCS (2008)
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick
Using Entanglement in Quantum Multi-prover Interactive Proofs. Computational Complexity Conference (2008)
Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation. SIAM Rev. 50 (4) (2008)
Julia Kempe, Oded Regev, Ben Toner
Unique Games with Entangled Provers are Easy. FOCS (2008)
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography. SIAM J. Comput. 38 (5) (2008)
Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. ICALP (1) (2008)
Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe
The Power of Quantum Systems on a Line. FOCS (2007)
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf
Exponential separations for one-way quantum communication complexity, with applications to cryptography. STOC (2007)
Julia Kempe, Oded Regev, Ben Toner
The Unique Games Conjecture with Entangled Provers is False. Algebraic Methods in Computational Complexity (2007)
Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. SIAM J. Comput. 37 (1) (2007)
Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
Strengths and Weaknesses of Quantum Fingerprinting. Computational Complexity Conference (2006)
Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
Strengths and Weaknesses of Quantum Fingerprinting CoRR (2006)
Jesse Fern, Julia Kempe, Slobodan N. Simic, Shankar Sastry
Generalized Performance of Concatenated Quantum Codes - A Dynamical Systems Approach. IEEE Trans. Autom. Control. 51 (3) (2006)
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf
Bounded-error quantum state identification and exponential separations in communication complexity. STOC (2006)
Julia Kempe, Alexei Y. Kitaev, Oded Regev
The Complexity of the Local Hamiltonian Problem. SIAM J. Comput. 35 (5) (2006)
Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function CoRR (2006)
Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function. Electron. Colloquium Comput. Complex. 13 (086) (2006)
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity CoRR (2005)
Julia Kempe, Aner Shalev
The hidden subgroup problem and permutation group theory. SODA (2005)
Andris Ambainis, Julia Kempe, Alexander Rivosh
Coins make quantum walks faster. SODA (2005)
Julia Kempe, Alexei Y. Kitaev, Oded Regev
The Complexity of the Local Hamiltonian Problem. FSTTCS (2004)
Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. FOCS (2004)
Julia Kempe, Alexei Y. Kitaev, Oded Regev
The Complexity of the Local Hamiltonian Problem CoRR (2004)
Julia Kempe, Aner Shalev
The hidden subgroup problem and permutation group theory CoRR (2004)
Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
Quantum Communication Cannot Simulate a Public Coin CoRR (2004)
Julia Kempe
Discrete Quantum Walks Hit Exponentially Faster. RANDOM-APPROX (2003)
Julia Kempe, Oded Regev
3-local Hamiltonian is QMA-complete. Quantum Inf. Comput. 3 (3) (2003)
Julia Kempe
Quantum Random Walks Hit Exponentially Faster CoRR (2002)
Julia Kempe, David Bacon, David P. DiVincenzo, K. Brigitta Whaley
Encoded universality from a single physical interaction. Quantum Inf. Comput. 1 (4) (2001)
Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani
Quantum walks on graphs. STOC (2001)