Julia Kempe

Orcid: 0009-0006-1984-0060

Affiliations:
  • Tel Aviv University, Israel
  • University of Paris 7, France


According to our database1, Julia Kempe authored at least 52 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Robustness of Neural Collapse and the Neural Collapse of Robustness.
Trans. Mach. Learn. Res., 2024

Flavors of Margin: Implicit Bias of Steepest Descent in Homogeneous Neural Networks.
CoRR, 2024

On the Geometry of Regularization in Adversarial Training: High-Dimensional Asymptotics and Generalization Bounds.
CoRR, 2024

Emergent properties with repeated examples.
CoRR, 2024

Strong Model Collapse.
CoRR, 2024

Mission Impossible: A Statistical Perspective on Jailbreaking LLMs.
CoRR, 2024

Beyond Model Collapse: Scaling Up with Synthesized Data Requires Reinforcement.
CoRR, 2024

The Price of Implicit Bias in Adversarially Robust Generalization.
CoRR, 2024

Iteration Head: A Mechanistic Study of Chain-of-Thought.
CoRR, 2024

Attacking Bayes: On the Adversarial Robustness of Bayesian Neural Networks.
CoRR, 2024

Robust Data Pruning: Uncovering and Overcoming Implicit Bias.
CoRR, 2024

Model Collapse Demystified: The Case of Regression.
CoRR, 2024

Deconstructing the Goldilocks Zone of Neural Network Initialization.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

A Tale of Tails: Model Collapse as a Change of Scaling Laws.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Embarrassingly Simple Dataset Distillation.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Mind the GAP: Improving Robustness to Subpopulation Shifts with Group-Aware Priors.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Connectivity Matters: Neural Network Pruning Through the Lens of Effective Sparsity.
J. Mach. Learn. Res., 2023

Discovering Galaxy Features via Dataset Distillation.
CoRR, 2023

Embarassingly Simple Dataset Distillation.
CoRR, 2023

Kernels, Data & Physics.
CoRR, 2023

Wavelets Beat Monkeys at Adversarial Robustness.
CoRR, 2023

2022
ImpressLearn: Continual Learning via Combined Task Impressions.
CoRR, 2022

Can we achieve robustness from data alone?
CoRR, 2022

What Can the Neural Tangent Kernel Tell Us About Adversarial Robustness?
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.
Quantum Inf. Comput., 2014

2012
Two-Source Extractors Secure Against Quantum Adversaries.
Theory Comput., 2012

Approximation Algorithms for QMA-Complete Problems.
SIAM J. Comput., 2012

A quantum lovász local lemma.
J. ACM, 2012

2011
Entangled Games Are Hard to Approximate.
SIAM J. Comput., 2011

Parallel repetition of entangled games.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010
Unique Games with Entangled Provers Are Easy.
SIAM J. Comput., 2010

Upper bounds on the noise threshold for fault-tolerant quantum computing.
Quantum Inf. Comput., 2010

No Strong Parallel Repetition with Entangled and Non-signaling Provers.
Proceedings of the 25th Annual IEEE Conference on Computational Complexity, 2010

2009
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity.
SIAM J. Comput., 2009

Using Entanglement in Quantum Multi-Prover Interactive Proofs.
Comput. Complex., 2009

2008
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography.
SIAM J. Comput., 2008

2007
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation.
SIAM J. Comput., 2007

Exponential separations for one-way quantum communication complexity, with applications to cryptography.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

The Power of Quantum Systems on a Line.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

The Unique Games Conjecture with Entangled Provers is False.
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.
IEEE Trans. Autom. Control., 2006

The Complexity of the Local Hamiltonian Problem.
SIAM J. Comput., 2006

Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function.
Electron. Colloquium Comput. Complex., 2006

Strengths and Weaknesses of Quantum Fingerprinting.
Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006

2005
The hidden subgroup problem and permutation group theory.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Coins make quantum walks faster.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Quantum Communication Cannot Simulate a Public Coin
CoRR, 2004

2003
3-local Hamiltonian is QMA-complete.
Quantum Inf. Comput., 2003

Discrete Quantum Walks Hit Exponentially Faster.
Proceedings of the Approximation, 2003

2002
Quantum Random Walks Hit Exponentially Faster
CoRR, 2002

2001
Encoded universality from a single physical interaction.
Quantum Inf. Comput., 2001

Quantum walks on graphs.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001


  Loading...