Papers by Vipin Chaudhary
Mid-Think: Training-Free Intermediate-Budget Reasoning via Token-Level Triggers (2026.findings-acl)
Copied to clipboard
Van Yang, Shouren Wang, Debargha Ganguly, Xinpeng Li, Chaoda Song, Vikash Singh, Vipin Chaudhary, Xiaotian Han
| Challenge: | Explicit /think> tags are used to expose intermediate reasoning and enable hybrid thinking behaviors. |
| Approach: | They propose a training-free prompting format that combines these triggers to achieve intermediate-budget reasoning, outperforming fixed-token and prompt-based baselines in terms of the accuracy–length trade-off. |
| Outcome: | The proposed method outperforms fixed-token and prompt-based prompts in accuracy–length trade-offs while improving Qwen3-8B on AIME from 69.8% to 72.4% and on GPQA from 58.5% to 61.1%. |
Taylor Unswift: Secured Weight Release for Large Language Models via Taylor Expansion (2024.emnlp-main)
Copied to clipboard
Guanchu Wang, Yu-Neng Chuang, Ruixiang Tang, Shaochen Zhong, Jiayi Yuan, Hongye Jin, Zirui Liu, Vipin Chaudhary, Shuai Xu, James Caverlee, Xia Hu
| Challenge: | Existing mechanisms compromise ownership rights or raise data privacy concerns . existing mechanisms compromise security of released large language models . |
| Approach: | They propose a TaylorMLP to preserve the ownership of large language models by transforming the weights of LLMs into Taylor-series parameters instead of releasing original weights . |
| Outcome: | The proposed model preserves ownership of large language models and prevents their abuse by adjusting the generation speed and causing low-speed token generation. |
CausalRAG: Integrating Causal Graphs into Retrieval-Augmented Generation (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing RAG frameworks face critical limitations due to text chunking and semantic similarity. |
| Approach: | They propose a framework that incorporates causal graphs into the retrieval process. |
| Outcome: | The proposed framework preserves contextual continuity and improves retrieval precision, leading to more accurate and interpretable responses. |
KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches (2024.findings-emnlp)
Copied to clipboard
Jiayi Yuan, Hongyi Liu, Shaochen Zhong, Yu-Neng Chuang, Songchen Li, Guanchu Wang, Duy Le, Hongye Jin, Vipin Chaudhary, Zhaozhuo Xu, Zirui Liu, Xia Hu
| Challenge: | Long context capability is a crucial competency for large language models as it mitigates the human struggle to digest long-form texts. |
| Approach: | They propose to evaluate 10+ state-of-the-art approaches for long context-capable LLMs. |
| Outcome: | The proposed methods are compared against 10+ state-of-the-art approaches across seven categories of long context tasks. |
Ranking Reasoning LLMs under Test-Time Scaling (2026.acl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) are increasingly used as general-purpose reasoning systems for tasks such as programming and mathematical problem solving. |
| Approach: | They formalize dense benchmark ranking under test-time scaling and introduce a library that implements statistical ranking methods such as paired-comparison models, item response theory, voting rules, graph- and spectral-based methods. |
| Outcome: | The proposed method is based on paired-comparison models, item response theory (IRT) models, voting rules, graph- and spectral-based methods. |
Quantize What Counts: More for Keys, Less for Values (2026.findings-acl)
Copied to clipboard
| Challenge: | Empirical evaluations across various prominent LLMs and benchmarks show that key-favored allocations retain up to 98.3% accuracy compared to uniform allocations (e.g., 4-bit keys, 2-bit values). |
| Approach: | They propose two theorems that anchor mixed-precision KV quantization in the intrinsic geometry of Transformer models. |
| Outcome: | Empirical evaluations show that key-favored allocations retain up to 98.3% accuracy while conserving memory. |
100-LongBench: Are de facto Long-Context Benchmarks Literally Evaluating Long-Context Ability? (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing benchmarks for long-context capability are too synthetic and do not represent the real world usage of LLMs. |
| Approach: | They propose a length-controllable, real-life reflective benchmark that disentangles baseline knowledge from long-context capabilities. |
| Outcome: | Experiments show that the proposed benchmarks disentangle baseline knowledge from long-context capabilities. |
LoRATK: LoRA Once, Backdoor Everywhere in the Share-and-Play Ecosystem (2025.findings-emnlp)
Copied to clipboard
Hongyi Liu, Shaochen Zhong, Xintong Sun, Minghao Tian, Mohsen Hariri, Zirui Liu, Ruixiang Tang, Zhimeng Jiang, Jiayi Yuan, Yu-Neng Chuang, Li Li, Soo-Hyun Choi, Rui Chen, Vipin Chaudhary, Xia Hu
| Challenge: | distributing LLMs without a proven track record like ‘meta-llama‘ or ‘qwen‘ rarely gains community traction. |
| Approach: | They propose a simple, efficient, yet specific recipe for a backdoor LoRA to be injected into task-enhancing LoRAs and examine the mechanisms of such infections. |
| Outcome: | The proposed model allows attackers to scale the distribution of compromised LoRAs with minimal effort by leveraging the rich pool of shared LoRA assets. |
AutoL2S: Auto Long-Short Reasoning for Efficient Large Language Models (2026.findings-acl)
Copied to clipboard
Feng Luo, Yu-Neng Chuang, Guanchu Wang, Hoang Anh Duy Le, Shaochen Zhong, Hongyi Liu, Jiayi Yuan, Yang Sui, Vladimir Braverman, Vipin Chaudhary, Xia Hu
| Challenge: | Existing approaches to distilling large language models (LLMs) are inefficient and generate excessively long chain-of-thought reasoning even for inputs that admit concise solutions. |
| Approach: | They propose a distillation framework that empowers non-reasoning LLMs to think only when necessary. |
| Outcome: | The proposed framework reduces reasoning length up to 71% with minimal accuracy loss while preserving accuracy. |