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

Zachary Coalson

dblp:359/5720 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
0009-0006-0821-3432ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
4 papers
Efficient and distributed learning · 34% Trustworthy machine learning · 34% Vision and language · 16%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware reliability and fault tolerance · 50% Hardware accelerators and domain-specific architectures · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › adaptive computation
adaptive inference
0.912025
Harnessing Input-Adaptive Inference for Efficient VLN · ICCV 2025
Computer vision › Vision and language
vision-and-language navigation
0.912025
Harnessing Input-Adaptive Inference for Efficient VLN · ICCV 2025
Hardware accelerators and domain-specific architectures › machine learning accelerator › DNN inference
LLM inference
0.912025
Demystifying the Resilience of Large Language Model Inference: An End-to-End Perspective · SC 2025
Hardware reliability and fault tolerance
soft errors
0.912025
Demystifying the Resilience of Large Language Model Inference: An End-to-End Perspective · SC 2025
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial robustness of language models
0.712023
BERT Lost Patience Won't Be Robust to Adversarial Slowdown · NeurIPS 2023
Machine learning › Efficient and distributed learning
inference efficiency
0.312025
Demystifying the Resilience of Large Language Model Inference: An End-to-End Perspective · SC 2025
Machine learning › Trustworthy machine learning › robustness
model robustness evaluation
0.312025
Demystifying the Resilience of Large Language Model Inference: An End-to-End Perspective · SC 2025

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

measurement study · 1.7fault injection · 1.7pretraining data selection · 0.9input-adaptive inference · 0.9influence functions · 0.9fine-tuning · 0.9input sanitization · 0.7adversarial training · 0.7adversarial text attack · 0.7
YearPublicationVenuePosition
2025 Harnessing Input-Adaptive Inference for Efficient VLN
Akhil Perincherry, Zachary Coalson, Aiden Gabriel, Stefan Lee, Sanghyun Hong 0001
ICCV3
2025 IF-Guide: Influence Function-Guided Detoxification of LLMs
abstract
We study how training data contributes to the emergence of toxic behaviors in large language models. Most prior work on reducing model toxicity adopts *reactive* approaches, such as fine-tuning pre-trained (and potentially toxic) models to align them with human values. In contrast, we propose a *proactive* approach—IF-Guide—that leverages influence functions to identify and suppress harmful tokens in the training data. To this end, we first show that standard influence functions are ineffective at discovering harmful training records. We then present a novel adaptation that measures token-level attributions from training data to model toxicity, along with techniques for selecting toxic training documents and a learning objective that can be integrated into both pre-training and fine-tuning. Moreover, IF-Guide does not rely on human-preference data, which is typically required by existing alignment methods. In our evaluation, we demonstrate that IF-Guide substantially reduces both explicit and implicit toxicity—by up to 10$\times$ compared to uncensored models, and up to 3$\times$ compared to baseline alignment methods such as DPO and RAD—across both pre-training and fine-tuning scenarios. IF-Guide is computationally efficient: a billion-parameter model is *not necessary* for computing influence scores; a million-parameter model—with 7.5$\times$ fewer parameters—can effectively serve as a proxy for identifying harmful data.
Zachary Coalson, Juhan Bae, Nicholas Carlini, Sanghyun Hong 0001
NeurIPS1
2025 Demystifying the Resilience of Large Language Model Inference: An End-to-End Perspective
abstract
Deep neural networks are known to be resilient to random bitwise faults in their parameters. However, this resilience has primarily been established through studies of classification models. The extent to which this claim holds for large-language models remains under-explored. In this work, we conduct an extensive measurement study on the impact of random bitwise faults in commercial-scale language model inference. We first expose that these language models are not truly resilient to random bit-flips. While aggregate metrics such as accuracy may suggest resilience, an in-depth inspection of the generated outputs shows significant degradation in text quality. Our analysis also shows that tasks requiring more complex reasoning suffer more from performance and quality degradation. Moreover, we extend our resilience analysis to models with augmented reasoning capabilities, such as Chain-of-Thought or Mixture of Experts architectures.
Zachary Coalson, Shiyang Chen 0004, Hang Liu 0001, Zhao Zhang 0007, Sanghyun Hong 0001, Bo Fang 0002, Lishan Yang 0001
SC2
2023 BERT Lost Patience Won't Be Robust to Adversarial Slowdown
abstract
In this paper, we systematically evaluate the robustness of multi-exit language models against adversarial slowdown. To audit their robustness, we design a slowdown attack that generates natural adversarial text bypassing early-exit points. We use the resulting WAFFLE attack as a vehicle to conduct a comprehensive evaluation of three multi-exit mechanisms with the GLUE benchmark against adversarial slowdown. We then show our attack significantly reduces the computational savings provided by the three methods in both white-box and black-box settings. The more complex a mechanism is, the more vulnerable it is to adversarial slowdown. We also perform a linguistic analysis of the perturbed text inputs, identifying common perturbation patterns that our attack generates, and comparing them with standard adversarial text attacks. Moreover, we show that adversarial training is ineffective in defeating our slowdown attack, but input sanitization with a conversational model, e.g., ChatGPT, can remove perturbations effectively. This result suggests that future work is needed for developing efficient yet robust multi-exit models. Our code is available at: https://github.com/ztcoalson/WAFFLE
Zachary Coalson, Gabriel Ritter, Rakesh Bobba, Sanghyun Hong 0001
NeurIPS1