跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+758新增论文
+578其中 AI 相关
+94已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-17 04:58 · 全站最近入库:2026-11-17 04:58各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-17 04:58最近发现新增版本:2026-11-17 04:58库内论文最新更新时间:2026-11-14 02:59

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

24,106 已收录论文20,158 AI 相关7,049 有修订112 HF 社区发现

浏览论文库

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

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
版本更新 · v2arXiv:2608.15247

Improved Metric Distortion Bounds for Deterministic Weighted-Tournament Voting Rules

Jianan Lin, Chenhao Wang

原文摘要

We study deterministic weighted-tournament voting rules, also known as C2 rules, which use only the fraction of voters who prefer one candidate to another for each pair of candidates. Voters and candidates lie in a common but unknown metric space, and voters rank candidates by distance. The goal is to select a candidate minimizing the sum of distances to the voters, and distortion measures the worst-case approximation ratio relative to an optimal candidate. Charikar et al.~[EC 2025] introduced the Unblanketed Set rule with distortion at most $3.9312$ and proved a lower bound of $3.1128$ for deterministic C2 rules. We extend their rule to the Path-Unblanketed Set rule, which runs in polynomial time and achieves distortion at most $1+2\sqrt{2}\approx3.8284$. The rule uses paths between candidates to combine pairwise comparisons without increasing the approximation loss with the path length. With computer assistance, we prove a better upper bound of $3.3346$ for five or six candidates and a general lower bound of $3.1828$ using a construction with 17 candidates.

cs.GT

版本更新 · v3arXiv:2609.29646

顺序 Phragmén 规则保证 2-近似核心稳定性

Sequential Phragmén Guarantees 2-Approximate Core Stability

Jianan Lin, Chenhao Wang

AI 速读 基于摘要

作者证明经典多项式时间投票规则 sequential Phragmén 在认可偏好下总能选出 2-稳定(2-核心)的委员会,并说明该界是紧的。

cs.GT

查看原文摘要

We study approximately stable committee selection under approval preferences, following Cheng et al.~[EC~2019] and Jiang, Munagala, and Wang~[STOC~2020]. In an approval-based committee election, $n$ voters each approve a subset of the candidates, and a committee of size $k$ is selected. A size-$k$ committee is $λ$-stable if, for every nonempty subset $T$ of candidates, the number of voters who strictly prefer $T$ is less than $λ$ times the proportional share $\frac{n|T|}{k}$. We consider sequential Phragmén, a classical polynomial-time voting rule, and prove that it always returns a $2$-stable committee. This implies that the $2$-core is always nonempty and improves upon the $3.651$-stability guarantee of Gao, Sun, and Vondrák~[EC~2026]. The guarantee also extends to weighted voters and is tight even for unweighted elections: for every $1\leλ<2$, sequential Phragmén can return a committee that is not $λ$-stable. Compared with the exact-core algorithm developed in concurrent work by Becker, Greger, and Peters~[arXiv~2026], sequential Phragmén is simpler to implement, and our proof of its $2$-stability is elementary.

版本更新 · v2arXiv:2610.37584

REGER: Modeling inter-item Relations with Semantic IDs for Generative Recommendation

Yuxi Huang, Silin Zhou, Chenhao Wang, Zihan Li, Gangming Guo, Pei Ke, Shen Gao, Shuo Shang

原文摘要

Personalized recommendation depends on learning semantic and collaborative relations among items from online content and user interactions. Generative recommendation (GR) offers a promising paradigm by autoregressively generating discrete semantic IDs (SIDs) of items. However, randomly initialized SID token embeddings and GR models trained from scratch do not directly inherit the semantic relations inherent in items, while inter-item collaborative relations are learned largely implicitly through token-level attention and next-token supervision. To address this limitation, we propose REGER, a unified framework that explicitly incorporates inter-item relations into semantic pretraining, history encoding, and SID generation. We pretrain the GR model through generative semantic retrieval, enabling it to inherit inter-item semantic similarity by learning to generate semantic neighbors' SIDs. We combine global attention with local attention aligned with SID boundaries to capture historical context and directed transitions between adjacent items. We further develop a theoretical framework for hierarchical preference decomposition over the SID prefix tree, proving an exact factorization of collaborative preference distributions and a weighted decomposition of item-level KL divergence into prefix-conditional KL divergences. Building on this analysis, we distill a discriminative teacher's full conditional distributions over all legal next tokens at ground-truth prefixes along the target SID path, jointly optimizing this objective with cross-entropy. Extensive experiments on real-world datasets demonstrate consistent improvements over existing GR baselines and support the effectiveness of the proposed preference distillation.

cs.IR · cs.AI