← Search

Hanrui Wang

8 accepted papers

2026

AsyncSpade: Efficient Test-Time Scaling with Asynchronous Sparse Decoding

ICML 2026poster

Test-time scaling (TTS) can boost LLM reasoning through long chain-of-thought (CoT), but the linear KV-cache growth amplifies the memory-bound bottleneck of LLM decoding. Query-aware sparse decoding methods can achieve state-of-the-art performance under constrained FLOP budget, but are mainly constr…

Cited by 0SourceScholar
2026

Dustin: Draft-Augmented Sparse Verification for Efficient Long-Context Generation with Speculative Decoding

ICML 2026poster

While speculative decoding improves inference throughput for multi-batch long-context Large Language Models (LLMs), its efficiency is often limited by a verification bottleneck where Key-Value (KV) cache loading dominates latency. Existing compression methods fail in this regime: static eviction inc…

Cited by 0SourceScholar
2026

Eigen-1: Scientific Reasoning through Adaptive Multi-Agent Refinement and Monitor-based RAG

ICLR 2026poster

Large language models (LLMs) have recently shown strong progress on scientific reasoning, yet two major bottlenecks remain. First, explicit retrieval fragments reasoning, imposing a hidden tool tax of extra tokens and steps. Second, multi-agent pipelines often dilute strong solutions by averaging ac…

Cited by 0SourcecodeScholar
2025

Agentic Copyright Watermarking against Adversarial Evidence Forgery with Purification-Agnostic Curriculum Proxy Learning

ICASSP 2025accepted

With the proliferation of AI agents in various domains, protecting the ownership of AI models has become crucial due to the significant investment in their development. Unauthorized use and illegal distribution of these models pose serious threats to intellectual property, necessitating effective co…

Cited by 0SourceScholar
2020

APQ: Joint Search for Network Architecture, Pruning and Quantization Policy

CVPR 2020poster

We present APQ, a novel design methodology for efficient deep learning deployment. Unlike previous methods that separately optimize the neural network architecture, pruning policy, and quantization policy, we design to optimize them in a joint manner. To deal with the larger design space it brings,…

Cited by 253PDFcodeScholar
2020

Searching Efficient 3D Architectures with Sparse Point-Voxel Convolution

ECCV 2020poster

Self-driving cars need to understand 3D scenes efficiently and accurately in order to drive safely. Given the limited hardware resources, existing 3D perception models are not able to recognize small instances (e.g., pedestrians, cyclists) very well due to the low-resolution voxelization and aggress…

2019

Park: An Open Platform for Learning-Augmented Computer Systems

NeurIPS 2019poster

We present Park, a platform for researchers to experiment with Reinforcement Learning (RL) for computer systems. Using RL for improving the performance of systems has a lot of potential, but is also in many ways very different from, for example, using RL for games. Thus, in this work we first disc…

2018

AMC: AutoML for Model Compression and Acceleration on Mobile Devices

ECCV 2018poster

Model compression is an effective technique to efficiently deploy neural network models on mobile devices which have limited computation resources and tight power budgets. Conventional model compression techniques rely on hand-crafted features and require domain experts to explore the large design s…