跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

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

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-09 07:12 · 全站最近入库:2026-11-08 06:02各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-09 07:12最近发现新增版本:2026-11-08 06:02库内论文最新更新时间:2026-11-06 02:59

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

17,100 已收录论文14,661 AI 相关4,057 有修订112 HF 社区发现

浏览论文库

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

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

C^2FG: Control Classifier-Free Guidance via Score Discrepancy Analysis

Gao, Jiayang, Zheng, Tianyi, Zou, Jiayang, Yang, Fengxiang, Liu, Shice, Fan, Luyao, Zhang, Zheyu, Zhang, Hao 等 12 位作者

原文摘要

Classifier-Free Guidance (CFG) is a cornerstone of modern conditional diffusion models, yet its reliance on the fixed or heuristic dynamic guidance weight is predominantly empirical and overlooks the inherent dynamics of the diffusion process. In this paper, we provide a rigorous theoretical analysis of the Classifier-Free Guidance. Specifically, we establish strict upper bounds on the score discrepancy between conditional and unconditional distributions at different timesteps based on the diffusion process.This finding explains the limitations of fixed-weight strategies and establishes a principled foundation for time-dependent guidance. Motivated by this insight, we introduce **Control Classifier-Free Guidance (C^2FG)**, a novel, training-free, and plug-in method that aligns the guidance strength with the diffusion dynamics via an exponential decay control function. Extensive experiments demonstrate that C^2FG is effective and broadly applicable across diverse generative tasks, while also exhibiting orthogonality to existing strategies.

cs.CV

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

首次观测 · 记录 #1CVF · CVPR 2026:cvf:acb91c0aeb24b0724a7e88f8042d17a3CVF · CVPR 2026

SANER: Switchable Adapter with Non-parametric Enhanced Routing for Person De-Reidentification

Liu, Yimin, Pu, Nan, Yang, Fengxiang, Li, Wenjing, Li, Zhihui, Zhong, Zhun

原文摘要

Person De-Reidentification (De-ReID) is an emerging and safety-critical task that aims to selectively forget specific individuals in surveillance systems while preserving the recognition capability for others. Existing methods typically learn both forgetting and retaining objectives within a unified feature space, which leads to conflicting optimization goals and may cause unexpected performance degradation on novel or retained identities. We provide a new perspective to handle De-ReID through feature space decoupling. Although it is a promising solution, discriminating which feature space should be used for the given novel query remain unsolved. To alleviate these challenges, we propose SANER, advancing De-ReID with a Switchable Adapter (SA) and a test-time Non-parametric Enhanced Routing (NER) algorithm. SA decouples the pre-trained feature space into two task-specific subspaces with a forgetting adapter and a retaining adapter. The former suppresses identity-specific semantics for de-identification, while the latter preserves discriminative cues for accurate re-ID. In addition, SA is further enhanced with NER to adaptively analyze optimal feature space routing for the given query at test-time by comparing the query with pre-computed prototypes in the original feature space. Extensive experiments on multiple De-ReID benchmarks demonstrate the effectiveness of SANER, achieving new state-of-the-art De-ReID performance.

cs.CV

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