Searcharxiv⌕ Search

arXiv · 2610.08328

Enhancing LLMs with Cognitive-Affective Personality Inference for Simulating Human Social-Psychological Behavior

Abstract

Large language models are increasingly used to simulate human participants in social and behavioral studies, yet static persona prompting typically maps a participant profile and an experimental scenario directly to a response, entangling stable dispositions with situation-specific interpretations. To address this limitation, we introduce \textbf{SPIN}, a cognitive-affective personality system-inspired inference pipeline for simulating human social-psychological behavior. Specifically, SPIN implements this structured inference process through three zero-shot LLM calls that compile a task-blind participant core, elicit condition-specific cognitive-affective states, and read out decisions from those states, thereby reusing stable personality structure while routing each trial-specific response through an explicit state representation. We evaluate SPIN on two reconstructed social-psychological study families spanning uncertainty reasoning and pluralistic ignorance, across four base LLMs. Compared with blank, demographic, narrative, and chain-of-thought prompt variants, SPIN consistently delivers the strongest overall alignment performance across base LLMs and study families. Ablations and state analyses further show that both personality compilation and structured state elicitation contribute to the gains, and that the elicited states shift interpretably across informational and normative conditions. These results suggest that structured personality-state inference can improve benchmark-level behavioral alignment beyond richer persona descriptions or generic multi-step reasoning.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhibo Deng, Dongyuan Li, Shuwen Ge, Ziqing Zhang, Ying Zhang, Renhe Jiang. 2026-10-06. Enhancing LLMs with Cognitive-Affective Personality Inference for Simulating Human Social-Psychological Behavior. https://arxiv.org/abs/2610.08328

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A local eigenvector centrality

Eigenvector centrality is an established measure of global connectivity, from which the importance and influence of nodes can be inferred. We introduce local eigenvector centrality (LEC), a scale-adaptive extension that integrates local and global connectivity into a single centrality measure. LEC identifies a topologically relevant mesoscopic scale for community-level centrality assessment, informed by prominent eigengaps, and combines information from the associated eigenvectors, via the Euclidean norm, to yield a centrality that reflects community-driven node influence. Networks with known community structures are employed to demonstrate that LEC closely reproduces eigenvector centrality for each community in isolation. Discrepancies between these measures are shown to be attributable to the global connectivity of affected nodes. LEC therefore provides a principled integration of community-level and global notions of node importance. Comparisons with PageRank and Katz centrality demonstrate that damping-based approaches do not recover community-scale centrality as effectively as LEC.

cs.SI↗

Recommender system in X inadvertently profiles ideological positions of users

Several data protection laws restrict processing that reveals political opinions, irrespective of the controller's intent. Whether recommender systems do so as a by-product of optimizing relevance has not been measured. From 2.5 million ``Who to Follow'' recommendations shown to 682 volunteers in France, we reconstructed an approximation of the embedding used by X's recommender for 26,509 accounts, computing survey-calibrated ideology scores. One direction in this embedding orders users by Left-Right position (Pearson rho = 0.887), distinct from directions tracking age, gender or popularity. We show this scale exists and affects the recommendations computed from the embedding. Removing it diversified recommendations at a limited cost in accuracy. We document a consequential form of emergent political representation that current definitions of profiling do not clearly address.

cs.SI↗

Scalable detection of higher-order interactions in network data

Complex systems are routinely measured and represented through pairwise networks, even when the underlying interactions involve more than two units at once. Recovering this latent hypergraph structure from pairwise measurements is a fundamental inverse problem, but as the space of candidate hyperedges grows exponentially with system size, scalable hypergraph reconstruction at arbitrary interaction orders is out of reach for existing methods. Here we cast hypergraph reconstruction as a local signal-to-noise discrimination problem and use this locality to build a fast algorithm that reconstructs hypergraphs up to any interaction order. Across diverse synthetic and real-world systems our method achieves a high recovery accuracy of latent hypergraph structure while reconstructing hypergraphs up to orders of magnitude more quickly than current approaches. Our approach also yields an information-theoretic detectability boundary that sharply predicts which latent hyperedges are recoverable from pairwise measurements.

cs.SI↗