Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nikhil Prakash

dblp:227/0705 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
5since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Systems, architecture and hardware · 1Human-computer interaction and ubiquitous computing · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Trustworthy machine learning · 44% Efficient and distributed learning · 20% Deep learning architectures and training · 15%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › interpretability
mechanistic interpretability
1.622025
MIB: A Mechanistic Interpretability Benchmark · ICML 2025
Fine-Tuning Enhances Existing Mechanisms: A Case Study on Entity Tracking · ICLR 2024
Machine learning › Efficient and distributed learning
distributed training
0.912025
NNsight and NDIF: Democratizing Access to Open-Weight Foundation Model Internals · ICLR 2025
Machine learning › Trustworthy machine learning
interpretability
0.912025
MIB: A Mechanistic Interpretability Benchmark · ICML 2025
Machine learning › Transfer learning and domain adaptation
fine-tuning
0.812024
Fine-Tuning Enhances Existing Mechanisms: A Case Study on Entity Tracking · ICLR 2024
Machine learning › Efficient and distributed learning
inference serving
0.312025
NNsight and NDIF: Democratizing Access to Open-Weight Foundation Model Internals · ICLR 2025
Natural language and speech › Language models and text generation
large language model
0.312025
NNsight and NDIF: Democratizing Access to Open-Weight Foundation Model Internals · ICLR 2025
Natural language and speech › Information extraction and text analysis
entity tracking
0.212024
Fine-Tuning Enhances Existing Mechanisms: A Case Study on Entity Tracking · ICLR 2024

Methods — techniques the papers use, named apart from their topics

sparse autoencoder · 0.9intervention graph · 0.9distributed alignment search · 0.9deferred remote execution · 0.9attribution patching · 0.9circuit analysis · 0.8activation patching · 0.8
YearPublicationVenuePosition
2025 NNsight and NDIF: Democratizing Access to Open-Weight Foundation Model Internals
abstract
We introduce NNsight and NDIF, technologies that work in tandem to enable scientific study of the representations and computations learned by very large neural networks. NNsight is an open-source system that extends PyTorch to introduce deferred remote execution. The National Deep Inference Fabric (NDIF) is a scalable inference service that executes NNsight requests, allowing users to share GPU resources and pretrained models. These technologies are enabled by the Intervention Graph, an architecture developed to decouple experimental design from model runtime. Together, this framework provides transparent and efficient access to the internals of deep neural networks such as very large language models (LLMs) without imposing the cost or complexity of hosting customized models individually. We conduct a quantitative survey of the machine learning literature that reveals a growing gap in the study of the internals of large-scale AI. We demonstrate the design and use of our framework to address this gap by enabling a range of research methods on huge models. Finally, we conduct benchmarks to compare performance with previous approaches. Code, documentation, and tutorials are available at https://nnsight.net/.
Jaden Fiotto-Kaufman, Alexander R. Loftus, Eric Todd, Jannik Brinkmann, Koyena Pal, Dmitrii Troitskii, Michael Ripa, Adam Belfki, Can Rager, Caden Juang, Aaron Mueller, Samuel Marks, Arnab Sen Sharma, Francesca Lucchetti, Nikhil Prakash, Carla E. Brodley, Arjun Guha, Jonathan Bell 0001, Byron C. Wallace, David Bau
ICLR15
2025 MIB: A Mechanistic Interpretability Benchmark
abstract
How can we know whether new mechanistic interpretability methods achieve real improvements? In pursuit of lasting evaluation standards, we propose MIB, a Mechanistic Interpretability Benchmark, with two tracks spanning four tasks and five models. MIB favors methods that precisely and concisely recover relevant causal pathways or causal variables in neural language models. The circuit localization track compares methods that locate the model components---and connections between them---most important for performing a task (e.g., attribution patching or information flow routes). The causal variable track compares methods that featurize a hidden vector, e.g., sparse autoencoders (SAE) or distributed alignment search (DAS), and align those features to a task-relevant causal variable. Using MIB, we find that attribution and mask optimization methods perform best on circuit localization. For causal variable localization, we find that the supervised DAS method performs best, while SAEs features are not better than neurons, i.e., non-featurized hidden vectors. These findings illustrate that MIB enables meaningful comparisons, and increases our confidence that there has been real progress in the field.
Aaron Mueller, Atticus Geiger, Sarah Wiegreffe, Dana Arad, Iván Arcuschin, Adam Belfki, Yik Siu Chan, Jaden Fiotto-Kaufman, Tal Haklay, Michael Hanna 0001, Rohan Gupta, Yaniv Nikankin, Hadas Orgad, Nikhil Prakash, Anja Reusch, Aruna Sankaranarayanan, Shun Shao, Alessandro Stolfo, Martin Tutek, Amir Zur, David Bau, Yonatan Belinkov
ICML15
2024 Fine-Tuning Enhances Existing Mechanisms: A Case Study on Entity Tracking
abstract
Fine-tuning on generalized tasks such as instruction following, code generation, and mathematics has been shown to enhance language models' performance on a range of tasks. Nevertheless, explanations of how such fine-tuning influences the internal computations in these models remain elusive. We study how fine-tuning affects the internal mechanisms implemented in language models. As a case study, we explore the property of entity tracking, a crucial facet of language comprehension, where models fine-tuned on mathematics have substantial performance gains. We identify a mechanism that enables entity tracking and show that (i) both the original model and its fine-tuned version implement entity tracking with the same circuit. In fact, the entity tracking circuit of the fine-tuned version performs better than the full original model. (ii) The circuits of all the models implement roughly the same functionality, that is entity tracking is performed by tracking the position of the correct entity in both the original model and its fine-tuned version. (iii) Performance boost in the fine-tuned model is primarily attributed to its improved ability to handle positional information. To uncover these findings, we employ two methods: DCM, which automatically detects model components responsible for specific semantics, and CMAP, a new approach for patching activations across models to reveal improved mechanisms. Our findings suggest that fine-tuning enhances, rather than fundamentally alters, the mechanistic operation of the model.
Nikhil Prakash, Tamar Rott Shaham, Tal Haklay, Yonatan Belinkov, David Bau
ICLR1
2023 Supporting Requesters in Writing Clear Crowdsourcing Task Descriptions Through Computational Flaw Assessment
abstract
Quality control is an, if not the, essential challenge in crowdsourcing. Unsatisfactory responses from crowd workers have been found to particularly result from ambiguous and incomplete task descriptions, often from inexperienced task requesters. However, creating clear task descriptions with sufficient information is a complex process for requesters in crowdsourcing marketplaces. In this paper, we investigate the extent to which requesters can be supported effectively in this process through computational techniques. To this end, we developed a tool that enables requesters to iteratively identify and correct eight common clarity flaws in their task descriptions before deployment on the platform. The tool can be used to write task descriptions from scratch or to assess and improve the clarity of prepared descriptions. It employs machine learning-based natural language processing models trained on real-world task descriptions that score a given task description for the eight clarity flaws. On this basis, the requester can iteratively revise and reassess the task description until it reaches a sufficient level of clarity. In a first user study, we let requesters create task descriptions using the tool and rate the tool’s different aspects of helpfulness thereafter. We then carried out a second user study with crowd workers, as those who are confronted with such descriptions in practice, to rate the clarity of the created task descriptions. According to our results, 65% of the requesters classified the helpfulness of the information provided by the tool high or very high (only 12% as low or very low). The requesters saw some room for improvement though, for example, concerning the display of bad examples. Nevertheless, 76% of the crowd workers believe that the overall clarity of the task descriptions created by the requesters using the tool improves over the initial version. In line with this, the automatically-computed clarity scores of the edited task descriptions were generally higher than those of the initial descriptions, indicating that the tool reliably predicts the clarity of task descriptions in overall terms.
Zahra Nouri, Nikhil Prakash, Ujwal Gadiraju, Henning Wachsmuth
IUI2
2021 Rapid Mapping of Landslides Triggered by the Storm Alex, October 2020
abstract
On 2ndand 3rdOctober 2020, Storm Alex hit northern Italy and southern France regions with 500 mm of rainfall in about 24 hours. This triggered devastating flash floods and landslides, causing severe damages and 15 fatalities. This study presents a landslide inventory map obtained by using a generalized deep-learning model, avoiding human interaction in the workflow by skipping the time-consuming training step. A total of 1,249 landslides have been mapped with this approach in minutes after a suitable post-event satellite image was available for processing. Our results show how deep-learning strategies applied to remote sensing data can help in the aftermath of catastrophic events for the rapid detection and mapping of landslide phenomena.
Nikhil Prakash, Andrea Manconi
IGARSS1
2020 CVIN: Connected Vehicle Information Network
abstract
Blockchain technology has been widely explored in the automotive sector for a variety of applications. In particular, Mobility Open Blockchain Initiative (MOBI)-a non-profit alliance with over 70% of the world's large automakers-is actively developing a vehicle identity standard, which will serve as the foundation for other blockchain use cases such as vehicle-tovehicle payments and automotive financing. Despite the great potential of the vehicle identity standard as outlined in MOBI's official documents, a cost-effective design and implementation is still missing in the literature. In response, we propose CVIN (Connected Vehicle Information Network) as our technical design and implementation of MOBI's vehicle identity standard. First, we explain why Hyperledger Indy and Aries can be used as a basic building block of CVIN and describe how other building blocks can be integrated with Indy and Aries in order to offer additional advantages. Second, we propose to use the AURORA Connected Vehicle Testbed to evaluate the performances of CVIN with a particular focus on its security, privacy, latency, and interoperability. Third, we identify two major technical challenges and propose several solutions by leveraging edge computing and sidechain technology. Finally, we plan to opensource parts or all of CVIN, and we believe that our contribution together with the AURORA testbed will support our research community for rapid innovation.
Nikhil Prakash, David G. Michelson
VTC Spring1
2018 Unikernels as Processes
abstract
System virtualization (e.g., the virtual machine abstraction) has been established as the de facto standard form of isolation in multi-tenant clouds. More recently, unikernels have emerged as a way to reuse VM isolation while also being lightweight by eliminating the general purpose OS (e.g., Linux) from the VM. Instead, unikernels directly run the application (linked with a library OS) on the virtual hardware. In this paper, we show that unikernels do not actually require a virtual hardware abstraction, but can achieve similar levels of isolation when running as processes by leveraging existing kernel system call whitelisting mechanisms. Moreover, we show that running unikernels as processes reduces hardware requirements, enables the use of standard process debugging and management tooling, and improves the already impressive performance that unikernels exhibit.
Dan Williams 0001, Ricardo Koller, Martin Lucina, Nikhil Prakash
SoCC4