dorsal/arxiv
View SchemaFundamental Limits of Coded Polynomial Aggregation
| Authors | Xi Zhong, Jörg Kliewer, Mingyue Ji |
|---|---|
| Categories | |
| ArXiv ID | 2601.10028vv1 |
| URL | https://arxiv.org/abs/2601.10028 |
| License | http://creativecommons.org/licenses/by-nc-sa/4.0/ |
Abstract
Coded polynomial aggregation (CPA) enables the master to directly recover a weighted aggregation of polynomial evaluations without individually decoding each term, thereby reducing the number of required worker responses. In this paper, we extend CPA to straggler-aware distributed computing systems and introduce a straggler-aware CPA framework with pre-specified non-straggler patterns, where exact recovery is required only for a given collection of admissible non-straggler sets. Our main result shows that exact recovery of the desired aggregation is achievable with fewer worker responses than required by polynomial coded computing based on individual decoding, and that feasibility is fundamentally characterized by the intersection structure of the non-straggler patterns. In particular, we establish necessary and sufficient conditions for exact recovery in straggler-aware CPA and identify an intersection-size threshold that is sufficient to guarantee exact recovery. We further prove that this threshold becomes both necessary and sufficient when the number of admissible non-straggler sets is sufficiently large. We also provide an explicit construction of feasible CPA schemes whenever the intersection size exceeds the derived threshold. Finally, simulations reveal a sharp feasibility transition at the predicted threshold, providing empirical evidence that the bound is tight in practice.
{
"annotation_id": "6ba84a9f-0375-4041-8144-88811c657281",
"date_created": "2026-02-17T05:53:23.554000Z",
"date_modified": "2026-02-17T05:53:23.554000Z",
"file_hash": "8a53141f1737519288afad50df64ae47788c9be8220dc81121a864d218dc56a2",
"private": false,
"record": {
"abstract": "Coded polynomial aggregation (CPA) enables the master to directly recover a weighted aggregation of polynomial evaluations without individually decoding each term, thereby reducing the number of required worker responses. In this paper, we extend CPA to straggler-aware distributed computing systems and introduce a straggler-aware CPA framework with pre-specified non-straggler patterns, where exact recovery is required only for a given collection of admissible non-straggler sets. Our main result shows that exact recovery of the desired aggregation is achievable with fewer worker responses than required by polynomial coded computing based on individual decoding, and that feasibility is fundamentally characterized by the intersection structure of the non-straggler patterns. In particular, we establish necessary and sufficient conditions for exact recovery in straggler-aware CPA and identify an intersection-size threshold that is sufficient to guarantee exact recovery. We further prove that this threshold becomes both necessary and sufficient when the number of admissible non-straggler sets is sufficiently large. We also provide an explicit construction of feasible CPA schemes whenever the intersection size exceeds the derived threshold. Finally, simulations reveal a sharp feasibility transition at the predicted threshold, providing empirical evidence that the bound is tight in practice.",
"arxiv_id": "2601.10028",
"authors": [
"Xi Zhong",
"J\u00f6rg Kliewer",
"Mingyue Ji"
],
"categories": [
"cs.IT",
"cs.DC",
"math.IT"
],
"license": "http://creativecommons.org/licenses/by-nc-sa/4.0/",
"title": "Fundamental Limits of Coded Polynomial Aggregation",
"url": "https://arxiv.org/abs/2601.10028",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "417aa0ae-7c41-4676-bb17-fe6a61bd6643",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}