Mikhail Baklanov

dblp:387/2322 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
0000-0001-7237-8852ORCID · reported

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

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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.

Databases, data mining, and information retrieval
2 papers
Recommender systems · 76% Information retrieval · 24%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
explainable recommendation
1.922026
Fidelity-Aware Recommendation Explanations via Stochastic Path Integration · AAAI 2026
Refining Fidelity Metrics for Explainable Recommendations · SIGIR 2025
Machine learning › Trustworthy machine learning › interpretability › explanation evaluation
explanation faithfulness
1.012026
Fidelity-Aware Recommendation Explanations via Stochastic Path Integration · AAAI 2026
Machine learning › Trustworthy machine learning
interpretability
1.012026
Fidelity-Aware Recommendation Explanations via Stochastic Path Integration · AAAI 2026
Information retrieval
evaluation
0.912025
Refining Fidelity Metrics for Explainable Recommendations · SIGIR 2025
Recommender systems › recommender system evaluation
off-policy evaluation
0.912025
Refining Fidelity Metrics for Explainable Recommendations · SIGIR 2025

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

stochastic path integration · 2.0baseline sampling · 2.0counterfactual perturbation metrics · 0.9
YearPublicationVenuePosition
2026 Fidelity-Aware Recommendation Explanations via Stochastic Path Integration
abstract
Explanation fidelity, which measures how accurately an explanation reflects a model’s true reasoning, remains critically underexplored in recommender systems. We introduce SPINRec (Stochastic Path Integration for Neural Recommender Explanations), a model-agnostic approach that adapts path-integration techniques to the sparse and implicit nature of recommendation data. To overcome the limitations of prior methods, SPINRec employs stochastic baseline sampling: instead of integrating from a fixed or unrealistic baseline, it samples multiple plausible user profiles from the empirical data distribution and selects the most faithful attribution path. This design captures the influence of both observed and unobserved interactions, yielding more stable and personalized explanations. We conduct the most comprehensive fidelity evaluation to date across three models (MF, VAE, NCF), three datasets (ML1M, Yahoo! Music, Pinterest), and a suite of counterfactual metrics, including AUC-based perturbation curves and fixed-length diagnostics. SPINRec consistently outperforms all baselines, establishing a new benchmark for faithful explainability in recommendation.
Oren Barkan, Yahlly Schein, Yehonatan Elisha, Veronika Bogina, Mikhail Baklanov, Noam Koenigstein
AAAI5
2025 Refining Fidelity Metrics for Explainable Recommendations
abstract
Counterfactual evaluation provides a promising framework for assessing explanation fidelity in recommender systems, but perturbation metrics adapted from computer vision suffer three key limitations: (1) they conflate explaining and contradictory features, (2) they average over entire user histories instead of prioritizing concise, high-impact explanations, and (3) they use fixed-percentage perturbations, leading to inconsistencies across users.We introduce refined counterfactual metrics that focus on the most relevant explaining features, exclude contradictory elements, and assess fidelity at a fixed explanation length, ensuring a more consistent and interpretable evaluation.Our code is at: https:// github.com/DeltaLabTLV/FidelityMetrics4XRec
Mikhail Baklanov, Veronika Bogina, Yehonatan Elisha, Yahlly Schein, Liron I. Allerhand, Oren Barkan, Noam Koenigstein
SIGIR1
2024 CEERS: Counterfactual Evaluations of Explanations in Recommender Systems
abstract
The increasing focus on explainability within ethical AI, mandated by frameworks such as GDPR, highlights the critical need for robust explanation mechanisms in Recommender Systems (RS). A fundamental aspect of advancing such methods involves developing reproducible and quantifiable evaluation metrics. Traditional evaluation approaches involving human subjects are inherently non-reproducible, costly, subjective, and context-dependent. Furthermore, the complexity of AI models often transcends human comprehension capabilities, rendering it challenging for evaluators to ascertain the accuracy of explanations. Consequently, there is an urgent need for objective and scalable metrics that can accurately assess explanation methods in RS. Drawing inspiration from established practices in computer vision, this research introduces a counterfactual methodology to evaluate the accuracy of explanations in RS.
Mikhail Baklanov
RecSys1