{"paper":{"title":"Distributed Seeking for Fixed Points of Biased Stochastic Operators: A Communication-Efficient Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A surrogate function proves convergence for distributed fixed-point seeking under biased stochastic operators with communication compression.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fan Li, Guanghui Wen, Lei Xu, Tao Yang, Xinlei Yi, Yang Shi","submitted_at":"2026-05-08T12:00:59Z","abstract_excerpt":"This paper investigates the distributed fixed point seeking problem of sum-separable stochastic operators over the multi-agent network. Based on inexact Krasnosel'ski\\u{\\i}--Mann iterations, the communication-efficient distributed algorithm is proposed under the relaxed growth bias and variance conditions, generalizing traditional unbiased and bounded additive variance assumptions. To enhance communication efficiency, we integrate communication compression and dynamic period skipping techniques, particularly adopting a unified compressor that allows both relative and absolute compression error"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"By introducing a surrogate function for general non-contractive and contractive operators, we establish convergence guarantees of the distributed fixed point iteration, achieving among the first theoretical unifications with distributed non-convex optimization algorithms.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The relaxed growth bias and variance conditions on the stochastic operators, which generalize traditional unbiased and bounded additive variance assumptions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A communication-efficient distributed algorithm for fixed-point seeking of biased stochastic operators with convergence guarantees under relaxed conditions and unification to non-convex optimization.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A surrogate function proves convergence for distributed fixed-point seeking under biased stochastic operators with communication compression.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"bc68d5ab39acba1e855cac0fe601a91c247962e698f162404853b4ec31c6a263"},"source":{"id":"2605.07633","kind":"arxiv","version":2},"verdict":{"id":"2db1a3d1-83d2-4967-9e3a-709edf5efaca","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-11T02:38:11.116364Z","strongest_claim":"By introducing a surrogate function for general non-contractive and contractive operators, we establish convergence guarantees of the distributed fixed point iteration, achieving among the first theoretical unifications with distributed non-convex optimization algorithms.","one_line_summary":"A communication-efficient distributed algorithm for fixed-point seeking of biased stochastic operators with convergence guarantees under relaxed conditions and unification to non-convex optimization.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The relaxed growth bias and variance conditions on the stochastic operators, which generalize traditional unbiased and bounded additive variance assumptions.","pith_extraction_headline":"A surrogate function proves convergence for distributed fixed-point seeking under biased stochastic operators with communication compression."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.07633/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T10:22:02.904035Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-20T05:37:44.842652Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:18.869241Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T11:39:54.824648Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"b263ddf1c1c4e696cca3363dce79890bb72959d5efb1d888a0fccd933e11f66c"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9b8410a399f70ed82766188449d400003bded13c096c731f99743dded3b30852"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}