paper-with-me

홈 › Papers

Collaborative QA using Interacting LLMs. Impact of Network Structure, Node Capability and Distributed Data

2025-11-18 · Adit Jain, Vikram Krishnamurthy, Yiming Zhang arxiv

In this paper, we model and analyze how a network of interacting LLMs performs collaborative question-answering (CQA) in order to estimate a ground truth given a distributed set of documents. This problem is interesting because LLMs often hallucinate when direct evidence to answer a question is lacking, and these effects become more pronounced in a network of interacting LLMs. The hallucination spreads, causing previously accurate LLMs to hallucinate. We study interacting LLMs and their hallucination by combining novel ideas of mean-field dynamics (MFD) from network science and the randomized utility model from economics to construct a useful generative model. We model the LLM with a latent state that indicates if it is truthful or not with respect to the ground truth, and extend a tractable analytical model considering an MFD to model the diffusion of information in a directed network of LLMs. To specify the probabilities that govern the dynamics of the MFD, we propose a randomized utility model. For a network of LLMs, where each LLM has two possible latent states, we posit sufficient conditions for the existence and uniqueness of a fixed point and analyze the behavior of the fixed point in terms of the incentive (e.g., test-time compute) given to individual LLMs. We experimentally study and analyze the behavior of a network of $100$ open-source LLMs with respect to data heterogeneity, node capability, network structure, and sensitivity to framing on multiple semi-synthetic datasets.

📄 PDF Abstract BibTeX arXiv:2511.14098

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Multi-Relation Aware Temporal Interaction Network Embedding

2021-10-09 · Ling Chen, Shanshan Yu, Dandan Lyu, Da Wang

Temporal interaction networks are formed in many fields, e.g., e-commerce, online education, and social network service. Temporal interaction network embedding can effectively mine the information in temporal interaction…

Graph AttentionNetwork EmbeddingRelation

Collaborative Mean Estimation over Intermittently Connected Networks with Peer-To-Peer Privacy

2023-02-28 · Rajarshi Saha, Mohamed Seif, Michal Yemini, Andrea J. Goldsmith 외

This work considers the problem of Distributed Mean Estimation (DME) over networks with intermittent connectivity, where the goal is to learn a global statistic over the data samples localized across distributed nodes wi…

Modeling Topological Impact on Node Attribute Distributions in Attributed Graphs

2026-02-01 · Amirreza Shiralinasab Langari, Leila Yeganeh, Kim Khoa Nguyen arxiv

We investigate how the topology of attributed graphs influences the distribution of node attributes. This work offers a novel perspective by treating topology and attributes as structurally distinct but interacting compo…

Graph Anomaly Detection

Privacy Preserving Semi-Decentralized Mean Estimation over Intermittently-Connected Networks

2024-06-06 · Rajarshi Saha, Mohamed Seif, Michal Yemini, Andrea J. Goldsmith 외

We consider the problem of privately estimating the mean of vectors distributed across different nodes of an unreliable wireless network, where communications between nodes can fail intermittently. We adopt a semi-decent…

Privacy Preserving

Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions

2020-06-05 · Jakob Bossek, Aneta Neumann, Frank Neumann

The Traveling Salesperson Problem (TSP) is one of the best-known combinatorial optimisation problems. However, many real-world problems are composed of several interacting components. The Traveling Thief Problem (TTP) ad…