SearcharxivSearch

arXiv subjects

Danning Wang

Publications and source records attributed to Danning 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

Feedback-arc robustness in random orientations of pseudorandom triangle-free graphs

For an oriented graph $D$, let $\vec{\alpha}(D)$ be the maximum order of an induced acyclic subdigraph, $\vec{\chi}(D)$ its dichromatic number, and $\mathrm{fas}(D)$ the minimum number of arcs whose deletion makes $D$ acyclic. We prove that for every fixed $\zeta \in (0, 1/2)$, there are triangle-free graphs $G_n$ on $n$ vertices such that a uniformly random orientation $D_n$ satisfies, $$ \left( \frac{1}{2} - \zeta \right) e(G_n[U]) < \mathrm{fas}(D_n[U]) \leq \frac{1}{2} e(G_n[U]) $$ with probability at least $1-\exp\!\left[-\Omega_\zeta\!\left(\sqrt n\,(\log n)^{3/2}\right)\right]$ simultaneously for every vertex set $U$ of size at least $C_\zeta\sqrt{n\log n}$. The upper bound is universal, so the feedback-arc ratio can be made arbitrarily close to the largest possible value, uniformly over all sufficiently large induced subdigraphs. In particular, $\vec{\alpha}(D_n) = O(\sqrt{n \log n})$, and every linear-size induced subdigraph has dichromatic number $\Omega(\sqrt{n/\log n})$. This yields $\vec{\alpha}(n) = \Theta(\sqrt{n \log n})$ and $\vec{t}(n) = \Theta\left(\sqrt{\frac{n}{\log n}}\right)$, where $\vec{\alpha}(n)$ and $\vec{t}(n)$ denote, respectively, the minimum of $\vec{\alpha}(D)$ and the maximum of $\vec{\chi}(D)$ over all oriented triangle-free graphs $D$ of order $n$. This confirms two conjectures of Aboulker, Havet, Pirot, and Schabanel.

math.CO