Papers by Yanli Wang
ArkRepoBench: A Repository-Level Code Completion Benchmark for HarmonyOS Development (2026.findings-acl)
Copied to clipboard
Yanlin Wang, Bowen Zhang, Yanli Wang, Daya Guo, Terry Yue Zhuo, Jiachi Chen, Mingwei Liu, Xingong Zhang, Zibin Zheng
| Challenge: | Despite the maturity of LLM-based code assistance for mainstream languages, the capabilities of ArkTS are largely unexplored. |
| Approach: | They propose to benchmark repository-level code completion for ArkTS using 7,519 samples from 20 official HarmonyOS repositories. |
| Outcome: | The proposed benchmark covers multiple difficulty levels and categorizes completion instances into Single-File, Cross-Filled Independent, and Cross-Filed Dependent settings based on dependency analysis. |
From Logical to Computational Sparsity: Structure-Aware Block-Sparse Attention for Long-Code Completion (2026.acl-long)
Copied to clipboard
| Challenge: | Existing sparse attention methods for long-context generation pose high latency . general sparsity methods cause excessive accuracy degradation without considering code structure . |
| Approach: | They propose a training-free **S**tructure-**a**ware **b**lock-spa**r**s**e** attention mechanism that bridges the gap between logical and computational sparsity. |
| Outcome: | The proposed method reduces TTFT by 45-55% while maintaining accuracy within 3% of dense attention. |