Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Amir Abolfazli

dblp:282/4590 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2025
0000-0003-0630-3937ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Software testing · 100%
Artificial intelligence
1 paper
Reinforcement learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
deep reinforcement learning
0.712023
A Deep Reinforcement Learning Approach to Configuration Sampling Problem · ICDM 2023
Software testing › configuration testing
configuration space sampling
0.712023
A Deep Reinforcement Learning Approach to Configuration Sampling Problem · ICDM 2023
Software testing
configuration testing
0.712023
A Deep Reinforcement Learning Approach to Configuration Sampling Problem · ICDM 2023

Methods — techniques the papers use, named apart from their topics

t-wise coverage · 1.3deep reinforcement learning · 1.3
YearPublicationVenuePosition
2025 Enhancing Offline Reinforcement Learning with Curriculum Learning-Based Trajectory Valuation
Amir Abolfazli, Zekun Song, Avishek Anand, Wolfgang Nejdl
AAMAS1
2023 A Deep Reinforcement Learning Approach to Configuration Sampling Problem
abstract
Configurable software systems have become increasingly popular as they enable customized software variants. The main challenge in dealing with configuration problems is that the number of possible configurations grows exponentially as the number of features increases. Therefore, algorithms for testing customized software have to deal with the challenge of tractably finding potentially faulty configurations given exponentially large configurations. To overcome this problem, prior works focused on sampling strategies to significantly reduce the number of generated configurations, guaranteeing a high t-wise coverage. In this work, we address the configuration sampling problem by proposing a deep reinforcement learning (DRL) based sampler that efficiently finds the trade-off between exploration and exploitation, allowing for the efficient identification of a minimal subset of configurations that covers all t-wise feature interactions while minimizing redundancy. We also present the CS-Gym, an environment for the configuration sampling. We benchmark our results against heuristic-based sampling methods on eight different feature models of software product lines and show that our method outperforms all sampling methods in terms of sample size. Our findings indicate that the achieved improvement has major implications for cost reduction, as the reduction in sample size results in fewer configurations that need to be tested.
Amir Abolfazli, Jakob Spiegelberg, Gregory Palmer, Avishek Anand
ICDM1
2020 Drift-Aware Multi-Memory Model for Imbalanced Data Streams
abstract
Online class imbalance learning deals with data streams that are affected by both concept drift and class imbalance. Online learning tries to find a trade-off between exploiting previously learned information and incorporating new information into the model. This requires both the incremental update of the model and the ability to unlearn outdated information. The improper use of unlearning, however, can lead to the retroactive interference problem, a phenomenon that occurs when newly learned information interferes with the old information and impedes the recall of previously learned information. The problem becomes more severe when the classes are not equally represented, resulting in the removal of minority information from the model. In this work, we propose the Drift-Aware Multi-Memory Model (DAM3), which addresses the class imbalance problem in online learning for memory-based models. DAM3 mitigates class imbalance by incorporating an imbalance-sensitive drift detector, preserving a balanced representation of classes in the model, and resolving retroactive interference using a working memory that prevents the forgetting of old information. We show through experiments on real-world and synthetic datasets that the proposed method mitigates class imbalance and outperforms the state-of-the-art methods.
Amir Abolfazli, Eirini Ntoutsi
IEEE BigData1