Arjun Roy 0001

dblp:42/9448-1 · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
9since 2021 · last 2025
0000-0002-4279-9442ORCID · verified

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

Artificial intelligence and machine learning · 6 · 4 first-author · 6 since 2021Databases, data management, data science and information retrieval · 5 · 2 first-author · 5 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021
YearPublicationVenuePosition
2025 MMM-fair: An Interactive Toolkit for Exploring and Operationalizing Multi-Fairness Trade-offs
abstract
Fairness-aware classification requires balancing performance and fairness, often intensified by intersectional biases. Conflicting fairness definitions further complicate the task, making it difficult to identify universally fair solutions. Despite growing regulatory and societal demands for equitable AI, popular toolkits offer limited support for exploring multi-dimensional fairness and related trade-offs. To address this, we present mmm-fair, an open-source toolkit leveraging boosting-based ensemble approaches that dynamically optimizes model weights to jointly minimize classification errors and diverse fairness violations, enabling flexible multi-objective optimization. The system empowers users to deploy models that align with their context-specific needs while reliably uncovering intersectional biases often missed by state-of-the-art methods. In a nutshell, mmm-fair uniquely combines in-depth multi-attribute fairness, multi-objective optimization, a no-code, chat-based interface, LLM-powered explanations, interactive Pareto exploration for model selection, custom fairness constraint definition, and deployment-ready models in a single open-source toolkit, a combination rarely found in existing fairness tools. Demo walkthrough available at: https://youtu.be/_rcpjlXFqkw.
Arjun Roy 0001, Emmanouil Panagiotou, Eirini Ntoutsi
CIKM2
2025 TabFairGDT: A Fast Fair Tabular Data Generator Using Autoregressive Decision Trees
abstract
Ensuring fairness in machine learning remains a significant challenge, as models often inherit biases from their training data. Generative models have recently emerged as a promising approach to mitigate bias at the data level while preserving utility. However, many rely on deep architectures, despite evidence that simpler models can be highly effective for tabular data. In this work, we introduce TabFairGDT, a novel method for generating fair synthetic tabular data using autoregressive decision trees. To enforce fairness, we propose a soft leaf resampling technique that adjusts decision tree outputs to reduce bias while preserving predictive performance. Our approach is non-parametric, effectively capturing complex relationships between mixed feature types, without relying on assumptions about the underlying data distributions. We evaluate TabFairGDT on benchmark fairness datasets and demonstrate that it outperforms state-of-the-art (SOTA) deep generative models, achieving better fairness-utility trade-off for downstream tasks, as well as higher synthetic data quality. Moreover, our method is lightweight, highly efficient, and CPU-compatible, requiring no data preprocessing. Remarkably, TabFairGDT achieves a 72% average speedup over the fastest SOTA baseline across various dataset sizes, and can generate fair synthetic data for medium-sized datasets (10 features, 10K samples) in just one second on a standard CPU, making it an ideal solution for realworld fairness-sensitive applications.
Emmanouil Panagiotou, Benoît Ronval, Arjun Roy 0001, Ludwig Bothmann, Bernd Bischl, Siegfried Nijssen, Eirini Ntoutsi
ICDM3
2024 FairBranch: Mitigating Bias Transfer in Fair Multi-task Learning
abstract
The generalisation capacity of Multi-Task Learning (MTL) suffers when unrelated tasks negatively impact each other by updating shared parameters with conflicting gradients. This is known as negative transfer and leads to a drop in MTL accuracy compared to single-task learning (STL). Lately, there has been a growing focus on the fairness of MTL models, requiring the optimization of both accuracy and fairness for individual tasks. Analogously to negative transfer for accuracy, task-specific fairness considerations might adversely affect the fairness of other tasks when there is a conflict of fairness loss gradients between the jointly learned tasks - we refer to this as bias transfer. To address both negative- and bias-transfer in MTL, we propose a novel method called FairBranch, which branches the MTL model by assessing the similarity of learned parameters, thereby grouping related tasks to alleviate negative transfer. Moreover, it incorporates fairness loss gradient conflict correction between adjoining task-group branches to address bias transfer within these task groups. Our experiments on tabular and visual MTL problems show that FairBranch outperforms state-of-the-art MTLs on both fairness and accuracy. Our code is available on github.com/arjunroyihrpa/FairBranch
Arjun Roy 0001, Christos Koutlis, Symeon Papadopoulos, Eirini Ntoutsi
IJCNN1
2022 Multi-fairness Under Class-Imbalance
Arjun Roy 0001, Vasileios Iosifidis, Eirini Ntoutsi
DS1
2022 Learning to Teach Fairness-Aware Deep Multi-task Learning
Arjun Roy 0001, Eirini Ntoutsi
ECML/PKDD (1)1
2022 Exploiting stance hierarchies for cost-sensitive stance detection of Web documents
Arjun Roy 0001, Pavlos Fafalios, Asif Ekbal, Xiaofei Zhu, Stefan Dietze
J. Intell. Inf. Syst.1
2022 Parity-based cumulative fairness-aware boosting
Vasileios Iosifidis, Arjun Roy 0001, Eirini Ntoutsi
Knowl. Inf. Syst.2
2021 Fair-Capacitated Clustering
Tai Le Quy, Arjun Roy 0001, Gunnar Friege, Eirini Ntoutsi
EDM2
2021 MulCoB-MulFaV: Multimodal Content Based Multilingual Fact Verification
abstract
Verifying fact of multimodal (text, image and/or videos) reports is emerging as an important challenge to prevent circulation of fake news reports in various online platform. Moreover, such reports often being posted in local languages penetrate even faster, making the problem more complex. To tackle such problem many fact verifying web sites have emerged, which deploys humans to manually find the truthfulness of such reports with the help of multimodal contents that are being used in such report. But in recent times, due to diversity of the problem owing to various political, and malicious motives, the existing (manual) system fails to handle the enormity. Existing content based approaches rely only on textual content of such reports and fail to handle the multimodal nature. On the other hand, existing multimodal based approaches rely only on the report based and user based features, and fail to interpret the fake contents with evidences. In this work, we propose a novel end-to-end automated multimodal content based multilingual fact verification system, which automates the task of fact verifying web sites, and provides evidences for every judgment. Evaluation results on three benchmark datasets show the robustness and effectiveness of our approach.
Arjun Roy 0001, Asif Ekbal
IJCNN1