跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1003新增论文
+795其中 AI 相关
+108已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-21 12:19 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-20 12:50 — 2026-11-21 12:50(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-21 12:19最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 4 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
版本更新 · v2arXiv:2607.24402

CogRec: Structure-Cognitive Fast-and-Slow Reasoning for Generative Recommendation

Xiang Liu, Jingsong Su, Shuqi Zhao, Pengbo Mo, Yiming Qiu, Huimu Wang, Mingming Li, Jiao Dai 等 10 位作者

原文摘要

Generative recommendation reformulates next-item prediction as identifier sequence generation, yet existing methods mainly treat the generated identifiers as target sequences to be memorized, leaving their hierarchical and relational structure underused for explicit reasoning. We propose CogRec, a structure-cognitive fast-and-slow reasoning framework that grounds intermediate reasoning in the same SID topology used for target generation. CogRec augments the vertical SID hierarchy with intra-layer semantic graphs and introduces SID Routing to represent recommendation reasoning through layer-wise Match, LateralJump, and Explore operations. These operations provide a structural interpretation of fast localization and slow navigation. A supervised multi-stage pipeline aligns newly introduced SID tokens, establishes direct generation, and trains natural-language and SID Routing branches from a shared checkpoint. Experiments on three Amazon Reviews 2014 categories show dataset-dependent effects of SID Routing. Routing improves Hit@10 and NDCG@10 over its direct-generation counterpart on Beauty and Sports, while reducing both metrics on Toys. These results characterize the benefits and dataset-dependent behavior of SID-grounded intermediate reasoning for generative recommendation. Code is available at https://github.com/caskcsg/CogRec.

cs.IR

版本更新 · v4arXiv:2609.36413

One from Infinity: Actualizing Futures from Pretrained World Models into Robot Actions

Bang Du, Yichen Xie, Shuqi Zhao, Yuxin Chen, Menglin Wu, Masayoshi Tomizuka

原文摘要

A pretrained video world model admits many plausible futures for a scene, but a robot must realize the exact task-conditioned one. To turn world models into executable robot policies, existing methods fine-tune the heavy world model backbone using large-scale robot data and computational resources. Challenging this status quo, we argue that the expensive part has already been paid in the world model pretraining since the representation space of a video world model encoder lays out the diverse potential futures. In this case, what remains is to determine the future that accomplishes the task and to read out the actions that realize it. We formalize this task as actualization, which learns a task-conditioned realization on top of a prior supplied by a frozen world model encoder. This can be solved by a tiny actualizer model. We implement RoboActualizer with as few as 60M parameters on top of a frozen world model encoder. The actualizer is composed of two lightweight DiT experts that jointly predict future latents and actions by flow matching. The model can be trained entirely on a single GPU with 32 GB peak memory. With up to 100x fewer trainable parameters than existing WAMs and VLAs, RoboActualizer reaches great performance on simulation benchmarks including LIBERO, LIBERO-Plus, RoboTwin 2.0 and five tasks on two real-world platforms, with a low latency of 39 ms that allows real-time control.

cs.RO

新论文 · v1arXiv:2610.40289

通过容忍度感知推荐与自适应多样化逆转极化

Reversing Polarization through Tolerance-Aware Recommendation and Adaptive Diversification

Zhanzhan Zhao, Shuqi Zhao, Zichen Fan, Dana Randall

AI 速读 基于摘要

该研究基于意见动力学模型与LLM智能体模拟,探讨容忍度感知推荐结合自适应多样化能否在已极化人群中逆转而非仅减缓极化。

cs.SI

查看原文摘要

Recommender systems face a tension between broadening exposure to diverse viewpoints and avoiding interactions that reinforce extreme positions. This tension is especially consequential in already polarized populations. Here we investigate whether recommendation strategies can reverse polarization rather than merely slow its development. Building on the Attraction--Repulsion Model of opinion dynamics, we introduce two complementary design principles: Tolerance-aware recommendation, which seeks to learn each individual's tolerance for disagreement and reduces exposure to viewpoints beyond that tolerance, and adaptive diversification, which broadens exposure for agents with more extreme opinions while retaining stronger personalization for moderates. Agent-based experiments show that highly personalized recommendations intensify polarization under polarized initial conditions. Tolerance awareness alone primarily slows polarization, whereas combining it with adaptive diversification can reduce polarization below its initial level and, under suitable conditions, restore consensus. Additional experiments incorporating persistent extreme influencers and a spiral-of-silence mechanism show that the combined strategy can mitigate polarization under social pressure and selective participation. To examine whether these findings extend beyond predefined opinion-update rules, we repeat the experiments on a simulated social platform populated by 100 LLM-driven agents prompted to move toward opinions similar to their own and away from those that differ substantially. Across three runs, the combined strategy is again the only recommendation policy tested that reverses polarization in every run. These findings distinguish polarization prevention from reversal and identify tolerance-aware, adaptive exposure as a promising recommendation design principle for reconnecting divided populations.

新论文 · v1arXiv:2610.40259

The Price of a Chance in Artificial Societies

Shuqi Zhao, Boyu Wang, Shuangyue Niu, Chenhao Zhang, Zhanzhan Zhao

原文摘要

Rapid advances in large language models (LLMs) have enabled autonomous agents to interact, coordinate, and pursue individual goals in artificial societies. However, our understanding of how reward structures shape their competitive behavior and collective outcomes remains incomplete. We simulate 200 LLM agents competing over 50 rounds to maximize individual wealth. We define overcompetition and lying flat as population investment above and below a Bayesian adaptive baseline, respectively. At the lowest tested reward, populations lie flat; at the two highest, they overcompete, most strongly at intermediate winner coverage. The investment committed to pursuing an uncertain reward constitutes the price of a chance. Agents near the qualification cutoff can invest heavily yet receive no prize, finishing poorer than nonwinners who invest less. Agents' stated rationales link investment decisions to perceived qualification prospects and expected returns. At the collective level, greater investment does not consistently improve ability selection. With a fixed total prize budget, offering smaller prizes to more winners can reduce investment while preserving selection quality relative to the corresponding top-ability target. Further broadening reward coverage yields additional savings but reduces selection quality. These findings show how reward design shapes overcompetition and lying flat, distributes the costs of pursuing opportunity, and influences what competition collectively achieves.

cs.CY