arXiv Computation and Language By George Ling, Shanshan Zhong, Lijin Yang, Hao Yang, Nanxiang Li, Zhongzhan Huang

Random Is Almost Enough? Stable and Low-Cost Benchmark Compression via BestRand

Read the original on arXiv Computation and Language →

The paper introduces BestRand, a benchmark‑compression technique that retains the efficiency of random sampling while dramatically cutting the high‑error tail of estimation errors. By analytically approximating the error distribution when estimating full‑benchmark scores from subsets, the authors show that random sampling is surprisingly effective but unstable due to rare large errors. BestRand reduces high‑error risk by 50.2 % and overall estimation error by 16.4 % on average, while cutting construction cost by almost half, and it also lowers out‑of‑distribution estimation error by 21.8 % across various benchmarks.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv Machine Learning
Aug 28

LowRankArena: A Standardized Evaluation Platform for SVD-Based LLM Compression

LowRankArena is a standardized evaluation platform for SVD‑based low‑rank compression of large language models, unifying task versions, compression budgets, comparison regimes, and inference measurements. It provides a reproducible pipeline with over 3 TiB of released compressed checkpoints, enabling consistent comparisons across methods. An audit of five representative SVD techniques using LowRankArena shows that prior reported gains are highly conditional, with performance leaders and tiers shifting across backbones and keep ratios, and that nominal low‑rank savings often yield limited end‑to‑end speedups.

By Zishan Shao, Lixun Zhang, Kangning Cui, Wenhao Wu, Jinhee Kim, Yixiao Wang, Ting Jiang, Hancheng Ye, Qinsi Wang, Fan Yang, Danyang Zhuo, Yiran Chen, Hai Li