← Search

Hui-Ling Zhen

11 accepted papers

2026

Beyond Speedup - Utilizing KV Cache for Sampling and Reasoning

ICLR 2026poster

KV caches, typically used only to speed up autoregressive decoding, encode contextual information that can be reused for downstream tasks at no extra cost. We propose treating the KV cache as a lightweight representation, eliminating the need to recompute or store full hidden states. Despite being w…

Cited by 0SourceScholar
2026

Efficient Reasoning with Balanced Thinking

ICLR 2026poster

Large Reasoning Models (LRMs) have shown remarkable reasoning capabilities, yet they often suffer from overthinking, expending redundant computational steps on simple problems, or underthinking, failing to explore sufficient reasoning paths despite inherent capabilities. These issues lead to ineffic…

Cited by 0SourcecodeScholar
2026

MOSS: Efficient and Accurate FP8 LLM Training with Microscaling and Automatic Scaling

ICLR 2026poster

Training large language models with FP8 formats offers significant efficiency gains. However, the reduced numerical precision of FP8 poses challenges for stable and accurate training. Current frameworks preserve training performance using mixed-granularity quantization, i.e., applying per-group quan…

Cited by 0SourceScholar
2026

PASER: Post-Training Data Selection for Efficient Pruned Large Language Model Recovery

ICLR 2026poster

Model pruning is an effective approach for compressing large language models (LLMs). However, this process often leads to significant degradation of model capabilities. While post-training techniques such as instruction tuning are commonly employed to recover model performance, existing methods ofte…

Cited by 0SourceScholar
2026

Scaling Up, Speeding Up: A Benchmark of Speculative Decoding for Efficient LLM Test-Time Scaling

ICLR 2026poster

Test-time scaling has emerged as a powerful paradigm for enhancing the reasoning capabilities of large language models (LLMs) by allocating additional computational resources during inference. However, this paradigm is inherently inefficient due to the generation of redundant and repetitive reasonin…

Cited by 0SourcecodeScholar
2026

TrimR: Verifier-based Training-Free Thinking Trimming for Efficient Test-Time Scaling

ICLR 2026poster

Large Reasoning Models (LRMs) demonstrate exceptional capability in tackling complex mathematical, logical, and coding tasks by leveraging extended Chain-of-Thought (CoT) reasoning. Test-time scaling methods—such as prolonging CoT with explicit token-level exploration—can push LRMs’ accuracy boundar…

Cited by 0SourceScholar
2026

Why Attention Patterns Exist: A Unifying Temporal Perspective Analysis

ICLR 2026poster

Attention patterns play a crucial role in both training and inference of large language models (LLMs). Prior works have identified individual patterns—such as retrieval heads, sink heads, and diagonal traces—but these observations remain fragmented and lack a unifying explanation. To bridge this gap…

Cited by 0SourcecodeScholar
2025

KVTuner: Sensitivity-Aware Layer-Wise Mixed-Precision KV Cache Quantization for Efficient and Nearly Lossless LLM Inference

ICML 2025poster

KV cache quantization can improve Large Language Models (LLMs) inference throughput and latency in long contexts and large batch-size scenarios while preserving LLMs effectiveness. However, current methods have three unsolved issues: overlooking layer-wise sensitivity to KV cache quantization, high…

2025

The Graph’s Apprentice: Teaching an LLM Low-Level Knowledge for Circuit Quality Estimation

IJCAI 2025

Logic synthesis is a crucial phase in the circuit design process, responsible for transforming hardware description language (HDL) designs into optimized netlists. However, traditional logic synthesis methods are computationally intensive, restricting their iterative use in refining chip designs. Re

2024

HardCore Generation: Generating Hard UNSAT Problems for Data Augmentation

NeurIPS 2024poster

Efficiently determining the satisfiability of a boolean equation --- known as the SAT problem for brevity --- is crucial in various industrial problems. Recently, the advent of deep learning methods has introduced significant potential for enhancing SAT solving. However, a major barrier to the adva…

Cited by 0SourcePDFScholar