Wangchunshu Zhou, Tao Ge, Ke Xu, Furu Wei, Canwen Xu, Julian Mcauley
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Recent studies on compression of pretrained language models (e.g., BERT) usually use preserved accuracy as the metric for evaluation. In this paper, we propose two new metrics, label loyalty and probability loyalty that measure how closely a compressed model (i.e., student) mimics the original model (i.e., teacher). We also explore the effect of compression with regard to robustness under adversarial attacks. We benchmark quantization, pruning, knowledge distillation and progressive module replacing with loyalty and robustness. By combining multiple compression techniques, we provide a practical strategy to achieve better accuracy, loyalty and robustness. 1
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2109.03228")
get_code_for_paper("2109.03228")
have("2109.03228")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2109.03228.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2109.03228)
Connect an agent — have() is free.