{
  "annotation_id": "77b0e4bc-070d-4f29-b92c-ac977dc3d66c",
  "date_created": "2026-02-17T05:53:24.342000Z",
  "date_modified": "2026-02-17T05:53:24.342000Z",
  "file_hash": "8d9207d0e55f3de6b9a170ca72cfd1950ac099d71d6015ddcbfaa93110161a46",
  "private": false,
  "record": {
    "abstract": "Distributed linearly separable computation is a fundamental problem in large-scale distributed systems, requiring the computation of linearly separable functions over different datasets across distributed workers. This paper studies a heterogeneous distributed linearly separable computation problem, including one master and N distributed workers. The linearly separable task function involves Kc linear combinations of K messages, where each message is a function of one dataset. Distinguished from the existing homogeneous settings that assume each worker holds the same number of datasets, where the data assignment is carefully designed and controlled by the data center (e.g., the cyclic assignment), we consider a more general setting with arbitrary heterogeneous data assignment across workers, where `arbitrary\u0027 means that the data assignment is given in advance and `heterogeneous\u0027 means that the workers may hold different numbers of datasets. Our objective is to characterize the fundamental tradeoff between the computable dimension of the task function and the communication cost under arbitrary heterogeneous data assignment. Under the constraint of integer communication costs, for arbitrary heterogeneous data assignment, we propose a universal computing scheme and a universal converse bound by characterizing the structure of data assignment, where they coincide under some parameter regimes. We then extend the proposed computing scheme and converse bound to the case of fractional communication costs.",
    "arxiv_id": "2601.10177",
    "authors": [
      "Ziting Zhang",
      "Kai Wan",
      "Minquan Cheng",
      "Shuo Shao",
      "Giuseppe Caire"
    ],
    "categories": [
      "cs.DC",
      "cs.IT",
      "math.IT"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Distributed Linearly Separable Computation with Arbitrary Heterogeneous Data Assignment",
    "url": "https://arxiv.org/abs/2601.10177",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "297284d3-b863-4696-9f1f-51b2adf673e5",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}