English
Related papers

Related papers: Revitalizing Black-Box Interpretability: Actionabl…

200 papers

Interpretability is the study of explaining models in understandable terms to humans. At present, interpretability is divided into two paradigms: the intrinsic paradigm, which believes that only models designed to be explained can be…

Machine Learning · Computer Science 2024-11-14 Andreas Madsen , Himabindu Lakkaraju , Siva Reddy , Sarath Chandar

Large Language Models (LLMs) are traditionally viewed as black-box algorithms, therefore reducing trustworthiness and obscuring potential approaches to increasing performance on downstream tasks. In this work, we apply an effective LLM…

Computation and Language · Computer Science 2025-07-10 Shun Wang , Tyler Loakman , Youbo Lei , Yi Liu , Bohao Yang , Yuting Zhao , Dong Yang , Chenghua Lin

The debate between self-interpretable models and post-hoc explanations for black-box models is central to Explainable AI (XAI). Self-interpretable models, such as concept-based networks, offer insights by connecting decisions to…

Machine Learning · Computer Science 2025-02-26 Shaobo Wang , Hongxuan Tang , Mingyang Wang , Hongrui Zhang , Xuyang Liu , Weiya Li , Xuming Hu , Linfeng Zhang

Pretrained transformer-based Language Models (LMs) are well-known for their ability to achieve significant improvement on NLP tasks, but their black-box nature, which leads to a lack of interpretability, has been a major concern. My…

Computation and Language · Computer Science 2024-12-06 Ximing Wen

Deep reinforcement learning (RL) has shown remarkable success in complex domains, however, the inherent black box nature of deep neural network policies raises significant challenges in understanding and trusting the decision-making…

Machine Learning · Computer Science 2025-01-20 Peilang Li , Umer Siddique , Yongcan Cao

Post-hoc explainability methods are a subset of Machine Learning (ML) that aim to provide a reason for why a model behaves in a certain way. In this paper, we show a new black-box model-agnostic adversarial attack for post-hoc explainable…

Machine Learning · Computer Science 2025-11-14 Leonardo Pesce , Jiawen Wei , Gianmarco Mengaldo

Interpretability is critical for applications of large language models (LLMs) in the legal domain, where trust and transparency are essential. A central NLP task in this setting is legal outcome prediction, where models forecast whether a…

Computation and Language · Computer Science 2026-04-08 Mahammad Namazov , Tomáš Koref , Ivan Habernal

Automated Machine Learning-based systems' integration into a wide range of tasks has expanded as a result of their performance and speed. Although there are numerous advantages to employing ML-based systems, if they are not interpretable,…

Machine Learning · Computer Science 2022-12-08 Ioannis Mollas , Nick Bassiliades , Grigorios Tsoumakas

Large language models (LLMs) are increasingly applied to multi-modal data analysis -- not necessarily because they offer the most precise answers, but because they provide fluent, flexible interfaces for interpreting complex inputs. Yet…

Computation and Language · Computer Science 2025-09-30 Zhengxuan Zhang , Zhuowen Liang , Yin Wu , Teng Lin , Yuyu Luo , Nan Tang

We propose Black Box Explanations through Transparent Approximations (BETA), a novel model agnostic framework for explaining the behavior of any black-box classifier by simultaneously optimizing for fidelity to the original model and…

Artificial Intelligence · Computer Science 2017-07-06 Himabindu Lakkaraju , Ece Kamar , Rich Caruana , Jure Leskovec

Prompt Engineering has garnered significant attention for enhancing the performance of large language models across a multitude of tasks. Techniques such as the Chain-of-Thought not only bolster task performance but also delineate a clear…

Computation and Language · Computer Science 2024-10-21 Wei Jie Yeo , Ranjan Satapathy , Rick Siow Mong Goh , Erik Cambria

Large Language Models (LLMs) have catalyzed transformative advances across a spectrum of natural language processing tasks through few-shot or zero-shot prompting, bypassing the need for parameter tuning. While convenient, this modus…

Artificial Intelligence · Computer Science 2024-03-12 Zhen Tan , Jie Peng , Tianlong Chen , Huan Liu

In response to the demand for Explainable Artificial Intelligence (XAI), we investigate the use of Large Language Models (LLMs) to transform ML explanations into natural, human-readable narratives. Rather than directly explaining ML models…

Artificial Intelligence · Computer Science 2024-05-13 Alexandra Zytek , Sara Pidò , Kalyan Veeramachaneni

Interpretability is crucial for building safe, reliable, and controllable language models, yet existing interpretability pipelines remain costly and difficult to scale. Interpreting a new model typically requires training model-specific…

Machine Learning · Computer Science 2026-04-27 Bruno Puri , Jim Berend , Sebastian Lapuschkin , Wojciech Samek

Large Language Models (LLMs) are increasingly being used in education, yet their correctness alone does not capture the quality, reliability, or pedagogical validity of their problem-solving behavior, especially in mathematics, where…

Computers and Society · Computer Science 2025-10-22 Sagnik Dakshit , Sushmita Sinha Roy

Automated log analysis is crucial in modern software-intensive systems for facilitating program comprehension throughout software maintenance and engineering life cycles. Existing methods perform tasks such as log parsing and log anomaly…

Software Engineering · Computer Science 2024-01-29 Yilun Liu , Shimin Tao , Weibin Meng , Jingyu Wang , Wenbing Ma , Yanqing Zhao , Yuhang Chen , Hao Yang , Yanfei Jiang , Xun Chen

Understanding the internal representations of large language models (LLMs) is a central challenge in interpretability research. Existing feature interpretability methods often rely on strong assumptions about the structure of…

Machine Learning · Computer Science 2025-09-30 Yifan Luo , Zhennan Zhou , Bin Dong

In black-box large language model (LLM) services, response reliability is often only partially observable at decision time, while stronger inference pathways incur substantial computational cost, inducing a budgeted sequential decision…

Artificial Intelligence · Computer Science 2026-05-01 Wenhao Yuan , Chenchen Lin , Jian Chen , Jinfeng Xu , Shuo Yang , Edith Cheuk Han Ngai

We present a novel approach for attacking black-box large language models (LLMs) by exploiting their ability to express confidence in natural language. Existing black-box attacks require either access to continuous model outputs like logits…

Cryptography and Security · Computer Science 2025-10-21 Jie Zhang , Meng Ding , Yang Liu , Jue Hong , Florian Tramèr

Large language models (LLMs) achieve impressive results over various tasks, and ever-expanding public repositories contain an abundance of pre-trained models. Therefore, identifying the best-performing LLM for a given task is a significant…

Computation and Language · Computer Science 2025-11-13 Idan Kashani , Avi Mendelson , Yaniv Nemcovsky
‹ Prev 1 4 5 6 7 8 10 Next ›