Explainable Text Classification

Follow this topic Ask about this topic

Latest papers

17 papers1 paper in the last four weeks, down 67% on the four weeks before. 0.0% of all new papers.

Oct 12, 2026

Reasoning for Propaganda Detection via Label-Guided CoT Optimisation

Propaganda detection systems usually operate as black boxes, lacking explanations. To address this, we hypothesise that persuasive techniques contain definitional characteristics with respect to their social-political setting. We introduce ReCoT, a reasoning-conditioned detection framework that captures definitional cues of persuasive techniques via population-level refinement and performance-guided resampling, without requiring additional explanation annotations. On INDI-PROPspan, ReCoT achieves a macro F1_LCS of 0.364, surpassing baselines and reaching 88% of the SFT upper bound on Avg F1_LCS. Similarly, on PTC, ReCoT reaches 85% of the SFT upper bound on Avg F1_LCS, closing much of this gap while remaining interpretable. Importantly, the analysis of the reasoning pool's convergence and update pattern for ReCoT shows effective refinement of reasoning CoTs.

Zeba Afroz, Harsh Vardhan, Md. Shad Akhtar

Indraprastha Institute of Information Technology Delhi

Explainable Text Classification CoT Reasoning Text Classification LLM Reasoning

Sep 23, 2026

An Explainable DistilBERT-BiLSTM-Attention Framework for Binary and Multi-Class Hate Speech Detection

Hate speech on social media poses serious risks to social harmony, mental well-being, and public safety, making its timely and accurate detection essential for content moderation systems. Most existing studies focus on binary classification, evaluated their frameworks on a single dataset, and provide limited insight into how decisions are made, which limits their real-world applicability. In addition, limited work is done on the explainability of their predictive inference. To address these challenges, this study proposes a multilevel and explainable hate speech detection framework. The proposed model integrates DistilBERT (Distilled Bidirectional Encoder Representations from Transformers) embeddings with a Bi-LSTM (Bidirectional Long Short-Term Memory) model, and an attention mechanism to capture both contextual meaning and sequential dependencies in text. To enhance trust and transparency, LIME (Local Interpretable Model-agnostic Explanations) is employed to explain model predictions by highlighting influential textual features. The framework is evaluated on two benchmark datasets using both binary and multi-class classification to examine robustness and generalization. In addition, an ablation study is presented to highlight the significance of various components of proposed framework. For binary classification, the proposed model achieves F1-scores of 96.78% on the Davidson dataset and 99.53% on the SMHS dataset. In the multi-class setting, it attains F1-scores of 97.00% and 94.99% on the Davidson and SMHS datasets, respectively, outperforming existing baseline approaches. The results demonstrate that multilevel evaluation improves the reliability that the proposed framework effectively balances performance and efficiency. This makes the framework suitable for practical hate speech moderation systems that require accurate, generalizable, and explainable decisions.

Rameesha Zia, Muhammad Shahid Iqbal Malik

School of Computing Sciences, Pak-Austria Fachhochschule, Institute of Applied Sciences and Technology, Haripur 22620, Pakistan

Explainable Text Classification Text Classification Hate Speech Detection

Aug 29, 2026

Explainable Multi-Loss Distillation Framework for Efficient and Interpretable Shrimp Disease Text Classification

Shrimp disease classification has become an urgent issue due to its significant impact on the import-export output of producing countries, particularly Vietnam. Most existing studies focus on image-based classification, which typically operates at the late stage of disease manifestation. Therefore, text-based classification has the potential to enable early and timely disease detection. To address this limitation, we introduce the SALT (Shrimp disease text Analysis with multi-Loss disTillation) framework, which incorporates explainability analysis using Local Interpretable Model-agnostic Explanations (LIME) and SHapley Additive exPlanations (SHAP) to evaluate model predictions and interpret the learned linguistic features. Experimental results demonstrate that SALT achieves competitive performance across multiple distillation objectives, outperforming supervised baselines while providing a favorable trade-off between predictive performance and computational efficiency. Moreover, it exhibits strong explainability, accurately identifying key linguistic features and semantic patterns relevant to disease descriptions. These findings highlight the potential of knowledge distillation-based text classification for future applications in early shrimp disease diagnosis and related research directions.

Anh Nguyen Quynh, Khang Nguyen Quoc, Luyl-Da Quach

Explainable Text Classification Text Classification Knowledge Distillation

Aug 21, 2026

MIL-BERT: Classification of Arbitrarily Large Text with Performance and Explanatory Guarantees

Many text classification decisions are viable based on constituent excerpts alone. Taking inspiration from the field of multiple instance learning, we present an algorithm for training a neural network to classify text by selecting such excerpts. We show that our approach is also scalable with demonstrated learning against samples with nearly 1M tokens. We evaluate our methods on 7 datasets with emphasis on long-textual collections that far exceed the encoding limit of our base model. We present state-of-the-art results with this algorithm on 3 datasets: identification of political bias in news outlets, trigger warnings in long stories, and demographic characteristics of authors in tweet collections. Furthermore, the model trained on weakly-labeled collections of text (bags) generalizes to accurately classify constituent, smaller instances. Besides a new state-of-the-art for these problems, this approach is one of the few neural methods to excel in these datasets.

John Cadigan, Dayne Freitag, Eric Yeh

SRI International

Explainable Text Classification Text Classification Weakly Supervised Learning Multiple Instance Learning

Aug 17, 2026

J-Miner: Recovering the Decision Logic of Fine-Tuned LLM Classifiers as Compact Rules

Task-fine-tuned large language model (LLM) classifiers acquire task-specific decision knowledge, but this knowledge remains implicit in distributed internal computations, making their decision logic difficult to interpret. We introduce the Executable Decision Compression (EDC) framework and propose J-Miner, which mines vocabulary-named variables from internal readouts and learns rules shared across inputs to produce executable explanations. Analysis reveals that a small set of these variables captures much of the classifier's decision behavior, holding for both varying parameter scales within a family and distinct families. Across six binary tasks, a rule using just one variable reproduces 76.7% of source-classifier decisions on average, rising to 88.8% with 16 variables. Most of the decision information retained by these variables comes from internal activations beyond literal surface matching. A lightweight text reader predicts the variable states, allowing the same fixed rules to execute independently of the source classifier.

Yunfan Gao, Xinyi Huang, Tao Sheng +3

Shanghai Research Institute for Intelligent Autonomous Systems, Tongji University · Shanghai Key Laboratory of Data Science, College of Computer Science and Artificial Intelligence, Fudan University · Meituan +1

LLM Interpretability Interpretable ML Classification Explainable Text Classification

Aug 13, 2026

DMDIntel: Interpreting Large Language Models via Dynamic Mode Decomposition

In this work, we introduce DMDIntel which uses dynamic mode decomposition (DMD) to make the predictions made by LLMs in a classification task interpretable. It develops an input attribution pipeline, that first decomposes the hidden states of an LLM into prominent patterns, also known as modes, and then associates ranks to the input tokens based on the projection values on those modes. Rigorous experiments across three datasets and three model families consistently show that the ranked attribution of input tokens obtained using DMDIntel by far outperforms state-of-the-art techniques such as principal component analysis, integrated gradients and SHAP.

Amogh Joshi, Animesh Mukherjee, Sergey Utyuzhnikov

IIT Kharagpur, India · University of Manchester, UK

Feature Attribution LLM Interpretability Explainable Text Classification

Aug 12, 2026

When Explanations Betray Backdoors: Black-Box Auditing for Language Model Classifiers

Language model classifiers with explanations are used for moderation, routing, topic triage, and low-resource annotation. We study black-box auditing when the defender has only clean calibration data without trigger information but can ask the classifier for a label plus a short rationale or quoted evidence. We introduce Groundedness Drift, a lightweight score measuring whether the answer summary remains grounded in the input. Across two 7B backbones, five datasets, and four common non-adaptive OpenBackdoor-style attack families, Groundedness Drift achieves higher AUROC and lower residual target ASR than every compared detector in all cases at a nominal 5% clean-FPR budget. We then evaluate Unsupported Groundedness, a multi-probe escalation for explanation-camouflage stress cases. Unsupported Groundedness improves signals but does not close the adaptive gap.

Yang Liu, Ran Zou

Department of Statistics and Operations Research, University of North Carolina at Chapel Hill · Department of Statistics, University of California, Irvine

Language Model Auditing LLM Backdoor Attacks Backdoor Detection Backdoor Defense in LLMs Classification Explainability Evaluation+2

Jul 29, 2026

Automated Multilabel Mpox Research Classification with Explainable Transformer Models

The Mpox outbreak remains a serious public health issue, with the WHO (World Health Organization) reporting increasing cases in some regions. Research on Mpox is vital for several reasons, including vaccine development, diagnostic improvement, viral evolution studies, and preventing future outbreaks. However, the large amount of research being published makes it difficult to organize and analyze information efficiently. This study focuses on using multilabel classification to categorize 14590 Mpox research articles into key topics such as outbreaks, vaccination, and epidemiology. Among the different AI models tested, BERT performed the best, achieving 97.05% accuracy, 97.67% micro F1 score, and 96.46% macro F1 score. To better understand how the model makes decisions, SHAP was used to analyze significant word features and patterns. The results show that BERT can help automate the classification of Mpox research, making it easier for researchers, policymakers, and healthcare workers to quickly find relevant information, saving time and improving public health efforts.

Tanjim Taharat Aurpa

Department of Data Science and Engineering, University of Frontier Technology, Bangladesh (UFTB)

Explainable Text Classification Multi-Label Classification Bidirectional Encoder Representations from Transformers Text Classification

May 27, 2026

Structured Prompt Optimization Meets Reinforcement Learning for Global and Local Interpretability over Complex Text

LLMs have advanced text classification, yet existing paradigms face a trade-off: supervised (label only) fine-tuning is scalable but offers limited reasoning on complex text and lacks broader model transparency, while discrete prompt optimization offers human-readable instructions but struggles with performance and scalability. We introduce eXTC (eXplainable Text Classifier) with three progressive stages: (1) learning a Standard Operating Procedure (SOP, or rulebook) in natural language via a new Structured Prompt Optimization algorithm; (2) SOP-grounded reasoning distillation from a large teacher LLM into a compact LM; and (3) expanding reasoning capabilities beyond the initial SOP via reinforcement learning. This design enables eXTC to provide (i) fast inference via a compact LM, with (ii) inference-time local reasoning traces, alongside a global, modular explanation of its learned domain rules, while (iii) significantly outperforming existing paradigms across diverse benchmarks in both classification performance and explanation quality, with stage-by-stage gains.

Tianyang Zhou, Wenbo Chen, Pierre Jinghong Liang +1

1Carnegie Mellon University · 2Amazon

Explainable Text Classification LLM Interpretability Text Classification Prompt Optimization

May 27, 2026

Show, Don't TELL: Explainable AI-Generated Text Detection

Research on AI-generated text detection has presented a number of approaches to discern human from AI prose, some of which achieving high in-distribution performance. However, real-world applicability has stalled because their outputs are misaligned with the needs of users, such as professors, who are presented with a numeric score that has no attached explanation. We tackle this issue with a novel architecture, TELL, that bakes explainability from the ground-up. While our system still offers a numerical score like other detectors for comparability, TELL takes a fundamentally different approach where we aim to show the user the "tells" by which the model believes a text is AI or human-written, to empower the user to decide who wrote a text using their own judgment and understanding of the context of the writing and its alleged author. We train TELL on a custom SFT dataset of domain-specific authorship annotations, and further refine the system using GRPO with curriculum learning to improve performance. We achieve competitive performance with state-of-the-art detectors (AUROC 0.927) while natively providing annotations that explain the basis for the detector's decision. We further evaluate the quality of our explanations using a dataset of human annotations and report a high (mean 72.3%) win-rate on annotation concreteness, falsifiability, coherence, plausibility and grounding, allowing users to critically think and decide for themselves. Our work thus reframes the problem of AI-generated text detection in a human-centric perspective and paves the way for a new family of detectors that focus on native explainability.

Aldan Creo, Suraj Ranganath

School of Computing, Information and Data Sciences University of California, San Diego United States of America

Explainable Artificial Intelligence AI-Generated Text Detection Human Oversight of AI Explainability Evaluation Explainable Text Classification

May 26, 2026

ExTax: Explainable Disinformation Detection via Persuasion, Emotion, and Narrative Role Taxonomies

The democratization of LLMs has accelerated the generation and circulation of highly fluent disinformation, making traditional syntax-semantic verification increasingly insufficient. Such deception rarely relies solely on surface-level falsity; instead, it often combines persuasive rhetoric, emotional manipulation, and narrative role construction to influence readers' interpretations through multiple cognitive pathways. However, existing detectors typically emphasize isolated signals -- such as syntax, external knowledge, persuasion, or affective cues -- and therefore struggle to capture the multi-faceted manipulative intents underlying disinformation or provide human-auditable explanations. To address this gap, we present ExTax, a taxonomy-aligned framework for explainable disinformation detection. ExTax unifies persuasive rhetoric, emotional manipulation, and narrative roles into a 17-dimensional taxonomic space, covering 6 persuasive-rhetoric strategies, 5 emotional-manipulation methods, and 6 narrative-role categories. It elicits attributes from multiple frontier LLMs, reconciles their disagreements through Entropy-driven Dynamic Label Smoothing, and fuses the resulting taxonomic representations with contextual encodings via Heterogeneous Multi-Head Attention, grounding each prediction in an interpretable manipulation profile. Across five cross-domain and cross-genre benchmarks, ExTax achieves an overall Macro

F_1

of

0.8456

, outperforming state-of-the-art deep learning and LLM-based baselines. It also remains robust under severe genre imbalance, where the strongest deep baseline degrades from

0.9454

to

0.6194

.

Shang Luo, Yingguang Yang, Zhenchen Sun +8

Peking University · University of Science and Technology of China · North China University of Science and Technology +6

Fake News Detection Explainable Artificial Intelligence Text Classification Automated Fact-Checking Explainable Text Classification

May 20, 2026

Interpretable Discriminative Text Representations via Agreement and Label Disentanglement

Interpretable text representations should expose coordinates that are not only predictive, but also meaningful enough for independent auditors to apply. Existing discriminative representations often use anonymous embedding directions, while concept-bottleneck and LLM-assisted methods attach natural-language names to features without ensuring that those definitions are reproducible or distinct from the target label. We propose an operational criterion for interpretable discriminative text representations: each coordinate should satisfy conceptual clarity, measured by chance-adjusted agreement between independent annotators applying the feature definition, and label disentanglement, meaning the feature should not merely paraphrase the prediction target. We instantiate this criterion in LLM-assisted Feature Discovery (LFD), an iterative method that proposes lexical and semantic features from contrastive outcome-opposed text pairs, screens candidates using cross-LLM Cohen's

κ

, and selects features by residual held-out predictive gain. A stylized analysis connects the

κ

screen to a per-feature annotation-noise bound, formalizing agreement as a reliability check. Across ten text-classification tasks spanning seven corpora, LFD matches the predictive performance of a strong text bottleneck baseline while producing substantially clearer and less label-entangled features. Human audits with 232 raters show that LFD features achieve higher human--human and human--LLM agreement than baseline concepts, and raters consistently judge them as less label-leaking. These results suggest that agreement-tested, label-disentangled coordinates provide a practical auditability standard for interpretable text classification.

Tong Wang, Yiqing Xu, Leo Yang Yang

School of Management Yale University New Haven, CT, US, 06511 · Department of Accountancy, Economics and Finance Hong Kong Baptist University Kowloon, Hong Kong SAR

Disentangled Representation Learning Interpretable ML Text Classification Explainability Evaluation Explainable Text Classification

May 19, 2026

Lost in Interpretation: The Plausibility-Faithfulness Trade-off in Cross-Lingual Explanations

LLMs deployed multilingually are often audited via English explanations for non-English inputs. We evaluate extractive explanations ''where the model identifies input token spans as evidence alongside a generated rationale'' and uncover a systematic trade-off: English-pivot explanations can achieve higher span agreement with human rationales while their evidence becomes less causally grounded in the model's prediction, as measured by both comprehensiveness and sufficiency. Across 3 tasks, 5~~languages, and 2~~multilingual LLM families, we find that English explanations frequently produce fluent but loosely anchored rationales, with comprehensiveness degrading by up to 5.7x relative to native-language conditions - even as task accuracy remains stable across settings. For socially nuanced classification, English pivots also fail to preserve pragmatic cues, reducing both faithfulness and span agreement. We recommend auditing explanations in the input language, reporting multi-faceted faithfulness metrics beyond lexical overlap, and treating English rationales as communication summaries rather than faithful decision traces.

Somnath Banerjee, Pranav Jha, Rima Hazra +1

Indian Institute of Technology Kharagpur · TCG Crest · National University of Singapore

Language Model Auditing Cross-Lingual Reasoning in Language Models LLM Interpretability Explainability Evaluation Multilingual Language Model Evaluation Faithfulness of Language Model Explanations+3

Apr 14, 2026

ToxiTrace: Gradient-Aligned Training for Explainable Chinese Toxicity Detection

Existing Chinese toxic content detection methods mainly target sentence-level classification but often fail to provide readable and contiguous toxic evidence spans. We propose ToxiTrace, an explainability-oriented method for BERT-style encoders with three components: (1) CuSA, which refines encoder-derived saliency cues into fine-grained toxic spans with lightweight LLM guidance; (2) GCLoss, a gradient-constrained objective that concentrates token-level saliency on toxic evidence while suppressing irrelevant activations; and (3) ARCL, which constructs sample-specific contrastive reasoning pairs to sharpen the semantic boundary between toxic and non-toxic content. Experiments show that ToxiTrace improves classification accuracy and toxic span extraction while preserving efficient encoder-based inference and producing more coherent, human-readable explanations. We have released the model at https://huggingface.co/ArdLi/ToxiTrace.

Boyang Li, Hongzhe Shou, Yuanyuan Liang +2

School of Data Science and Engineering, East China Normal University · School of International Chinese Studies, East China Normal University

Toxicity Detection Explainable Text Classification Gradient-Based Attribution

Mar 20, 2026

Fighting AI with AI: AI-Agent Augmented DNS Blocking of LLM Services during Student Evaluations

The transformative potential of large language models (LLMs) in education, such as improving accessibility and personalized learning, is being eclipsed by significant challenges. These challenges stem from concerns that LLMs undermine academic assessment by enabling bypassing of critical thinking, leading to increased cognitive offloading. This emerging trend stresses the dual imperative of harnessing AI's educational benefits while safeguarding critical thinking and academic rigor in the evolving AI ecosystem. To this end, we introduce AI-Sinkhole, an AI-agent augmented DNS-based framework that dynamically discovers, semantically classifies, and temporarily network-wide blocks emerging LLM chatbot services during proctored exams. AI-Sinkhole offers explainable classification via quantized LLMs (LLama 3, DeepSeek-R1, Qwen-3) and dynamic DNS blocking with Pi-Hole. We also share our observations in using LLMs as explainable classifiers which achieved robust cross-lingual performance (F1-score > 0.83). To support future research and development in this domain initial codes with a readily deployable 'AI-Sinkhole' blockist is available on https://github.com/AIMLEdu/ai-sinkhole.

Yonas Kassa, James Bonacci, Ping Wang

School of Data Intelligence and Technology, Robert Morris University, Pittsburgh, USA.

Explainable Text Classification Academic Integrity Generative AI in Education Cybersecurity

Mar 5, 2026

NOTAI.AI: Explainable Detection of Machine-Generated Text via Curvature and Feature Attribution

We present NotAI.AI, an explainable AI-generated text detection system. Instead of returning only a binary label or confidence score, the system shows which signals influenced the prediction and lets users inspect an attribution-based sensitivity estimate obtained by subtracting selected local contributions. NotAI.AI combines sentence-level conditional probability curvature, a neural detector score, and interpretable stylometric and readability features in an XGBoost meta-classifier. It explains predictions with TreeSHAP feature contributions and can turn the resulting evidence into a concise natural-language explanation. We evaluate the system on a category-balanced subset of RAID containing human-written, clean AI-generated, and attacked AI-generated texts. The full model outperforms variants based on individual feature families, reaching 0.9685 F1 on the held-out within-subset test split. In an automatic evaluation, two model judges rate 94.5-98.6% of generated explanations as faithful to the supplied detector evidence. The web interface (https://notai-ai.vercel.app), source code (https://github.com/Oleksandr-MB/EMNLP2026DEMO_NotAI.AI), and demonstration video(https://youtu.be/l8Nk8kdBTHQ) are publicly available.

Oleksandr Marchenko Breneur, Adelaide Danilov, Aria Nourbakhsh +1

Department of Computer Science, Faculty of Science, Technology and Medicine, University of Luxembourg

AI-Generated Text Detection Explainable Text Classification Explainable Artificial Intelligence Robustness of Machine-Generated Text Detection

Feb 27, 2026

What You Read is What You Classify: Highlighting Attributions to Text and Text-Like Inputs

At present, there are no easily understood explainable artificial intelligence (AI) methods for discrete token inputs, like text. Most explainable AI techniques do not extend well to token sequences, where both local and global features matter, because state-of-the-art models, like transformers, tend to focus on global connections. Therefore, existing explainable AI algorithms fail by (i) identifying disparate tokens of importance, or (ii) assigning a large number of tokens a low value of importance. This method for explainable AI for tokens-based classifiers generalizes a mask-based explainable AI algorithm for images. It starts with an Explainer neural network that is trained to create masks to hide information not relevant for classification. Then, the Hadamard product of the mask and the continuous values of the classifier's embedding layer is taken and passed through the classifier, changing the magnitude of the embedding vector but keeping the orientation unchanged. The Explainer is trained for a taxonomic classifier for nucleotide sequences and it is shown that the masked segments are less relevant to classification than the unmasked ones. This method focused on the importance the token as a whole (i.e., a segment of the input sequence), producing a human-readable explanation.

Daniel S. Berman, Brian Merritt, Stanley Ta +4

Johns Hopkins Applied Physics Laboratory, 11100 Johns Hopkins Rd., Laurel, MD 20723, USA. · Current affiliation: Google DeepMind, 14–18 Handyside Street, London, N1C 4DN, United Kingdom

Explainable Text Classification Explainable Artificial Intelligence Feature Attribution Perturbation-Based Feature Attribution