Papers with inference-time
MM-BizRAG: Rethinking Multimodal Retrieval-Augmented Generation for General Purpose Enterprise Q&A (2026.acl-industry)
Copied to clipboard
Hanoz Bhathena, Parin Rajesh Jhaveri, Rohan Mittal, Prateek Singh, Aymen Kallala, Rachneet Kaur, Yiqiao Jin, Zhen Zeng, Adwait Ratnaparkhi, Denis Kochedykov
| Challenge: | Recent advances in multimodal retrieval-augmented generation (MM-RAG) have shifted toward minimal parsing, relying on page-level images for producing retriever embeddings and answer generation. |
| Approach: | They propose a document structure-aware split that extracts and represents document structure via a structure-based split that dynamically routes documents through orientation-specific ingestion pipelines. |
| Outcome: | The proposed model outperforms state-of-the-art vision-centric baselines by up to 32% points and achieves strong gains on report-style layouts. |
PKAD: Pretrained Knowledge is All You Need to Detect and Mitigate Textual Backdoor Attacks (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Current defense methods can be classified into inference-time and training-time ones based on their execution phase. |
| Approach: | They propose a two-stage poison detection strategy using pre-trained language models to detect poisoned samples before model training. |
| Outcome: | The proposed method achieves better performance than current methods more quickly and with fewer training costs. |
Prompting Test-Time Scaling Is A Strong LLM Reasoning Data Augmentation (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models exhibit strong reasoning when guided by chain-of-thought exemplars . collecting large, high-quality reasoning datasets remains laborious and resource-intensive . |
| Approach: | They propose a prompt-space data augmentation framework for enhancing LLM reasoning . they use a pool of 90 randomly selected reasoning instances to elicit diverse reasoning trajectories . |
| Outcome: | The proposed framework improves accuracy over small-data benchmarks and generalization on out-of-domain reasoning evaluations. |
Lost in Diffusion: Uncovering Hallucination Patterns and Failure Modes in Diffusion Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | dLLMs have emerged as a promising non-autoregressive paradigm for text generation, but their hallucination mechanisms remain underexplored. |
| Approach: | They present the first controlled comparative study to evaluate hallucination patterns in Diffusion Large Language Models. |
| Outcome: | The proposed model exhibits higher propensity for hallucination than AR counterparts controlled for architecture, scale, and pre-training weights. |
DialUp! Modeling the Language Continuum by Adapting Models to Dialects and Dialects to Models (2025.acl-long)
Copied to clipboard
Niyati Bafna, Emily Chang, Nathaniel Romney Robinson, David R. Mortensen, Kenton Murray, David Yarowsky, Hale Sirin
| Challenge: | Recent advances in MT quality and language coverage have shown that language varieties with low baseline performance are more likely to benefit from these approaches. |
| Approach: | They propose a training-time technique for adapting a pretrained model to dialectal data and an inference-time intervention adapting dialectal datasets to the model expertise. |
| Outcome: | The proposed model shows significant performance gains for several dialects from four language families, and modest gains for two other language families. |
ReflexiCoder: Teaching Large Language Models to Self-Reflect on Generated Code and Self-Correct It via Reinforcement Learning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing iterative refinement strategies that generate solutions in a single forward pass often hit a performance ceiling on complex algorithmic tasks. |
| Approach: | They propose a reinforcement learning framework that internalizes the structured reasoning trajectory directly into the model’s weights. |
| Outcome: | The proposed framework achieves 94.51% (87.20%) on HumanEval, 81.80% (78.57%) on MBPP, 35.00% on BigCodeBench, 52.21% on LiveCodeBech, and 37.34% on CodeForces in a single-attempt setting. |