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

Junhao Liu 0002

dblp:98/8858-2 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0004-9949-6583ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Trustworthy machine learning · 95% Language models and text generation · 5%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
1.922026
Revitalizing Black-Box Interpretability: Actionable Interpretability for LLMs via Proxy Models · ACL (1) 2026
ReX: A Framework for Incorporating Temporal Information in Model-Agnostic Local Explanation Techniques · AAAI 2025
Machine learning › Trustworthy machine learning › interpretability › post-hoc explanation
model-agnostic explanation
1.922026
Revitalizing Black-Box Interpretability: Actionable Interpretability for LLMs via Proxy Models · ACL (1) 2026
ReX: A Framework for Incorporating Temporal Information in Model-Agnostic Local Explanation Techniques · AAAI 2025
Machine learning › Trustworthy machine learning › interpretability
post-hoc explanation
1.012026
Revitalizing Black-Box Interpretability: Actionable Interpretability for LLMs via Proxy Models · ACL (1) 2026
Program verification › invariant generation
loop invariant generation
1.012026
Guiding LLM-Based Loop Invariant Synthesis via Feedback on Local Reasoning Errors · ACM Trans. Program. Lang. Syst. 2026
Machine learning › Trustworthy machine learning › interpretability
local explanation
0.912025
ReX: A Framework for Incorporating Temporal Information in Model-Agnostic Local Explanation Techniques · AAAI 2025
Natural language and speech › Language models and text generation › prompting
prompt engineering
0.312026
Revitalizing Black-Box Interpretability: Actionable Interpretability for LLMs via Proxy Models · ACL (1) 2026

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

screen-and-apply verification · 1.0proxy model · 1.0natural language proof · 1.0large language model · 1.0first-order logic · 1.0surrogate model · 0.9sampling · 0.9anchors · 0.9LIME · 0.9KernelSHAP · 0.9
YearPublicationVenuePosition
2026 Revitalizing Black-Box Interpretability: Actionable Interpretability for LLMs via Proxy Models
abstract
Post-hoc explanations provide transparency and are essential for guiding model optimization, such as prompt engineering and data sanitation.However, applying model-agnostic techniques to Large Language Models (LLMs) is hindered by prohibitive computational costs, rendering these tools dormant for real-world applications.To revitalize model-agnostic interpretability, we propose a budget-friendly proxy framework that leverages efficient models to approximate the decision boundaries of expensive LLMs.We introduce a screen-and-apply mechanism to statistically verify local alignment before deployment.Our empirical evaluation confirms that proxy explanations achieve over 90% fidelity with only 9.5% of the oracle's cost.Building on this foundation, we demonstrate the actionable utility of our framework in prompt compression and poisoned example removal.Results show that reliable proxy explanations effectively guide optimization, transforming interpretability from a passive observation tool into a scalable primitive for LLM development.Additionally, we open-source code and datasets to facilitate future research 1 .
Junhao Liu 0002, Haonan Yu, Xin Zhang 0035
ACL (1)1
2026 Guiding LLM-Based Loop Invariant Synthesis via Feedback on Local Reasoning Errors
abstract
We propose a novel framework that provides constructive feedback to an LLM in the “guess-and-check” paradigm by formally verifying its own thinking process and detecting local reasoning errors. We apply this framework to the loop invariant synthesis problem. We prompt the model to produce a step-by-step natural language proof justifying its thinking process for the failed verification condition of its generated loop invariants. Then, we use an LLM to translate the reasoning steps into first-order logic implications, which can be checked automatically. An invalid implication pinpoints the exact logical flaw in the LLM’s thinking process, which we then use to construct targeted feedback for refinement. We have implemented our approach in a tool called LORIS and evaluated it on a main benchmark suite of 460 C programs and an additional benchmark suite of 50 C programs each of which involves non-linear properties. On the main benchmark suite, LORIS solved 445 of the programs and achieved an overall success rate of 93.1%. LORIS also demonstrates robustness on the challenging non-linear benchmark suite.
Junhao Liu 0002, Peng Di, Xin Zhang 0035
ACM Trans. Program. Lang. Syst.3
2025 ReX: A Framework for Incorporating Temporal Information in Model-Agnostic Local Explanation Techniques
abstract
Existing local model-agnostic explanation techniques are ineffective for machine learning models that consider inputs of variable lengths, as they do not consider temporal information embedded in these models. To address this limitation, we propose ReX, a general framework for incorporating temporal information in these techniques. Our key insight is that these techniques typically learn a model surrogate by sampling model inputs and outputs, and we can incorporate temporal information in a uniform way by only changing the sampling process and the surrogate features. We instantiate our approach on three popular explanation techniques: Anchors, LIME, and Kernel SHAP. To evaluate the effectiveness of ReX, we apply our approach to six models in three different tasks. Our evaluation results demonstrate that our approach 1) significantly improves the fidelity of explanations, making model-agnostic techniques outperform a state-of-the-art model-specific technique on its target model, and 2) helps end users better understand the models' behaviors.
Junhao Liu 0002, Xin Zhang 0035
AAAI1