training-free

Tag

Cards List
#training-free

[Paper] RidgeFill: Training-Free Late-Layer Cache Fill for Faster Prefill

Reddit r/LocalLLaMA ↗ · 2026-11-02

RidgeFill 通过用闭式解岭回归预测深层输入、跳过大部分上层计算来加速 LLM prefill,在 Qwen3.8 系列上实现最高 1.6x 的 TTFT 提速,且几乎不损失检索精度。

0 favorites 0 likes
#training-free

In-Model Context Compression with Agentic Soft Tokens for Long-Horizon LLM Agents

arXiv cs.CL ↗ · 2026-11-02 Cached

The paper introduces Agentic Soft-Token Compression (ASTC), a training-free method that uses an LLM's native recurrent dynamics (GDN-attention) to compress long-horizon agent context into soft tokens, matching or exceeding uncompressed accuracy with up to 50.68% fewer Attention Pairs.

0 favorites 0 likes
#training-free

SEDATE: Do Large Language Models Share an Aggression Circuit Across Languages?

arXiv cs.CL ↗ · 2026-10-27 Cached

该论文提出 SEDATE(选择性检测与定向编辑),一种基于检测-编辑-验证策略的免训练方法,通过定位跨语言共享的“攻击性”神经元来提升大模型的安全性,并在7种语言和4个模型家族上验证了其优于基线的效果。

0 favorites 0 likes
#training-free

GS-MoE: Training-Free MoE Compression via Groupwise Subspace Sharing and Pruning

arXiv cs.LG ↗ · 2026-10-27 Cached

GS-MoE 介绍了一种免训练的 MoE 压缩框架,通过分组子空间共享(低秩)与基于 Nyström 的神经元剪枝两条压缩轴同时削减专家参数;在 DeepSeek-MoE-16B-Base 上以 60% 参数压缩保留约 90% 的推理性能,优于 D2-MoE 的 73%。

0 favorites 0 likes
#training-free

Not All Information Is Worth Asking For: Decision-Informed Information Seeking with LLMs

arXiv cs.AI ↗ · 2026-10-26

论文提出了一种名为 DIVA(Decision-Informed Value-of-information Acquisition)的训练无关方法,使 LLM 基于证据的决策价值来决定何时检索信息以及何时停止,从而避免为不改变决策的证据付费,并在四个领域、20 个 LLM 上将最佳基线的遗憾值降低 75%。

0 favorites 0 likes
#training-free

Thinking-in-Bets at Test Time Reduces Sycophantic Revisions in LLM Agents

Hugging Face Daily Papers ↗ · 2026-10-26 Cached

论文提出 Thinking-in-Bets,一种无需训练的方法,让 LLM 代理在读取用户反馈前先记录已验证的主张与置信度,从而在被挑战时减少错误反转和不必要的修改,同时保持准确性。

0 favorites 0 likes
#training-free

GRAFT: Restoring the Missing Sampling Interface in Continuous Diffusion Language Models

arXiv cs.CL ↗ · 2026-10-22 Cached

论文揭示连续扩散语言模型(如ELF)因生成过程缺少逐步离散采样步骤而导致长尾词汇严重缺失(稀有词生成率仅为人类文本的0.30×),并提出训练无关的GRAFT方法,通过在模型未确定时提交稀有词再重新生成序列,将稀有词比例恢复至人类水平的0.82–1.10×。

0 favorites 0 likes
#training-free

Omni-Woodpecker: Hallucination Correction via Evidence-Prior Rebalancing for Omni LLMs

arXiv cs.AI ↗ · 2026-10-21 Cached

Omni-Woodpecker提出一种免训练框架,通过证据-先验重平衡来纠正Omni多模态大模型中的跨模态幻觉,在CMM和AVHBench等基准上显著提升性能。

0 favorites 0 likes
#training-free

Sparsity Should Be ALLOTted by Output: Training-Free Allocation of Block-Sparse Attention for Video Diffusion Transformers

Hugging Face Daily Papers ↗ · 2026-10-21 Cached

提出 ALLOT:一种训练自由的块稀疏注意力分配方法,通过细胞探测与轨迹校准在延迟预算内优化视频扩散 Transformer 各层-步的稀疏度,在 HunyuanVideo 上实现 11.8 dB PSNR 提升。

0 favorites 0 likes
#training-free

HumanSkill-4D: Training-Free Language Querying of Animatable Gaussian Avatars in Space and Time

Hugging Face Daily Papers ↗ · 2026-10-17 Cached

HumanSkill-4D 提出一个免训练框架,通过共享多模态大语言模型与几何算子,实现对可动画高斯人体头像在空间与时间上的语言查询,支持部件分割与 3D/4D 指代分割,并引入三个标注基准以超越现有基线。

0 favorites 0 likes
#training-free

Prune the Summary, Not the History: Source-Judged Compaction for Long-Horizon Agents

arXiv cs.CL ↗ · 2026-10-16 Cached

提出 Source-Judged Compaction (SJC),一种免训练的后处理方法,通过可校准的判断模型 Jev 为压缩摘要中的每条目评分是否能在环境输出中找到依据,并移除无来源条目,从而提升长时程 LLM 智能体的跨运行可靠性 2.1%–8.9%。

0 favorites 0 likes
#training-free

CoTS: Competitive Token Selection for Latent Reasoning in Large Language Models

arXiv cs.CL ↗ · 2026-10-16 Cached

提出 CoTS(Competitive Token Selection)训练免调框架,在推理过程中利用 top-2 候选 token 的概率竞争来连续调节离散 token 提交与软表示探索之间的平衡,从而在六个推理基准上超越标准 CoT 和现有训练免调隐式推理方法。

0 favorites 0 likes
#training-free

FlowBudget: Training-Free Sampling-Budget Estimation for Flow Matching Models

arXiv cs.LG ↗ · 2026-10-16 Cached

FlowBudget 提出一种免训练的采样预算估计方法,通过仿真自由的插值探针估计求解器相对的采样复杂度,从而在不进行 FID-vs-NFE 扫描的情况下确定流匹配模型所需的函数求值次数(NFE)。

0 favorites 0 likes
#training-free

REWIND: Uncertainty-Guided Trajectory Repair for Test-Time Reasoning

arXiv cs.CL ↗ · 2026-10-15 Cached

论文提出 REWIND,一种基于 token 熵动态的训练-free 控制器,用于在测试时对 LLM 推理轨迹进行定点后缀重新生成修复,在三个模型系列和五个基准上超越所有基线。

0 favorites 0 likes
#training-free

Resisting Harmful Instructions through Training-Free Weight Editing

Hugging Face Daily Papers ↗ · 2026-10-15 Cached

该论文提出一种训练无关的权重编辑方法,通过少量对比提示对直接修改模型权重,降低指令微调模型对有害指令(如说谎、性别歧视)的服从率,并在五个模型上验证了其优于激活引导等方法的鲁棒性。

0 favorites 0 likes
#training-free

Share the Symbol, Not the Vector: Training-Free Fact Communication Across Language Models

Hugging Face Daily Papers ↗ · 2026-10-14 Cached

The paper introduces SYNC (Symbol-Indexed Neural Communication), a training-free, word-indexed interface that lets heterogeneous language models share selective object facts via word indices and receiver-local hidden-state directions, achieving strong four-answer success across nine receivers from five model families.

0 favorites 0 likes
#training-free

Rethinking Projector Training in Multimodal LLMs

Hugging Face Daily Papers ↗ · 2026-10-13 Cached

该论文提出 PORTAL,一种无需配对图像-文本数据、基于最优传输的多模态投影器初始化方法,可以完全跳过投影器训练阶段,在六个 LLM 主干和 16 个基准上匹敌使用 558k 图文对的标准训练流程。

0 favorites 0 likes
#training-free

DoubtLess: Training-Free Contrastive Decoding for Efficient Reasoning

Hugging Face Daily Papers ↗ · 2026-10-13 Cached

DoubtLess 提出一种免训练的对比解码方法,用一个更小的推理模型引导大模型输出更简洁的思维链,在七个竞赛数学、研究生科学与编程基准上将 Qwen3-32B 的 CoT 缩短 31% 且准确率不变,优于五个推理时基线。

0 favorites 0 likes
#training-free

CacheScope: Exact-Compute Allocation for Training-Free Diffusion Acceleration

arXiv cs.LG ↗ · 2026-10-12 Cached

CacheScope 提出一种训练无关的扩散模型推理加速方法,通过归一化浅层探测变化信号在线识别高风险缓存步骤并回退到精确计算,在 FLUX.1-dev、Wan2.1 和 Open-Sora 上实现最高 3.57 倍加速及 LPIPS 中位数降低 70.1%。

0 favorites 0 likes
#training-free

AReA: Adaptive Receptive-Field Attention for Efficient High-Resolution Diffusion Transformers

Hugging Face Daily Papers ↗ · 2026-10-12 Cached

提出AReA:一种训练自由的注意力机制,其感受野随去噪过程从粗到细自适应演化,用于实现高效高分辨率Diffusion Transformer图像生成,在多个分辨率和模型上超越现有无训练基线且更快速。

0 favorites 0 likes
Next →
← Back to home

Submit Feedback