行业动态
arxiv.org ·
@Shayan Taherijam
代理网络化信息聚合的最优速率
研究网络化学习模型中的信息聚合问题,每个代理仅看到部分数据和父代预测,推导出超额均方误差的最优速率,填补了先前研究的空白。
AI推荐理由 理论性论文,研究网络化信息聚合的最优速率,对Agentic AI有理论意义,但缺乏直接应用,兴趣度较低。
70
正文
计算机科学 > 机器学习
arXiv:2609.05318v1 (cs)
[提交于2026年9月4日]
标题:智能体网络信息聚合的最优速率
作者:MohammadHossein Bateni, Zahra Hadizadeh, MohammadTaghi Hajiaghayi, Mahdi JafariRaviz, Shayan Taherijam
查看论文PDF,标题为“Optimal Rates for Agentic Networked Information Aggregation”,作者MohammadHossein Bateni等4人
查看PDF
摘要:基于Kearns、Roth和Ryu(SODA'26)的开创性论文,我们研究了网络化学习模型中的信息聚合。该模型捕捉了智能体AI中的一个核心模式:每个智能体只看到部分数据,并只传递自己的结论。他们的模型考虑了一个具有均方误差(MSE)损失的线性回归问题。智能体位于一个有向无环图(DAG)中,每个智能体只看到特征的一个子集及其父节点的预测,拟合一个线性预测器,并只将其预测向前传递。基准是看到所有原始特征的全特征学习器。如果每M个连续智能体的每个块都集体看到所有原始特征,则深度为D的路径是M覆盖的。Kearns、Roth和Ryu证明了这样一条路径上最后一个智能体的超额均方误差为O(M/√D),并给出了一个循环实例,其超额误差为Ω(M/D)对于D
新
|
最近
| 2026-09
更改为浏览:
cs
cs.GT
econ
econ.TH
参考文献与引用
NASA ADS
Google Scholar
Semantic Scholar
导出BibTeX引用
加载中...
BibTeX格式引用
×
加载中...
数据由以下提供:
书签
书目工具
书目与引用工具
书目浏览器切换
书目浏览器(什么是浏览器?)
关联论文切换
关联论文(什么是关联论文?)
Litmaps切换
Litmaps(什么是Litmaps?)
scite.ai切换
scite智能引用(什么是智能引用?)
代码、数据、媒体
与本文相关的代码、数据和媒体
alphaXiv切换
alphaXiv(什么是alphaXiv?)
代码链接切换
CatalyzeX论文代码查找器(什么是CatalyzeX?)
DagsHub切换
DagsHub(什么是DagsHub?)
GotitPub切换
Gotit.pub(什么是GotitPub?)
Huggingface切换
Hugging Face(什么是Huggingface?)
ScienceCast切换
ScienceCast(什么是ScienceCast?)
演示
演示
Replicate切换
Replicate(什么是Replicate?)
Spaces切换
Hugging Face Spaces(什么是Spaces?)
Spaces切换
TXYZ.AI(什么是TXYZ.AI?)
相关论文
推荐与搜索工具
链接到Influence Flower
Influence Flower(什么是Influence Flowers?)
核心推荐器切换
CORE推荐器(什么是CORE?)
IArxiv推荐器切换
IArxiv推荐器
(什么是IArxiv?)
作者
会议/期刊
机构
主题
关于arXivLabs
arXivLabs:与社区合作者的实验项目
arXivLabs是一个框架,允许合作者直接在我们的网站上开发和分享新的arXiv功能。
与arXivLabs合作的个人和组织都接受并认可我们的开放、社区、卓越和用户数据隐私价值观。arXiv致力于这些价值观,并且只与遵守这些价值观的合作伙伴合作。
有一个能为arXiv社区增加价值的项目想法?了解更多关于arXivLabs的信息。
这篇论文的哪些作者是背书人?|
禁用MathJax(什么是MathJax?)
查看原文(中文正文为 AI 翻译)
Computer Science > Machine Learning
arXiv:2609.05318v1 (cs)
[Submitted on 4 Sep 2026]
Title:Optimal Rates for Agentic Networked Information Aggregation
Authors:MohammadHossein Bateni, Zahra Hadizadeh, MohammadTaghi Hajiaghayi, Mahdi JafariRaviz, Shayan Taherijam
View a PDF of the paper titled Optimal Rates for Agentic Networked Information Aggregation, by MohammadHossein Bateni and 4 other authors
View PDF
Abstract: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$ is $M$-covered if every block of $M$ consecutive agents collectively sees all raw features. Kearns, Roth, and Ryu proved that the excess mean squared error of the last agent on such a path is $O(M/\sqrt D)$, and gave a cyclic instance with excess error $\Omega(M/D)$ for $D
new
|
recent
| 2026-09
Change to browse by:
cs
cs.GT
econ
econ.TH
References & Citations
NASA ADS
Google Scholar
Semantic Scholar
export BibTeX citation
Loading...
BibTeX formatted citation
×
loading...
Data provided by:
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
IArxiv recommender toggle
IArxiv Recommender
(What is IArxiv?)
Author
Venue
Institution
Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Which authors of this paper are endorsers? |
Disable MathJax (What is MathJax?)