Harshay Shah 个人学术档案 - 学术资源搜索

180

135

202020212022202320245 54 98 162 97

开放获取的出版物数量

1 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

Praneeth NetrapalliGoogle Research在 google.com 的电子邮件经过验证
Prateek JainGoogle Research India在 google.com 的电子邮件经过验证
Aditi RaghunathanAssistant professor, Carnegie Mellon University在 cmu.edu 的电子邮件经过验证
Kaustav TamulyML Engineer at Utpatti AI在 utpatti.ai 的电子邮件经过验证
Andrew IlyasMassachusetts Institute of Technology在 mit.edu 的电子邮件经过验证
Aleksander MądryMIT在 mit.edu 的电子邮件经过验证
Sung Min ParkMIT在 mit.edu 的电子邮件经过验证
hari sundaramUniversity of Illinois at Urbana-Champaign在 illinois.edu 的电子邮件经过验证
Suhansanu KumarUniversity of Illinois, Urbana Champaign在 illinois.edu 的电子邮件经过验证
Sewoong OhPaul G. Allen School of Computer Science and Engineering, University of Washington在 cs.washington.edu 的电子邮件经过验证

Harshay Shah

在 mit.edu 的电子邮件经过验证 - 首页


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
The Pitfalls of Simplicity Bias in Neural Networks H Shah, K Tamuly, A Raghunathan, P Jain, P Netrapalli Neural Information Processing Systems (NeurIPS), 2020, 2020	335	2020
Do Input Gradients Highlight Discriminative Features? H Shah, P Jain, P Netrapalli Neural Information Processing Systems (NeurIPS), 2021, 2021	58	2021
ModelDiff: A Framework for Comparing Learning Algorithms H Shah, SM Park, A Ilyas, A Madry International Conference on Machine Learning (ICML), 2023, 2022	20	2022
Decomposing and editing predictions by modeling model computation H Shah, A Ilyas, A Madry arXiv preprint arXiv:2404.11534, 2024	2	2024
Growing Attributed Networks through Local Processes H Shah, S Kumar, H Sundaram The World Wide Web Conference (WWW), 2019, 2019	2	2019
Number of Connected Components in a Graph: Estimation via Counting Patterns A Khetan, H Shah, S Oh arXiv preprint arXiv:1812.00139, 2018		2018

系统目前无法执行此操作，请稍后再试。

文章 1–6

每年引用数