Abstract
Counterfactual explanations (CFs) help users understand and act on black-box machine learning decisions by suggesting minimal changes to achieve a desired outcome. However, existing methods often ignore individual feasibility, leading to unrealistic or unactionable recommendations. We propose a personalized CF generation method based on cluster-specific fine-tuning of Generative Adversarial Networks (GANs). By grouping users with similar behavior and constraints, we adapt immutable features and cost weights per cluster, allowing GANs to generate more actionable and user-aligned counterfactuals. Experiments on the German Credit dataset show that our approach achieves a 6× improvement in prediction gain and a 30% reduction in sparsity compared to a baseline CounterGAN, while maintaining plausibility and acceptable latency for online use. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.

Abstract
Traffic flow prediction remains a complex task due to the intricate spatial and temporal correlations in real-world traffic data. Although existing graph neural network (GNN) approaches have shown promise in capturing these relationships, their high computational requirements limit their suitability for real-time deployment. To overcome these limitations, we propose spatiotemporal adaptive refinement with knowledge distillation (STARK), a novel and efficient framework that integrates graph fusion with adaptive knowledge distillation (AKD) in a spatiotemporal graph convolutional network (STGCN). Our method leverages graph fusion to capture both localized and global traffic dynamics, enhancing adaptability across diverse traffic conditions. It further employs two dedicated teacher models that independently emphasize spatial and temporal features, guiding a lightweight student model through a distillation process that dynamically adjusts based on prediction uncertainty. This adaptive learning mechanism enables the student model to prioritize and better learn from more difficult prediction instances. Evaluations on four benchmark traffic datasets [PEMS03, PEMS04, PEMSD7(M), and PEMS08] demonstrate that STARK achieves competitive predictive performance, measured by mean absolute error (MAE) and root mean square error (RMSE), while significantly reducing computational overhead. Our approach thus offers an effective and scalable solution for real-time traffic forecasting.

Abstract
Humour poses a unique challenge for artificial intelligence, as it often relies on non-literal language, cultural references, and linguistic creativity. The JOKER Lab, now in its fourth year, aims to advance computational humour research through shared tasks on curated, multilingual datasets, with applications in education, computer-mediated communication and translation, and conversational AI. This paper provides an overview of the JOKER Lab held at CLEF 2025, detailing the setup and results of its three main tasks: (1) humour-aware information retrieval, which involves searching a document collection for humorous texts relevant to user queries in either English or Portuguese; (2) pun translation, focussed on humour-preserving translation of paronomastic jokes from English into French; and (3) onomastic wordplay translation, a task addressing the translation of name-based wordplay from English into French. The 2025 edition builds upon previous iterations by expanding datasets and emphasising nuanced, manual evaluation methods. The Task 1 results show a marked improvement this year, apparently due to participants' judicious combination of retrieval and filtering techniques. Tasks 2 and 3 remain challenging, not only in terms of system performance but also in terms of defining meaningful and reliable evaluation metrics.

Abstract

Abstract

Abstract