跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-07 08:04(北京时间)
版本更新 · v4arXiv:2608.19540

Continuous Adversarial MeanFlow for Few-Step Generative Adaptation from Any Parameterization

Yara Bahram, Zahra Dehghani, Mélodie Desbos, Eric Granger, Pablo Piantanida, Mohammadhadi Shateri

Training fast generators on new domains with limited data remains challenging for two reasons. First, adapting a pretrained diffusion or flow model leaves its costly multi-step sampling intact, and existing acceleration methods are tied to the source parameterization (x, epsilon, v, or u), so heterogeneous pretrained models share no common acceleration target. Second, while adversarial post-training sharpens generation quality, existing criteria each cover only one end of the step range. Discrete criteria compare jump endpoints and lose their signal as the jump shrinks, while continuous criteria score the instantaneous velocity and misjudge the large jumps of few-step sampling. Neither fits MeanFlow (MF) models, which predict average velocities over intervals of any length. We propose MeanFlow-Transfer (MF-T), which adapts a source domain model of any parameterization and compresses it into a few-step MF generator through a common velocity map. We then introduce Continuous Adversarial MeanFlow (CAMF), which scores the change of a learned potential along each predicted interval jump of MF. CAMF needs no gradient penalty or Jacobian-vector product (JVP). We also prove it stays well-conditioned for every interval length and recovers the instantaneous criterion as the interval vanishes. Adapting four ImageNet-based source models (DiT, SiT, JiT, iMF) to five target domains, MF-T + CAMF approaches or exceeds the fine-tuned many-step teacher in FID and FDD at up to 125x fewer Neural Function Evaluations (NFEs). Further, CAMF improves MF-T's few-step FID by about 30% on average, outperforming prior adversarial post-training on iMF at every NFE.

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

cs.LG · cs.CV
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.05633

Spatio-Temporal Multi-Order Interaction for Video Recognition

Kevin D. Nguetche, Lilian Hollard, Eric Granger, Marco Pedersoli

Many temporal approaches for video recognition rely on explicit cross-channel aggregation projections, which have quadratic complexity in the number of channels, introducing significant computational overhead. In addition, the spatio-temporal representation used for video recognition is biased either toward local order interactions (for CNNs) or toward global order interactions (for transformers). Starting from the multi-order spatial representation of MogaNet, our method introduces two complementary contributions to tackle these problems. First, for the temporal modelling, we introduce parallel multi-order processing with depthwise-only convolutions and implicit gating-based aggregation, which is linear in the number of channels, inducing a considerable computational reduction. Second, we propose a dual interaction between spatial and temporal dimensions, which allows a better spatio-temporal representation without increasing the computational cost. By combining these two contributions, our proposed VideoMogaNet achieves performance on par with or better than state-of-the-art action recognition approaches across multiple video benchmarks (UCF101, HMDB51, Kinetics-400, Diving48), while considerably reducing the cost of the temporal branch.

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

cs.CV · cs.AI · cs.LG
arXiv ↗PDF ↗