SearcharxivSearch

arXiv subjects

Xuwen Wang

Publications and source records attributed to Xuwen Wang.

2 recordsLinked to original sources

DREAM Technical Report

Industrial recommender systems commonly use cascaded retrieval, ranking, and re-ranking pipelines. Although efficient, these pipelines fragment information and objectives across modules, rely on rigid rules, and have limited awareness of real-time intent, leaving session-level shifts among browsing, comparison, and purchase insufficiently addressed. We present DREAM (Developing Recommender Engine with Agentic Methods), an autonomous optimization control architecture that adds a perception-aware, orchestrable, and auditable policy layer atop existing pipelines without replacing them. DREAM has two core components. First, a three-tier Intent Engine fuses on-device signals into structured L0/L1/L2 intent representations; its edge-cloud trigger chain reduces reporting volume to approximately 8.7%. Second, a Meta Engine uses a MetaModel for layered M1-to-M2-to-M3 reasoning: intent summarization, strategy planning informed by Strategy Memory, and parameter translation. It dispatches the resulting parameters through a unified outlet with safety guardrails. A Reward Dual Loop continuously optimizes both components by combining offline simulation for strategy-space exploration with online feedback for outcome calibration, forming a cycle of generation, execution, evaluation, and experience accumulation. Large-scale A/B tests on Taobao's homepage feed show that re-ranking control alone improves IPV by 2.06%, Core IPV by 2.39%, and GMV by 0.88%. Extending control to fine ranking raises these gains to 2.71%, 3.06%, and 1.31%, respectively, while consistently improving PV by more than 1%. These gains require neither replacement of pipeline models nor compromise of serving stability, supporting agentic meta-control as a viable paradigm for industrial recommendation.

cs.IR

Effect of correlations on controllability transition in network control

The numerical controllability transition makes the success of control can be achieved by increasing the number of driver nodes to a certain point. Motivated by the fact that the degree correlation has vast role in the dynamics on networks, we study the impact of various degree correlations of different networks on the controllability transition point and find that the transition point depicts local maximum in sparse networks as degree correlation r around 0.1 and 0 in ER and SF networks respectively. With the increasing of average degree, the local maximum disappear and the controllability transition cannot be influenced by degree correlation and degree distribution in dense ER networks. The results are supported by numerical simulations and provide more details to estimate the minimal driver nodes in large networks.

physics.soc-ph