default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulia Kempe
Person information
- affiliation: Tel Aviv University, Israel
- affiliation: University of Paris 7, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]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)- [c25]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: 127-135 - [c24]Yunzhen Feng, Shanmukha Ramakrishna Vedantam, Julia Kempe:
Embarrassingly Simple Dataset Distillation. ICLR 2024 - [c23]Elvis Dohmatob, Yunzhen Feng, Pu Yang, François Charton, Julia Kempe:
A Tale of Tails: Model Collapse as a Change of Scaling Laws. ICML 2024 - [c22]Artem Vysogorets, Anna Dawid, Julia Kempe:
Deconstructing the Goldilocks Zone of Neural Network Initialization. ICML 2024 - [i34]Artem Vysogorets, Anna Dawid, Julia Kempe:
Deconstructing the Goldilocks Zone of Neural Network Initialization. CoRR abs/2402.03579 (2024) - [i33]Elvis Dohmatob, Yunzhen Feng, Pu Yang, François Charton, Julia Kempe:
A Tale of Tails: Model Collapse as a Change of Scaling Laws. CoRR abs/2402.07043 (2024) - [i32]Elvis Dohmatob, Yunzhen Feng, Julia Kempe:
Model Collapse Demystified: The Case of Regression. CoRR abs/2402.07712 (2024) - [i31]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 abs/2403.09869 (2024) - [i30]Artem Vysogorets, Kartik Ahuja, Julia Kempe:
Robust Data Pruning: Uncovering and Overcoming Implicit Bias. CoRR abs/2404.05579 (2024) - [i29]Yunzhen Feng, Tim G. J. Rudner, Nikolaos Tsilivis, Julia Kempe:
Attacking Bayes: On the Adversarial Robustness of Bayesian Neural Networks. CoRR abs/2404.19640 (2024) - [i28]Vivien Cabannes, Charles Arnal, Wassim Bouaziz, Alice Yang, François Charton, Julia Kempe:
Iteration Head: A Mechanistic Study of Chain-of-Thought. CoRR abs/2406.02128 (2024) - [i27]Nikolaos Tsilivis, Natalie Frank, Nathan Srebro, Julia Kempe:
The Price of Implicit Bias in Adversarially Robust Generalization. CoRR abs/2406.04981 (2024) - [i26]Yunzhen Feng, Elvis Dohmatob, Pu Yang, François Charton, Julia Kempe:
Beyond Model Collapse: Scaling Up with Synthesized Data Requires Reinforcement. CoRR abs/2406.07515 (2024) - [i25]Jingtong Su, Julia Kempe, Karen Ullrich:
Mission Impossible: A Statistical Perspective on Jailbreaking LLMs. CoRR abs/2408.01420 (2024) - [i24]Elvis Dohmatob, Yunzhen Feng, Arjun Subramonian, Julia Kempe:
Strong Model Collapse. CoRR abs/2410.04840 (2024) - 2023
- [j17]Artem Vysogorets, Julia Kempe:
Connectivity Matters: Neural Network Pruning Through the Lens of Effective Sparsity. J. Mach. Learn. Res. 24: 99:1-99:23 (2023) - [i23]Jingtong Su, Julia Kempe
:
Wavelets Beat Monkeys at Adversarial Robustness. CoRR abs/2304.09403 (2023) - [i22]Francesco Cagnetta, Deborah Oliveira, Mahalakshmi Sabanayagam, Nikolaos Tsilivis, Julia Kempe:
Kernels, Data & Physics. CoRR abs/2307.02693 (2023) - [i21]Yunzhen Feng, Ramakrishna Vedantam, Julia Kempe:
Embarassingly Simple Dataset Distillation. CoRR abs/2311.07025 (2023) - [i20]Jingtong Su, Ya Shi Zhang, Nikolaos Tsilivis, Julia Kempe:
On the Robustness of Neural Collapse and the Neural Collapse of Robustness. CoRR abs/2311.07444 (2023) - [i19]Haowen Guan, Xuan Zhao, Zishi Wang, Zhiyang Li, Julia Kempe:
Discovering Galaxy Features via Dataset Distillation. CoRR abs/2311.17967 (2023) - 2022
- [c21]Nikolaos Tsilivis, Julia Kempe:
What Can the Neural Tangent Kernel Tell Us About Adversarial Robustness? NeurIPS 2022 - [i18]Nikolaos Tsilivis, Jingtong Su, Julia Kempe:
Can we achieve robustness from data alone? CoRR abs/2207.11727 (2022) - [i17]Dhrupad Bhardwaj, Julia Kempe, Artem Vysogorets, Angela M. Teng, Evaristus C. Ezekwem:
ImpressLearn: Continual Learning via Combined Task Impressions. CoRR abs/2210.01987 (2022) - [i16]Nikolaos Tsilivis, Julia Kempe:
What Can the Neural Tangent Kernel Tell Us About Adversarial Robustness? CoRR abs/2210.05577 (2022) - 2021
- [i15]Artem Vysogorets, Julia Kempe:
Connectivity Matters: Neural Network Pruning Through the Lens of Effective Sparsity. CoRR abs/2107.02306 (2021)
2010 – 2019
- 2014
- [j16]Sevag Gharibian, Julia Kempe:
Hardness of approximation for quantum problems. Quantum Inf. Comput. 14(5-6): 517-540 (2014) - 2012
- [j15]Andris Ambainis, Julia Kempe, Or Sattath:
A quantum lovász local lemma. J. ACM 59(5): 24:1-24:24 (2012) - [j14]Sevag Gharibian, Julia Kempe:
Approximation Algorithms for QMA-Complete Problems. SIAM J. Comput. 41(4): 1028-1050 (2012) - [j13]Roy Kasher, Julia Kempe:
Two-Source Extractors Secure Against Quantum Adversaries. Theory Comput. 8(1): 461-486 (2012) - [c20]Sevag Gharibian, Julia Kempe:
Hardness of Approximation for Quantum Problems. ICALP (1) 2012: 387-398 - [i14]Sevag Gharibian, Julia Kempe:
Hardness of approximation for quantum problems. CoRR abs/1209.1055 (2012) - 2011
- [j12]Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick:
Entangled Games Are Hard to Approximate. SIAM J. Comput. 40(3): 848-877 (2011) - [c19]Sevag Gharibian, Julia Kempe:
Approximation Algorithms for QMA-Complete Problems. CCC 2011: 178-188 - [c18]Julia Kempe, Thomas Vidick:
Parallel repetition of entangled games. STOC 2011: 353-362 - [i13]Sevag Gharibian, Julia Kempe:
Approximation algorithms for QMA-complete problems. CoRR abs/1101.3884 (2011) - 2010
- [j11]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): 361-376 (2010) - [j10]Julia Kempe, Oded Regev, Ben Toner:
Unique Games with Entangled Provers Are Easy. SIAM J. Comput. 39(7): 3207-3229 (2010) - [c17]Roy Kasher, Julia Kempe:
Two-Source Extractors Secure against Quantum Adversaries. APPROX-RANDOM 2010: 656-669 - [c16]Julia Kempe, Oded Regev:
No Strong Parallel Repetition with Entangled and Non-signaling Provers. CCC 2010: 7-15 - [c15]Andris Ambainis, Julia Kempe, Or Sattath:
A quantum lovász local lemma. STOC 2010: 151-160 - [i12]Roy Kasher, Julia Kempe:
Two-Source Extractors Secure Against Quantum Adversaries. CoRR abs/1005.0512 (2010)
2000 – 2009
- 2009
- [j9]Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick:
Using Entanglement in Quantum Multi-Prover Interactive Proofs. Comput. Complex. 18(2): 273-307 (2009) - [j8]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): 1-24 (2009) - [i11]Julia Kempe, Oded Regev:
No Strong Parallel Repetition with Entangled and Non-signaling Provers. CoRR abs/0911.0201 (2009) - [i10]Andris Ambainis, Julia Kempe, Or Sattath:
A Quantum Lovasz Local Lemma. CoRR abs/0911.1696 (2009) - 2008
- [j7]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): 1695-1708 (2008) - [j6]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): 755-787 (2008) - [c14]Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick:
Using Entanglement in Quantum Multi-prover Interactive Proofs. CCC 2008: 211-222 - [c13]Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick:
Entangled Games are Hard to Approximate. FOCS 2008: 447-456 - [c12]Julia Kempe, Oded Regev, Ben Toner:
Unique Games with Entangled Provers are Easy. FOCS 2008: 457-466 - [c11]Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf:
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. ICALP (1) 2008: 845-856 - 2007
- [j5]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): 166-194 (2007) - [c10]Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe:
The Power of Quantum Systems on a Line. FOCS 2007: 373-383 - [c9]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: 516-525 - [i9]Julia Kempe, Oded Regev, Ben Toner:
The Unique Games Conjecture with Entangled Provers is False. Algebraic Methods in Computational Complexity 2007 - 2006
- [j4]Julia Kempe, Alexei Y. Kitaev, Oded Regev:
The Complexity of the Local Hamiltonian Problem. SIAM J. Comput. 35(5): 1070-1097 (2006) - [j3]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): 448-459 (2006) - [c8]Dmitry Gavinsky, Julia Kempe, Ronald de Wolf:
Strengths and Weaknesses of Quantum Fingerprinting. CCC 2006: 288-298 - [c7]Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf:
Bounded-error quantum state identification and exponential separations in communication complexity. STOC 2006: 594-603 - [i8]Dmitry Gavinsky, Julia Kempe, Ronald de Wolf:
Strengths and Weaknesses of Quantum Fingerprinting. CoRR abs/quant-ph/0603173 (2006) - [i7]Dmitry Gavinsky, Julia Kempe, Ronald de Wolf:
Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function. CoRR abs/quant-ph/0607174 (2006) - [i6]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. TR06 (2006) - 2005
- [c6]Andris Ambainis, Julia Kempe, Alexander Rivosh:
Coins make quantum walks faster. SODA 2005: 1099-1108 - [c5]Julia Kempe, Aner Shalev:
The hidden subgroup problem and permutation group theory. SODA 2005: 1118-1125 - [i5]Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf:
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity. CoRR abs/quant-ph/0511013 (2005) - 2004
- [c4]Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev:
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. FOCS 2004: 42-51 - [c3]Julia Kempe, Alexei Y. Kitaev, Oded Regev:
The Complexity of the Local Hamiltonian Problem. FSTTCS 2004: 372-383 - [i4]Julia Kempe, Aner Shalev:
The hidden subgroup problem and permutation group theory. CoRR quant-ph/0406046 (2004) - [i3]Julia Kempe, Alexei Y. Kitaev, Oded Regev:
The Complexity of the Local Hamiltonian Problem. CoRR quant-ph/0406180 (2004) - [i2]Dmitry Gavinsky, Julia Kempe, Ronald de Wolf:
Quantum Communication Cannot Simulate a Public Coin. CoRR quant-ph/0411051 (2004) - 2003
- [j2]Julia Kempe, Oded Regev:
3-local Hamiltonian is QMA-complete. Quantum Inf. Comput. 3(3): 258-264 (2003) - [c2]Julia Kempe:
Discrete Quantum Walks Hit Exponentially Faster. RANDOM-APPROX 2003: 354-369 - 2002
- [i1]Julia Kempe:
Quantum Random Walks Hit Exponentially Faster. CoRR quant-ph/0205083 (2002) - 2001
- [j1]Julia Kempe, David Bacon, David P. DiVincenzo, K. Brigitta Whaley:
Encoded universality from a single physical interaction. Quantum Inf. Comput. 1(4): 33-55 (2001) - [c1]Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani:
Quantum walks on graphs. STOC 2001: 50-59
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
