跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1680新增论文
+1333其中 AI 相关
+187已有论文修订
+59新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

25,786 已收录论文21,491 AI 相关7,725 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
版本更新 · v2arXiv:2608.00111

FDIR: Fidelity-Anchored Decompressed Image Restoration for Human and Machine Perception

Kuan-Yen Chen, Chung-Yao Ma, Fang-Yi Su, Philip Chikontwe, Jonathan Guo, Pu-Jen Cheng, Jung-Hsien Chiang

原文摘要

Evaluating restored images requires considering pixel fidelity, human perception, and machine preference. However, existing compressed image restoration methods rarely satisfy all three criteria at once. Regression models preserve pixel fidelity but often produce overly smooth results. Conversely, generative models create realistic textures but tend to drift from the ground truth. To address this trade-off, we propose FDIR (Fidelity-Anchored Decompressed Image Restoration), a framework that uses generative priors while preserving strong pixel fidelity. FDIR works in two stages. First, a quality-guided one-step flow model (QO-Flow) adapts a pretrained latent flow backbone with LoRA to generate a structural prior in a single forward pass. Second, rather than outputting this generated image directly, a flow-conditioned detail refinement network (FCDR) uses it to predict a pixel-space residual on the decompressed input. This design brings in perceptual details while keeping the final output faithful to the original image. We evaluate FDIR on LIVE1 and DIV2K under severe compression at quality factors 1 and 5. Across all four settings, FDIR achieves the highest PSNR among the seven compared methods and beats the strongest perceptual baseline, CODiff, by 1.3 to 2.1 dB. It also ranks second on LPIPS in all four settings and on FID and DISTS on DIV2K-Val, right behind CODiff. For downstream detection, segmentation, and retrieval at quality factors 20 and 30, FDIR ranks second on every individual metric and achieves the best average rank across all ten metrics. Overall, FDIR is the only method to maintain a top-two average rank across fidelity, perception, and machine preference.

eess.IV · cs.CV · cs.LG

新论文 · v1arXiv:2611.19320

Keep it Simple! A Multiple-Choice Task can Benefit Generative Recommendation

Wei-Hsiang Huang, Jyun-Yu Jiang, Pu-Jen Cheng

原文摘要

Sequential recommendation has recently witnessed growing interest in generative retrieval. One of the most popular approaches is to autoregressively generate the semantic identifiers (SIDs) of items as recommendations. Existing efforts mainly rely on semantic alignment, sophisticated architectural designs, and extensive hyperparameter tuning. However, the conventional learning framework for generative models could have foundational limitations. Specifically, most generative models directly predict target items without explicitly learning negative compositions and relative ranking signals. This is not well aligned with the philosophy of Bayesian personalized ranking (BPR), which emphasizes the importance of relative rankings between positive and negative samples. In this paper, we show that adding a simple multiple-choice auxiliary task into the learning objective can effectively address this issue. With minimal adaptation, we introduce Task Identifiers and Candidate Constructions to synthesize training data for the multiple-choice auxiliary task. In addition, we provide theoretical analysis of the fundamental benefits of the multiple-choice auxiliary task from the perspectives of information theory and compositional generalization. Extensive experiments on four publicly available benchmark datasets show that our approach can improve TIGER, a conventional generative recommendation model, by 4.9% to 79% in NDCG@10.

cs.IR