Arnab Sharma

dblp:217/2388 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
6since 2021 · last 2026
0009-0007-8515-5253ORCID · corroborated

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

Software engineering, systems software and programming languages · 4 · 3 first-author · 1 since 2021Databases, data management, data science and information retrieval · 4 · 4 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Computer networks · 1
YearPublicationVenuePosition
2026 DeepFix: Debugging and Fixing Machine Learning Workflow using Agentic AI
Fadel Mamar Seydou, Arnab Sharma
ICST2
2026 Evaluating Noisy Optimization in Finetuning LMs for Neural Ranking
Daniel Vollmers, Arnab Sharma, Axel-Cyrille Ngonga Ngomo
NLDB2
2025 Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks
Sourabh Kapoor, Arnab Sharma, Michael Röder, Caglar Demir, Axel-Cyrille Ngonga Ngomo
ESWC (1)2
2025 Parameter Averaging in Link Prediction
Rupesh Sapkota, Caglar Demir, Arnab Sharma, Axel-Cyrille Ngonga Ngomo
K-CAP3
2025 Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help?
Adel Memariani, Michael Röder, Arnab Sharma, Caglar Demir, Axel-Cyrille Ngonga Ngomo
ISWC (1)3
2021 MLCHECK- Property-Driven Testing of Machine Learning Classifiers
abstract
An increasing amount of software with machine learning components is being deployed. This poses the question of quality assurance for such components: how can we validate whether specified requirements are fulfilled by a machine learned software? Current testing and verification approaches either focus on a single requirement (e.g., fairness) or specialize in a single type of machine learning model (e.g., neural networks). We propose the property-driven testing of machine learning models. Our approach MLCHECK encompasses (1) a language for property specification, and (2) a technique for systematic test case generation. The specification language is comparable to property-based testing languages. The test case generation employs an elaborate verification method for a systematic, property-dependent construction of test suites, without additional user-supplied generator functions. We evaluate MLCHECK using requirements and data sets from three different application areas (software discrimination, learning on knowledge graphs and security). Our evaluation shows that in addition to its generality, MLCHECK can outperform specialised testing approaches while having a comparable runtime.
Arnab Sharma, Caglar Demir, Axel-Cyrille Ngonga Ngomo, Heike Wehrheim
ICMLA1
2020 Higher income, larger loan? monotonicity testing of machine learning models
abstract
Today, machine learning (ML) models are increasingly applied in decision making. This induces an urgent need for quality assurance of ML models with respect to (often domain-dependent) requirements. Monotonicity is one such requirement. It specifies a software as ''learned'' by an ML algorithm to give an increasing prediction with the increase of some attribute values. While there exist multiple ML algorithms for ensuring monotonicity of the generated model, approaches for checking monotonicity, in particular of black-box models are largely lacking.
Arnab Sharma, Heike Wehrheim
ISSTA1
2020 Automatic Fairness Testing of Machine Learning Models
Arnab Sharma, Heike Wehrheim
ICTSS1
2019 Testing Machine Learning Algorithms for Balanced Data Usage
abstract
With the increased application of machine learning (ML) algorithms to decision-making processes, the question of fairness of such algorithms came into the focus. Fairness testing aims at checking whether a classifier as "learned" by an ML algorithm on some training data is biased in the sense of discriminating against some of the attributes (e.g. gender or age). Fairness testing thus targets the prediction phase in ML, not the learning phase. In this paper, we investigate fairness for the learning phase. Our definition of fairness is based on the idea that the learner should treat all data in the training set equally, disregarding issues like names or orderings of features or orderings of data instances. We term this property balanced data usage. We consequently develop a (metamorphic) testing approach called TiLe for checking balanced data usage. TiLe is applied on 14 ML classifiers taken from the scikit-learn library using 4 artificial and 9 real-world data sets for training, finding 12 of the classifiers to be unbalanced.
Arnab Sharma, Heike Wehrheim
ICST1
2019 Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets
Stefan Schneider 0008, Arnab Sharma, Holger Karl, Heike Wehrheim
IM2