MCTA4R: Enhancing User Preference Alignment with Meta-CoT and Search Algorithms

Personalized recommendation systems often struggle with accurately predicting long-term user preferences, particularly in dynamic and sparse environments. Aligning user preferences is a key issue in LLM-driven recommendation systems with generative agents. To address this, we propose the Meta-CoT-Agent4Rec (MCTA4R) framework, which integrates the Meta-CoT reasoning process with <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$A^{*}$</tex> and Monte Carlo Tree Search (MCTS) algorithms. The <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$A^{*}$</tex> search algorithm leverages a heuristic strategy to guide the model towards optimal recommendations by expanding nodes based on cost evaluations, ensuring relevance in structured data environments. Meanwhile, the MCTS utilizes random simulations and backpropagation to explore diverse recommendation paths, adapting to dynamic and sparse data scenarios. The framework was evaluated using the MovieLens-1M, MovieLens-10M, Amazon-Book, and Steam datasets with different interaction ratios. Experimental results demonstrate that both <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{A}^{*}$</tex> Meta-CoT and MCTS Meta-CoT significantly outperform traditional few-shot learning methods in terms of accuracy, recall and F1 score.

Authors

Institutions

Publication Details

Published
2025-06-20
DOI
https://doi.org/10.1109/prmvai65741.2025.11108609
Citations
1
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
3.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

MCTA4R: Enhancing User Preference Alignment with Meta-CoT and Search Algorithms

Rongxia Huang, Wenlong Wu, Bohan Li, Mengfei Xu et al.
1 citations
Recommender Systems and Techniques
3.25
article

MCTA4R: Enhancing User Preference Alignment with Meta-CoT and Search Algorithms

Rongxia Huang, Wenlong Wu, Bohan Li, Mengfei Xu, Qi Zhu, Xinzhe Zhao
article en
1 citations

Abstract

Personalized recommendation systems often struggle with accurately predicting long-term user preferences, particularly in dynamic and sparse environments. Aligning user preferences is a key issue in LLM-driven recommendation systems with generative agents. To address this, we propose the Meta-CoT-Agent4Rec (MCTA4R) framework, which integrates the Meta-CoT reasoning process with <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$A^{*}$</tex> and Monte Carlo Tree Search (MCTS) algorithms. The <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$A^{*}$</tex> search algorithm leverages a heuristic strategy to guide the model towards optimal recommendations by expanding nodes based on cost evaluations, ensuring relevance in structured data environments. Meanwhile, the MCTS utilizes random simulations and backpropagation to explore diverse recommendation paths, adapting to dynamic and sparse data scenarios. The framework was evaluated using the MovieLens-1M, MovieLens-10M, Amazon-Book, and Steam datasets with different interaction ratios. Experimental results demonstrate that both <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{A}^{*}$</tex> Meta-CoT and MCTS Meta-CoT significantly outperform traditional few-shot learning methods in terms of accuracy, recall and F1 score.

Nanjing University of Aeronautics and Astronautics (CN)
Openalex Percentile: Top 7%
Recommender Systems and Techniques
3.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.