training-free

Tag

Cards List
#training-free

Reason, Then Re-reason: Cross-view Revisiting Improves Spatial Reasoning

Hugging Face Daily Papers · 2026-06-10 Cached

A training-free framework for spatial reasoning from egocentric videos that enables revisiting conclusions through synthesized novel-view videos generated from predicted 3D geometry.

0 favorites 0 likes
#training-free

DyCon: Dynamic Reasoning Control via Evolving Difficulty Modeling

arXiv cs.AI · 2026-06-08 Cached

This paper introduces DyCon, a training-free framework that uses step-level embeddings to model evolving task difficulty and dynamically control reasoning depth in Large Reasoning Models, effectively reducing overthinking and improving efficiency without sacrificing accuracy.

0 favorites 0 likes
#training-free

Phase Marginalization for Patch-Grid Instability in Vision Transformers

Hugging Face Daily Papers · 2026-06-06 Cached

Phase Marginalization is a post-hoc method that addresses phase-dependent instability in Vision Transformers by evaluating structured patch-grid phases and aggregating outputs. It improves segmentation, depth, and local matching over the canonical baseline with minimal extra cost.

0 favorites 0 likes
#training-free

ECI_{sem}: Semantic Residual Effective Contrastive Information for Evaluating Hard Negatives

Hugging Face Daily Papers · 2026-06-05 Cached

ECI_sem is a training-free method for ranking hard negative sources in dense retrieval using frozen embeddings, achieving strong performance on MS MARCO and BEIR benchmarks.

0 favorites 0 likes
#training-free

Training-Free Lexical-Dense Fusion for Conversational-Memory Retrieval

arXiv cs.LG · 2026-06-04 Cached

This paper proposes a training-free, CPU-only retrieval method that fuses BM25 lexical scores with late-interaction dense scores for conversational memory retrieval, achieving up to +17.2 points improvement on LoCoMo Hit@1 over late interaction alone across six encoders. The study provides controlled ablations on pooling operators, reranker effects, and benchmark robustness, framing the gain as a division of labor between dense and lexical signals.

0 favorites 0 likes
#training-free

Dynamic Infilling Anchors for Format-Constrained Generation in Diffusion Large Language Models

arXiv cs.CL · 2026-06-04 Cached

This paper proposes Dynamic Infilling Anchors (DIA), a training-free method for diffusion large language models that dynamically estimates end-anchor positions to enforce format constraints (e.g., parseable JSON, reasoning templates) while avoiding the rigidity of fixed-span approaches. Experiments show significant zero-shot gains on GSM8K and MATH benchmarks.

0 favorites 0 likes
#training-free

Supportive Token Revealing for Fast Diffusion Language Model Decoding

arXiv cs.CL · 2026-06-04 Cached

This paper proposes AXON, a training-free module that improves the quality-latency trade-off of discrete diffusion language model decoding by intelligently selecting 'anchor' tokens to reveal first, using attention, uncertainty, and confidence signals to support subsequent denoising steps. Experiments on reasoning and code-generation benchmarks show AXON reduces function evaluations while maintaining or improving accuracy.

0 favorites 0 likes
#training-free

RhymeFlow: Training-Free Acceleration for Video Generation with Asynchronous Denoising Flow Scheduling

Hugging Face Daily Papers · 2026-06-04 Cached

RhymeFlow accelerates diffusion transformers for video generation by decoupling denoising trajectories across frames, using keyframe anchoring and latent trajectory projection to reduce computational overhead while maintaining visual quality.

0 favorites 0 likes
#training-free

Physics in 2-Steps: Locking Motion Priors Before Visual Refinement Erases Them

Hugging Face Daily Papers · 2026-06-04 Cached

PhaseLock is a training-free framework that preserves motion priors from early-step inference to improve physical consistency in image-to-video diffusion models, achieving 6.2 point improvement with minimal overhead.

0 favorites 0 likes
#training-free

Fast-dLLM++: Fr\'{e}chet Profile Decoding for Faster Diffusion LLM Inference

arXiv cs.CL · 2026-06-03 Cached

Fast-dLLM++ introduces Fréchet profile decoding for diffusion LLMs, a training-free method that selects parallel commit sets based on heterogeneous confidence profiles, achieving up to 37% higher throughput at comparable accuracy on benchmarks with LLaDA-8B.

0 favorites 0 likes
#training-free

WaveFilter: Enhancing the Long-Context Capability of Diffusion LLMs via Wavelet-Guided KV Cache Filtering

arXiv cs.CL · 2026-06-02 Cached

WaveFilter proposes a training-free, wavelet-guided KV cache filtering framework for diffusion large language models that enhances long-context capability by precisely identifying key tokens and constructing sparse caches, improving performance on complex long-context tasks.

0 favorites 0 likes
#training-free

Generating and Refining Dynamic Evaluation Rubrics for LLM-as-a-Judge

arXiv cs.CL · 2026-06-01 Cached

This paper proposes a training-free method to automatically generate fine-grained evaluation rubrics for LLM-as-a-judge without human annotation, and further introduces an iterative fine-tuning strategy for a rubric generator that outperforms larger proprietary models.

0 favorites 0 likes
#training-free

PlatonicNav: Unveiling Semantic Correspondence in Navigation with Platonic Topological Maps

Hugging Face Daily Papers · 2026-06-01 Cached

PlatonicNav introduces a training-free framework for embodied navigation that uses vision-only semantic maps and blind matching to ground language goals, achieving generalization across tasks and embodiments without explicit cross-modal training.

0 favorites 0 likes
#training-free

Off-the-Shelf LLMs as Process Scorers: Training-Free Alternative to PRMs for Mathematical Reasoning

Hugging Face Daily Papers · 2026-06-01 Cached

Proposes Chunk-Level Guided Generation, a training-free method using off-the-shelf LLMs as process scorers to select fixed-length candidate chunks during small model generation, significantly improving mathematical reasoning accuracy over majority voting and PRM guided search.

0 favorites 0 likes
#training-free

SkillAdaptor: Self-Adapting Skills for LLM Agents from Trajectories

Hugging Face Daily Papers · 2026-05-31 Cached

SkillAdaptor is a training-free step-level skill adaptation framework with explicit failure attribution for LLM agents, improving performance on WebShop, PinchBench, and Claw-Eval.

0 favorites 0 likes
#training-free

SERC: LDPC-Inspired Semantic Error Correction for Retrieval-Augmented Generation

arXiv cs.CL · 2026-05-29 Cached

Proposes SERC, a training-free method inspired by LDPC codes to correct hallucinations in LLMs by treating generation as a noisy channel and using sparse verification queries against external evidence.

0 favorites 0 likes
#training-free

LVSA: Training-Free Sparse Attention for Long Video Diffusion

Hugging Face Daily Papers · 2026-05-29 Cached

LVSA introduces a training-free sparse attention mechanism for video diffusion models, reducing compute up to 3.17x while enabling generation beyond training horizons without quality loss.

0 favorites 0 likes
#training-free

Light Interaction: Training-Free Inference Acceleration for Interactive Video World Models

Hugging Face Daily Papers · 2026-05-29 Cached

Light Interaction introduces a training-free inference acceleration framework for interactive video world models, using adaptive context management, denoising cache acceleration, and 3D block sparse attention to achieve up to 2.59x speedup while maintaining competitive visual quality.

0 favorites 0 likes
#training-free

One Click per Cell Type Suffices: Training-free Group Interaction for Cell Instance Segmentation

Hugging Face Daily Papers · 2026-05-28 Cached

Group Prompting introduces a training-free framework for cell instance segmentation that requires only one click per cell type, using the Segment Anything Model's feature space to recursively expand prompts, achieving competitive performance without training.

0 favorites 0 likes
#training-free

EarlyTom: Early Token Compression Completes Fast Video Understanding

Hugging Face Daily Papers · 2026-05-28 Cached

EarlyTom is a training-free framework that compresses visual tokens early in the vision encoder to reduce time-to-first-token and computational costs while maintaining accuracy, achieving up to 2.65x TTFT reduction.

0 favorites 0 likes
← Previous
Next →
← Back to home

Submit Feedback