- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a multi-scale interest decomposition and mixing model for sequential recommendation, aiming to capture users’ stable and dynamic interests and their interactions. The model constructs multi-scale sequence representations using historical windows of different lengths, extracts stable and dynamic interests through smoothing and residual computation, and introduces a cross-scale interest mixer to facilitate information exchange across temporal scales. Finally, it integrates the cross-scale updates with the original representations and employs scale aggregation and a gating mechanism for next-item prediction. Comparative experiments on multiple datasets support the effectiveness of the proposed method.
Critical strengths
-
The paper provides relatively comprehensive experimental validation. It compares the proposed method with 17 baselines on four public datasets and further conducts ablation studies, sensitivity analyses, visualization analyses, computational efficiency analyses, and statistical significance tests. These experiments validate the effectiveness of the proposed method from multiple perspectives, and the results also demonstrate a certain degree of practical value.
-
The paper is generally well-written, with clear and detailed descriptions of the proposed methodology. The appendix provides relatively comprehensive experimental settings, implementation details, and supplementary experiments. In addition, the authors have made their code publicly available, making the work generally easy to understand and reproduce.
Critical weaknesses
-
The paper lacks sufficient novelty. The overall technical approach is quite similar to TimeMixer (https://openreview.net/pdf?id=7oLshfEIC2 ICLR 2024) in the time series forecasting domain, including multi-scale modeling and cross-scale information mixing. Although transferring these ideas to sequential recommendation has some merit, the paper does not introduce sufficient substantive innovations beyond this adaptation. Moreover, the underlying research problem (personalized modeling) has already been extensively studied. In my view, the paper lacks sufficient novelty in both its research problem and technical methodology, falling well short of the level of methodological innovation expected at ICLR.
-
The paper provides insufficient details regarding experimental fairness. The authors do not adequately specify the training configurations, hyperparameter search procedures, or model selection strategies for the baseline methods, raising concerns about the fairness of the comparisons. In addition, the publicly available code repository lacks the evaluation.py file, making it currently impossible to directly reproduce the complete experimental results. Given that the paper relies heavily on comparisons with numerous baselines to substantiate the effectiveness of the proposed method, these issues require clear explanations and clarification.
Questions for authors
-
Could the authors clarify what substantive methodological innovations this paper introduces compared with TimeMixer? Beyond transferring ideas from the time series forecasting domain to sequential recommendation, could the authors further explain the core innovations of this work and its main differences from existing methods?
-
Could the authors provide more details on the experimental configurations of the baseline methods to help assess the fairness of the comparisons?
-
The publicly available code repository lacks the necessary evaluation files, making it currently impossible to reproduce the complete experimental results. Could the authors provide further clarification and the necessary instructions for reproduction?
8 comments
Response to Reviewer Cp6b - Q1 (2/2) Research questions and technical approaches in relation to existing personalization methods
We thank the reviewer for their comments on related work. MiRec’s key distinction is to decompose stable and dynamic interests within the same historical range, then integrate same-type components across historical ranges through structured subspace exchange. We explain this distinction through method design and experimental results.
(1) Method design: combining within-scale interest decomposition with structured cross-scale interaction.
History windows determine temporal coverage, while stable and dynamic interests characterize how components vary within each range. The following table summarizes the differences from representative methods.
| Method | Main focus and techniques | Smoothing/residual decomposition at each scale | Cross-scale subspace exchange with approximately doubly stochastic weights |
|---|---|---|---|
| ComiRec-SA (Cen et al., 2020) [1] | Extracts multiple interest vectors through self-attention and balances recommendation accuracy and diversity | — | — |
| IDURL (Lin et al., 2025) [2] | Quantifies interest drift, learns drift representations, and performs cross-user alignment | — | — |
| HyperHawkes (Peintner et al., 2025) [3] | Models recurring long-term intents through Hawkes processes and short-term interests through attention, combining them at the prediction-score level | — | — |
| MIMAR-SRec (Fang & Shi, 2026) [4] | Models multi-granularity intents through prototype alignment, cross-user contrastive learning, and adversarial augmentation | — | — |
| MiRec | Separates stable/dynamic components within each scale and integrates same-type interests across scales | ✓ | ✓ |
MiRec constructs the two interest representations through causal smoothing and residual decomposition. At the same prediction position, it learns source-to-target subspace correspondences between adjacent scales to update the stable and dynamic branches separately. These architectural attributes distinguish its design from the compared methods.
(2) Experimental results: additional comparisons with multiscale and decomposition methods.
Results for the additional baselines are shown below. Each cell reports HR@10 / NDCG@10.
| Method | Beauty | ML-1M |
|---|---|---|
| MiRec | 0.5007 / 0.3461 | 0.8078 / 0.5693 |
| Pyramid Mixer [5] | 0.4482 / 0.2995 | 0.7466 / 0.5040 |
| ScaleRec [6] | 0.4942 / 0.3454 | 0.7984 / 0.5556 |
| DWTRec [7] | 0.4696 / 0.3252 | 0.7675 / 0.5340 |
| IDCLRec [8] | 0.4709 / 0.3252 | 0.7534 / 0.4963 |
| WPGRec [9] | 0.4563 / 0.3008 | 0.7006 / 0.4374 |
MiRec achieves higher results on both metrics across both datasets. Compared with ScaleRec, the strongest additional baseline, MiRec improves HR@10 and NDCG@10 by 1.32% and 0.20% on Beauty and 1.18% and 2.47% on ML-1M, respectively, supporting the effectiveness of its overall modeling framework.
The method design is presented in Sections 3.3–3.4, and the additional baseline results are provided in Appendix C.6.2, Table 9.
[1] Cen Y, Zhang J, Zou X, et al. Controllable multi-interest framework for recommendation. In Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining. 2020: 2942-2951.
[2] Lin X, Pan W, Ming Z. Towards interest drift-driven user representation learning in sequential recommendation. In Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval. 2025: 1541-1551.
[3] Peintner A, Mohammadi A R, Müller M, et al. Hypergraph-based temporal modelling of repeated intent for sequential recommendation. In Proceedings of the ACM on Web Conference 2025. 2025: 3809-3818.
[4] Fang Y, Shi H. Multi-granularity intent modeling with adversarial robustness for sequential recommendation. In Proceedings of the AAAI Conference on Artificial Intelligence. 2026, 40(17): 14702-14710.
[5] Gong Z, Fan Z, Lu H, et al. Pyramid Mixer: Multi-dimensional multi-period interest modeling for sequential recommendation. In Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval. 2025: 4380-4384.
[6] Li H, Yang Y, Zeng J, et al. Multi-Scale transformers with dual attention and adaptive masking for sequential recommendation. Information Processing & Management, 2026, 63(1): 104318.
[7] Lu S, Ge M, Zhang J, et al. Filtering with time-frequency analysis: an adaptive and lightweight model for sequential recommender systems based on discrete wavelet transform. In Proceedings of the International Conference on Intelligent Computing. 2025: 161-173.
[8] Choi Y, Lim C. Intent-interest disentanglement and item-aware intent contrastive learning for sequential recommendation. arXiv preprint arXiv:2501.07096, 2025.
[9] Liu P, Ji Z, Yan G. WPGRec: Wavelet Packet Guided Graph Enhanced Sequential Recommendation. In Proceedings of the International ACM SIGIR Conference on Research and Development in Information Retrieval. 2026: 3964–3969.
Response to Reviewer Cp6b - Q1 (1/2) Main innovations relative to TimeMixer
Sequential recommendation requires distinguishing interest components with different patterns of variation and integrating complementary information from different historical ranges. TimeMixer decomposes multiscale sequences into seasonal and trend components and mixes them in opposite directions. Inspired by this design, we introduce a decomposition-based multiscale mixing framework into sequential recommendation. Specifically, MiRec introduces two key innovations: causal multiscale modeling for position-wise prediction and Sinkhorn-based cross-scale feature subspace exchange. These address causal adaptation and subspace interaction in multiscale mixing, respectively, jointly supporting the integration of information from different historical ranges. We further introduce a TimeMixer-SR baseline to evaluate the overall design in terms of recommendation performance, active parameter count, and per-epoch training time.
First, regarding causal modeling, sequential recommendation requires each position to predict the next item using only its visible history. The original TimeMixer models fully observed historical blocks, and its centered smoothing and temporal-axis mixing without prefix constraints do not directly satisfy this requirement. Therefore, replacing only the input embeddings and prediction head is insufficient for task adaptation. MiRec employs aligned causal windows and prefix smoothing to integrate information from different historical ranges while preserving causality at each position.
Second, regarding subspace interaction, different subspaces of recommendation representations can capture different aspects of latent information, whereas temporal-axis mixing does not explicitly model cross-scale correspondences between these subspaces. To address this limitation, MiRec introduces Sinkhorn-based feature subspace exchange to learn feature reorganization between components of the same type across adjacent scales. An approximate doubly stochastic constraint balances information allocation from source subspaces to target subspaces, thereby incorporating subspace-level interaction into multiscale mixing.
To validate these designs, we construct TimeMixer-SR, a recommendation adaptation that preserves TimeMixer’s core decomposition and mixing mechanisms while incorporating item embeddings and the next-item prediction task. We compare the two methods in terms of recommendation performance and computational cost. As shown in the table below, compared with TimeMixer-SR, MiRec achieves relative improvements of 10.41% and 15.56% in HR@10 and NDCG@10 on Beauty, respectively, and 3.78% and 5.94% on ML-1M. Meanwhile, with similar active parameter counts, MiRec reduces per-epoch training time by 58.77% and 89.88% on the two datasets, respectively. These results support the effectiveness of MiRec’s overall design and demonstrate its advantages in both recommendation performance and per-epoch training efficiency.