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

Mohammadsina Almasi

dblp:419/8050 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

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.

Artificial intelligence
1 paper
Reinforcement learning · 39% Efficient and distributed learning · 30% Trustworthy machine learning · 30%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › bandit
contextual bandit
1.012026
Bi-Level Contextual Bandits for Individualized Resource Allocation Under Delayed Feedback · AAAI 2026
Machine learning › Trustworthy machine learning
fairness
1.012026
Bi-Level Contextual Bandits for Individualized Resource Allocation Under Delayed Feedback · AAAI 2026
Machine learning › Efficient and distributed learning
resource allocation
1.012026
Bi-Level Contextual Bandits for Individualized Resource Allocation Under Delayed Feedback · AAAI 2026
Machine learning › Reinforcement learning
delayed feedback
0.312026
Bi-Level Contextual Bandits for Individualized Resource Allocation Under Delayed Feedback · AAAI 2026

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

neural network · 1.0delay kernels · 1.0
YearPublicationVenuePosition
2026 Bi-Level Contextual Bandits for Individualized Resource Allocation Under Delayed Feedback
abstract
Equitably allocating limited resources in high-stakes domains—such as education, employment, and healthcare—requires balancing short-term utility with long-term impact, while accounting for delayed outcomes, hidden heterogeneity, and ethical constraints. However, most learning-based allocation frameworks either assume immediate feedback or ignore the complex interplay between individual characteristics and intervention dynamics. We propose a novel bi-level contextual bandit framework for individualized resource allocation under delayed feedback, designed to operate in real-world settings with dynamic populations, capacity constraints, and time-sensitive impact. At the meta level, the model optimizes subgroup-level budget allocations to satisfy fairness and operational constraints. At the base level, it identifies the most responsive individuals within each group using a neural network trained on observational data, while respecting cooldown windows and delayed treatment effects modeled via resource-specific delay kernels. By explicitly modeling temporal dynamics and feedback delays, the algorithm continually refines its policy as new data arrive, enabling more responsive and adaptive decision-making. We validate our approach on two real-world datasets from education and workforce development, showing that it achieves higher cumulative outcomes, better adapts to delay structures, and ensures equitable distribution across subgroups. Our results highlight the potential of delay-aware, data-driven decision-making systems to improve institutional policy and social welfare.
Mohammadsina Almasi, Hadis Anahideh
AAAI1
2026 Adaptive Pareto Exploration (APEX) for Fairness-Aware Hyperparameter Optimization in FairPilot
Mohammadsina Almasi, Nazanin Nezami, Francesco Di Carlo, Abolfazl Asudeh, Hadis Anahideh
Inf. Softw. Technol.1