Evgeny Frolov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Evgeny Frolov has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Danil Gusak
AIRI, Moscow, Russian Federation and Skoltech, Moscow, Russian Federation
12 shared publications - Alexey Vasilev
Sber AI Lab, Moscow, Russian Federation and HSE University, Moscow, Russian Federation
5 shared publications - Anna Volodkevich
SB AI Lab, Moscow, Russian Federation and AI Center, Moscow, Russian Federation
4 shared publications - Ivan Oseledets
Artificial Intelligence Research Institute (AIRI)
3 shared publications - Nikita Sukhorukov
AXXX, Moscow, Russian Federation, Skolkovo Institute of Science and Technology, Moscow, Russian Federation, and Higher School of Economics, Moscow, Russian Federation
3 shared publications - Veronika Ivanova
Yandex, Moscow, Russian Federation and Applied AI Institute, Moscow, Russian Federation
3 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 9018-9023
O ff T rail : A Benchmark for Natural-Language Context in Recommendation beyond Interaction Histories
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 9018-9023
Open AccessO ff T rail : A Benchmark for Natural-Language Context in Recommendation beyond Interaction Histories
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7173-7178
Group-Relative RL Post-Training for Sequential Recommendation
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7173-7178
Open AccessGroup-Relative RL Post-Training for Sequential Recommendation
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7913-7918
Preference-Aligned Semantic IDs for Generative Recommendation
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7913-7918
Open AccessPreference-Aligned Semantic IDs for Generative Recommendation
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7251-7255
Mitigating Negative Feedback in Sequential Recommendations with Barlow Twins
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7251-7255
Open AccessMitigating Negative Feedback in Sequential Recommendations with Barlow Twins
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4201-4211
Cross-Domain Sequential Recommendation with Representation-Level User Transfer
Cross-domain sequential recommendation aims to improve next-item prediction in a target domain by leveraging user behavior from auxiliary source domains. However, real-world deployment faces two critical challenges: business constraints that isolate interaction data across domains, and user heterogeneity, where many users lack cross-domain activity. This makes existing cross-domain methods difficult to apply. In this paper, we propose a simple and practical framework for cross-domain sequential recommendations that transfers information exclusively through learned user representations, without sharing raw interaction data or item embeddings across domains. We introduce a lightweight adapter that projects the source-domain user representation into the target-domain embedding space and integrates it with the target interaction sequence. Importantly, when source data is unavailable (i.e., the user observed only in the target domain), the model seamlessly defaults to a robust target-only sequential recommender, retaining benefits from joint training across all users. Extensive experiments were conducted under two setups; one targets benchmarking against previous baselines, while the other focuses on realistic and scalable conditions. Both sets of experiments demonstrate consistent performance gains for shared and unshared users.
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4201-4211
Open AccessCross-Domain Sequential Recommendation with Representation-Level User Transfer
Cross-domain sequential recommendation aims to improve next-item prediction in a target domain by leveraging user behavior from auxiliary source domains. However, real-world deployment faces two critical challenges: business constraints that isolate interaction data across domains, and user heterogeneity, where many users lack cross-domain activity. This makes existing cross-domain methods difficult to apply. In this paper, we propose a simple and practical framework for cross-domain sequential recommendations that transfers information exclusively through learned user representations, without sharing raw interaction data or item embeddings across domains. We introduce a lightweight adapter that projects the source-domain user representation into the target-domain embedding space and integrates it with the target interaction sequence. Importantly, when source data is unavailable (i.e., the user observed only in the target domain), the model seamlessly defaults to a robust target-only sequential recommender, retaining benefits from joint training across all users. Extensive experiments were conducted under two setups; one targets benchmarking against previous baselines, while the other focuses on realistic and scalable conditions. Both sets of experiments demonstrate consistent performance gains for shared and unshared users.
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 1688-1691
CoSID: Concept-Conditioned Semantic-ID Decoding for Efficient Generative Recommendation
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 1688-1691
Open AccessCoSID: Concept-Conditioned Semantic-ID Decoding for Efficient Generative Recommendation
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 1727-1730
More Test Users, More Overconfidence: Seed Variance in Sequential Recommender Tests
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 1727-1730
Open AccessMore Test Users, More Overconfidence: Seed Variance in Sequential Recommender Tests
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 1786-1789
Your 5-Core Train Split May Not Be 5-Core: Core Filtering and Temporal Splitting Do Not Commute
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 1786-1789
Open AccessYour 5-Core Train Split May Not Be 5-Core: Core Filtering and Temporal Splitting Do Not Commute
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 12-21
A Redundancy Reduction Approach for Controllable Sequential Recommendations
Sequential recommendation must operate under long-tailed item distributions and popularity-driven concentration, often forcing practitioners to trade short-list accuracy against long-tail exposure. In this work, we study feature decorrelation as a mechanism for shaping representation geometry in dot‑product sequential recommenders, and analyze how this, in turn, affects popularity‑driven concentration. We propose a decorrelation-regularized training framework that augments next-item prediction with an auxiliary redundancy-reduction term, and instantiate it with BT-SR, which uses the Barlow Twins objective. To form label-consistent positive pairs without synthetic corruptions, we pair user histories that share the same next-item target. Beyond accuracy, we provide a geometric analysis suggesting how decorrelation suppresses shared low-rank directions in the user representation space that may give popular items a global scoring advantage, and we introduce a bucket-based alignment concentration metric to quantify this effect. Experiments on five public benchmarks show that BT-SR consistently improves next-item ranking quality, while the decorrelation strength acts as a simple control knob that reallocates accuracy across head and tail items, enabling accuracy–exposure trade‑offs. Our analysis also reveals that the impact on head‑vs‑tail exposure differs across datasets, reflecting interactions between decorrelation and data temporal structure.
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 12-21
Open AccessA Redundancy Reduction Approach for Controllable Sequential Recommendations
Sequential recommendation must operate under long-tailed item distributions and popularity-driven concentration, often forcing practitioners to trade short-list accuracy against long-tail exposure. In this work, we study feature decorrelation as a mechanism for shaping representation geometry in dot‑product sequential recommenders, and analyze how this, in turn, affects popularity‑driven concentration. We propose a decorrelation-regularized training framework that augments next-item prediction with an auxiliary redundancy-reduction term, and instantiate it with BT-SR, which uses the Barlow Twins objective. To form label-consistent positive pairs without synthetic corruptions, we pair user histories that share the same next-item target. Beyond accuracy, we provide a geometric analysis suggesting how decorrelation suppresses shared low-rank directions in the user representation space that may give popular items a global scoring advantage, and we introduce a bucket-based alignment concentration metric to quantify this effect. Experiments on five public benchmarks show that BT-SR consistently improves next-item ranking quality, while the decorrelation strength acts as a simple control knob that reallocates accuracy across head and tail items, enabling accuracy–exposure trade‑offs. Our analysis also reveals that the impact on head‑vs‑tail exposure differs across datasets, reflecting interactions between decorrelation and data temporal structure.
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 801-807
Codebook-Based Semantic IDs in Generative Recommendation: Enabling Interface, Emerging Bottleneck
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 801-807
Open AccessCodebook-Based Semantic IDs in Generative Recommendation: Enabling Interface, Emerging Bottleneck