Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Dataset Security for Machine Learning: Data Poisoning, Backdoor Attacks, and Defenses
2022134 citationsMicah Goldblum, Dimitris Tsipras et al.IEEE Transactions on Pattern Analysis and Machine Intelligenceprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Micah Goldblum
Since
Specialization
Citations
This map shows the geographic impact of Micah Goldblum's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Micah Goldblum with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Micah Goldblum more than expected).
This network shows the impact of papers produced by Micah Goldblum. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Micah Goldblum. The network helps show where Micah Goldblum may publish in the future.
Co-authorship network of co-authors of Micah Goldblum
This figure shows the co-authorship network connecting the top 25 collaborators of Micah Goldblum.
A scholar is included among the top collaborators of Micah Goldblum based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Micah Goldblum. Micah Goldblum is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Goldblum, Micah, Dimitris Tsipras, Chulin Xie, et al.. (2022). Dataset Security for Machine Learning: Data Poisoning, Backdoor Attacks, and Defenses. IEEE Transactions on Pattern Analysis and Machine Intelligence. 45(2). 1563–1580.134 indexed citations breakdown →
12.
Schwarzschild, Avi, Micah Goldblum, Arjun K. Gupta, John P. Dickerson, & Tom Goldstein. (2021). Just How Toxic is Data Poisoning? A Unified Benchmark for Backdoor and Data Poisoning Attacks. International Conference on Machine Learning. 9389–9398.1 indexed citations
13.
Goldblum, Micah, et al.. (2021). LowKey: Leveraging Adversarial Attacks to Protect Social Media Users from Facial Recognition. arXiv (Cornell University).38 indexed citations
14.
Fowl, Liam, et al.. (2021). Protecting Proprietary Data: Poisoning for Secure Dataset Release.1 indexed citations
Ni, Renkun, et al.. (2020). Data Augmentation for Meta-Learning. arXiv (Cornell University).1 indexed citations
17.
Goldblum, Micah, Liam Fowl, & Tom Goldstein. (2020). Adversarially Robust Few-Shot Learning: A Meta-Learning Approach. Neural Information Processing Systems. 33. 17886–17895.2 indexed citations
18.
Goldblum, Micah, Jonas Geiping, Avi Schwarzschild, Michael Moeller, & Tom Goldstein. (2020). Truth or backpropaganda? An empirical investigation of deep learning theory. International Conference on Learning Representations.2 indexed citations
19.
Wu, Zuxuan, et al.. (2020). Preparing for the Worst: Making Networks Less Brittle with Adversarial Batch Normalization. arXiv (Cornell University).2 indexed citations
20.
Goldblum, Micah, Liam Fowl, & Tom Goldstein. (2019). Robust Few-Shot Learning with Adversarially Queried Meta-Learners. arXiv (Cornell University).3 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.