In der neuen Ausgabe der @… geht es u.a. ausführlich ums #Fediverse. Da war aus meiner Sicht viel Gutes und Interessantes dabei, insbesondere ein Appell an öffentliche Akteure *auch* einen Fediverse-Account zu betreiben (also genau die 1-Stragegie von
The Cognitive Bandwidth Bottleneck: Shifting Long-Horizon Agent from Planning with Actions to Planning with Schemas
Baixuan Xu, Tianshi Zheng, Zhaowei Wang, Hong Ting Tsang, Weiqi Wang, Tianqing Fang, Yangqiu Song
https://arxiv.org/abs/2510.07091
Hybrid Terrain-Aware Path Planning: Integrating VD--RRT\(^{*}\) Exploration and VD--D\(^{*}\) Lite Repair
Akshay Naik, William R. Norris, Dustin Nottage, Ahmet Soylemezoglu
https://arxiv.org/abs/2510.12169
FedMon: Federated eBPF Monitoring for Distributed Anomaly Detection in Multi-Cluster Cloud Environments
Sehar Zehra, Hassan Jamil Syed, Ummay Faseeha
https://arxiv.org/abs/2510.10126
When Greedy Wins: Emergent Exploitation Bias in Meta-Bandit LLM Training
Sanxing Chen, Xiaoyin Chen, Yukun Huang, Roy Xie, Bhuwan Dhingra
https://arxiv.org/abs/2509.24923 https:…
Generative AI-Driven Hierarchical Multi-Agent Framework for Zero-Touch Optical Networks
Yao Zhang, Yuchen Song, Shengnan Li, Yan Shi, Shikui Shen, Xiongyan Tang, Min Zhang, Danshi Wang
https://arxiv.org/abs/2510.05625
Have We Scene It All? Scene Graph-Aware Deep Point Cloud Compression
Nikolaos Stathoulopoulos, Christoforos Kanellakis, George Nikolakopoulos
https://arxiv.org/abs/2510.08512 ht…
Beckstrom initially did not want to go to the capital because she was concerned about feeling lonely away from home.
“She hated it. She cried about it,” her boyfriend said.
But with time, she came to enjoy the deployment and bonded with other troops.
In her spare time, he said, she visited monuments and museums, taking pictures and soaking up D.C.’s history.
She was especially interested in the U.S. Holocaust Memorial Museum
Robust forecast aggregation via additional queries
Rafael Frongillo, Mary Monroe, Eric Neyman, Bo Waggoner
https://arxiv.org/abs/2512.05271 https://arxiv.org/pdf/2512.05271 https://arxiv.org/html/2512.05271
arXiv:2512.05271v1 Announce Type: new
Abstract: We study the problem of robust forecast aggregation: combining expert forecasts with provable accuracy guarantees compared to the best possible aggregation of the underlying information. Prior work shows strong impossibility results, e.g. that even under natural assumptions, no aggregation of the experts' individual forecasts can outperform simply following a random expert (Neyman and Roughgarden, 2022).
In this paper, we introduce a more general framework that allows the principal to elicit richer information from experts through structured queries. Our framework ensures that experts will truthfully report their underlying beliefs, and also enables us to define notions of complexity over the difficulty of asking these queries. Under a general model of independent but overlapping expert signals, we show that optimal aggregation is achievable in the worst case with each complexity measure bounded above by the number of agents $n$. We further establish tight tradeoffs between accuracy and query complexity: aggregation error decreases linearly with the number of queries, and vanishes when the "order of reasoning" and number of agents relevant to a query is $\omega(\sqrt{n})$. These results demonstrate that modest extensions to the space of expert queries dramatically strengthen the power of robust forecast aggregation. We therefore expect that our new query framework will open up a fruitful line of research in this area.
toXiv_bot_toot
Hybrid Safety Verification of Multi-Agent Systems using $\psi$-Weighted CBFs and PAC Guarantees
Venkat Margapuri, Garik Kazanjian, Naren Kosaraju
https://arxiv.org/abs/2509.20093