SOURCE-LINKED INTELLIGENCE

Optimal Rates for Agentic Networked Information Aggregation

arXiv · AI, language, vision and robotics · article · Sep 4, 2026 · UTC

Building on the pioneering paper of Kearns, Roth, and Ryu (SODA'26), we study information aggregation in a networked learning model. The model captures a central pattern in agentic AI: each agent sees only part of the data and passes on only its own conclusion. Their model considers a linear regression problem with the mean squared error (MSE) loss. Agents sit in a DAG and each sees only a subset of the features and its parents' predictions, fits a linear predictor, and passes only its prediction forward. The benchmark is the full-feature learner that sees all raw features. A path of depth $D$

Read original source ↗ Open in workspace

recordType

paper

region

Global