The paper introduces a unified evaluation protocol for robust counterfactual explanations (CFE), testing six robust methods and two baselines across four tabular datasets under eight types of model change. It shows that robustness scores vary by change type and that methods designed for one change family may not transfer to others, with RobX performing most consistently. The study emphasizes the need for a common protocol that defines model changes, measures their impact, and separates generation performance from robustness.
By Marcin Kostrzewa, Maciej Zi\k{e}ba
arXiv:2505. 04608v5 Announce Type: replace-cross Abstract: Responsibly deploying artificial intelligence (AI) / machine learning (ML) systems in high-stakes settings arguably requires not only proof of system reliability, but also continual, post-deployment monitoring to quickly detect and address any unsafe behavior.
By Drew Prinster, Xing Han, Anqi Liu, Suchi Saria
arXiv:2609.06173v1 Announce Type: new
Abstract: Post-deployment drift poses a critical risk to algorithmic accountability, particularly when ground truth labels are delayed and performance degradatio...
By Muhammad Rehman Zafar, Ali El-Sharif, Naimul Khan
arXiv:2608.27704v1 Announce Type: new
Abstract: When machine learning classifiers are retrained, inputs correctly classified by the previous model version may be misclassified by the updated version,...
By Madhusudan Srinivasan, Namith Nishal Raphae
arXiv:2609.13914v1 Announce Type: new
Abstract: Machine-learning models are commonly developed under an assumption that training and test data are sufficiently complete, balanced, labelled, and drawn...
By Masoumeh Zareapoor
The paper introduces Counterfactual Test-Time Augmentation (CTTA) to mitigate shortcut exploitation in large language models. CTTA generates counterfactual edits of an input using an auxiliary model, then averages the LLM’s predictions across these edits, with theoretically optimal weights derived from the training distribution. The authors propose Select-CTTA, which selects among CTTA variants based on tests for assumption violations, and demonstrate that it outperforms other test-time methods and rivals models fine‑tuned on shortcut‑balanced data.
By Katie Matton, Rosalind W. Picard, John Guttag, Maggie Makar