跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

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

全站更新概况

+5018新增论文
+4131其中 AI 相关
+108已有论文修订
+122新增 AI 导读

arXiv 最近完成扫描:2026-11-05 01:50 · 全站最近入库:2026-11-05 02:48各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-05 01:50最近发现新增版本:2026-11-05 02:48库内论文最新更新时间:2026-11-04 08:00

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

13,695 已收录论文11,806 AI 相关3,088 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-05 01:47(北京时间)
首次观测 · 记录 #1CVF · CVPR 2026:cvf:43a417dac90bb9e78e02694a4173acccCVF · CVPR 2026

RebRL: Reinforcing Discrete Visual Diffusion Models with Rebalanced Timestep Credits

Zhang, Mu, Ma, Tianren, Liu, Yunfan, Hu, Kun, Ye, Qixiang

Discrete Diffusion Models (DDMs) have shown great potential in image generation, especially when equipped with reinforcement learning (RL) techniques.However, a fundamental yet overlooked limitation is revealed in our experiments: severe imbalance of credit assignment across timesteps during training. As a result, early generation timesteps, which carry higher exploration potential and determine the global structure, provide a smaller contribution to policy optimization.To conquer this, we propose a simple-yet-effective approach, to Re-balance timestep credit of Reinforcement Learning (RebRL) for better exploration-exploitation trade-off and more efficient training of DDMs.RebRL is plug-and-play\textemdash simply replacing uniform temporal policy with strategic rebalancing along masking stages. RebRL is analytically plausible\textemdashderivation and analysis show that it enjoys a uniform token-level policy gradient, which benefits policy optimization.Experiments on text-to-image generation benchmarks show that RebRL achieves state-of-the-art performance on GenEval and improves human preference score by up to 3.40 while effectively reducing training steps by ~40\%.

尚无 AI 解读,展示原文摘要

cs.CV

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition · 2026 · 正式发表

CVF · CVPR 2026 ↗PDF ↗
首次观测 · 记录 #1CVF · CVPR 2026:cvf:6908305af85ae6cac1e90fc8e3b06cc1CVF · CVPR 2026

AceTone: Bridging Words and Colors for Conditional Image Grading

Ma, Tianren, Liao, Mingxiang, Zhang, Xijin, Ye, Qixiang

Color affects how we interpret image style and emotion. Previous color grading methods rely on patch-wise recoloring or fixed filter banks, struggling to generalize across creative intents or align with human aesthetic preferences. In this study, we propose **AceTone**, the first approach that supports multimodal conditioned color grading within a unified framework. AceTone formulates grading as a generative color transformation task, where a model directly produces 3D-LUTs conditioned on text prompts or reference images. We develop a VQ-VAE-based tokenizer which compresses a 3x32^3 LUT vector to 64 discrete tokens with \Delta \text E <2 fidelity. We further build a large-scale dataset, AceTone-800K, and train a vision-language model to predict LUT tokens, followed by reinforcement learning to align outputs with perceptual fidelity and aesthetics. Experiments show that AceTone achieves state-of-the-art performance on both text-guided and reference-guided grading tasks, improving LPIPS by up to **50%** over existing methods. Human evaluations confirm that AceTone's results are visually pleasing and stylistically coherent, demonstrating a new pathway toward language-driven, aesthetic-aligned color grading. Project Page: github.com/martian422/AceTone.

尚无 AI 解读,展示原文摘要

cs.CV · cs.CL

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition · 2026 · 正式发表

CVF · CVPR 2026 ↗PDF ↗