default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSahil Verma 0003
Person information
- affiliation: University of Washington, Seattle, WA, USA
Other persons with the same name
- Sahil Verma — disambiguation page
- Sahil Verma 0001
![[0009-0004-0558-0267]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0009-0004-0558-0267")
— Amazon - Sahil Verma 0002 — Chandigarh Group of Colleges, Jhanjeri, Mohali, Punjab, India
- Sahil Verma 0004 — National Institute of Technology Patna, India
- Sahil Verma 0005 — Chemical Engineering, IIT Ropar, Rupnagar, Punjab, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j3]Sahil Verma, Gantavya Bhatt, Avi Schwarzschild, Soumye Singhal, Arnav Mohanty Das, Chirag Shah, John P. Dickerson, Pin-Yu Chen, Jeff Bilmes:
Effective Backdoor Mitigation in Vision-Language Models Depends on the Pre-training Objective. Trans. Mach. Learn. Res. 2025 (2025)- [c7]Arnav M. Das, Gantavya Bhatt, Lilly Kumari, Sahil Verma, Jeff Bilmes:
COBRA: COmBinatorial Retrieval Augmentation for Few-Shot Adaptation. CVPR 2025: 20534-20546 - [i13]Sahil Verma, Keegan Hines, Jeff Bilmes, Charlotte Siska, Luke Zettlemoyer, Hila Gonen, Chandan Singh:
OMNIGUARD: An Efficient Approach for AI Safety Moderation Across Modalities. CoRR abs/2505.23856 (2025) - 2024
- [j2]Sahil Verma, Varich Boonsanong, Minh Hoang, Keegan Hines, John Dickerson, Chirag Shah:
Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Review. ACM Comput. Surv. 56(12): 312:1-312:42 (2024) - [i12]Sahil Verma, Royi Rassin, Arnav Das, Gantavya Bhatt, Preethi Seshadri, Chirag Shah, Jeff A. Bilmes, Hannaneh Hajishirzi, Yanai Elazar:
How Many Van Goghs Does It Take to Van Gogh? Finding the Imitation Threshold. CoRR abs/2410.15002 (2024) - [i11]Arnav Mohanty Das, Gantavya Bhatt, Lilly Kumari, Sahil Verma, Jeff Bilmes:
COBRA: COmBinatorial Retrieval Augmentation for Few-Shot Learning. CoRR abs/2412.17684 (2024) - 2023
- [c6]Sahil Verma, Ashudeep Singh, Varich Boonsanong, John P. Dickerson, Chirag Shah:
RecRec: Algorithmic Recourse for Recommender Systems. CIKM 2023: 4325-4329 - [i10]Sahil Verma, Ashudeep Singh, Varich Boonsanong, John P. Dickerson, Chirag Shah:
RecRec: Algorithmic Recourse for Recommender Systems. CoRR abs/2308.14916 (2023) - [i9]Sahil Verma, Gantavya Bhatt, Avi Schwarzschild, Soumye Singhal, Arnav Mohanty Das, Chirag Shah, John P. Dickerson, Jeff A. Bilmes:
Effective Backdoor Mitigation Depends on the Pre-training Objective. CoRR abs/2311.14948 (2023) - 2022
- [c5]Sahil Verma, Keegan Hines, John P. Dickerson:
Amortized Generation of Sequential Algorithmic Recourses for Black-Box Models. AAAI 2022: 8512-8519 - 2021
- [j1]Sahil Verma, Subhajit Roy:
Debug-localize-repair: a symbiotic construction for heap manipulations. Formal Methods Syst. Des. 58(3): 399-439 (2021) - [i8]Sahil Verma, Michael D. Ernst, René Just:
Removing biased data to improve fairness and accuracy. CoRR abs/2102.03054 (2021) - [i7]Sahil Verma, Keegan Hines, John P. Dickerson:
Amortized Generation of Sequential Counterfactual Explanations for Black-box Models. CoRR abs/2106.03962 (2021) - [i6]Sahil Verma, John P. Dickerson, Keegan Hines:
Counterfactual Explanations for Machine Learning: Challenges Revisited. CoRR abs/2106.07756 (2021) - [i5]Sahil Verma, Aditya Lahiri, John P. Dickerson, Su-In Lee:
Pitfalls of Explainable ML: An Industry Perspective. CoRR abs/2106.07758 (2021) - 2020
- [c4]Sahil Verma, Ruoyuan Gao, Chirag Shah:
Facets of Fairness in Search and Recommendation. BIAS 2020: 1-11 - [i4]Sahil Verma, Ruoyuan Gao, Chirag Shah:
Facets of Fairness in Search and Recommendation. CoRR abs/2008.01194 (2020) - [i3]Sahil Verma, John P. Dickerson, Keegan Hines:
Counterfactual Explanations for Machine Learning: A Review. CoRR abs/2010.10596 (2020) - [i2]Sahil Verma, Subhajit Roy:
Debug-Localize-Repair: A Symbiotic Construction for Heap Manipulations. CoRR abs/2011.13396 (2020) - [i1]Sahil Verma, Zhendong Su:
ShapeFlow: Dynamic Shape Interpreter for TensorFlow. CoRR abs/2011.13452 (2020)
2010 – 2019
- 2019
- [c3]Sahil Verma, Roland H. C. Yap:
Benchmarking Symbolic Execution Using Constraint Problems - Initial Results. ICTAI 2019: 1-9 - 2018
- [c2]Sahil Verma, Julia Rubin:
Fairness definitions explained. FairWare@ICSE 2018: 1-7 - 2017
- [c1]Sahil Verma, Subhajit Roy:
Synergistic debug-repair of heap manipulations. ESEC/SIGSOFT FSE 2017: 163-173
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 2025-11-28 04:31 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:
