Searcharxiv⌕ Search

arXiv subjects

Laurence Brandenberger

Publications and source records attributed to Laurence Brandenberger.

5 recordsLinked to original sources

Graph-Augmented LLMs for Swiss MP Ideology Prediction

Approximating the ideological position of Members of Parliament (MPs) is a fundamental task in political science, helping researchers understand legislative behavior, party alignment, and policy preferences. While Large Language Models (LLMs) have shown promising results in estimating MPs' ideological stances, there are more actors and elements in the parliamentary system, and relations between them, that could provide a wider and more informative picture. However, due to the complexity of integrating them in the prediction task, these additional elements are generally ignored. In this work, we propose an LLM framework, PG-RAG, that implements a retrieval-augmented generation pipeline: it first queries a political knowledge graph (KG) and then integrates the resulting graph-structured information into the context. This allows for capturing both textual semantics and inter-MP relationships, another relevant information source in any parliamentary system. We evaluate the approach on the task of ideology prediction, using data from a Swiss parliamentary dataset. When comparing graph-augmented models against several state-of-the-art baselines, the results demonstrate that incorporating this enriched information, which encodes information about different entities and relations, improves prediction performance. These results help to highlight the value of domain-specific relational information in modeling political behavior.

cs.CL↗

Endogenous Coalition Formation in Policy Debates

Political actors form coalitions around their joint normative beliefs in order to influence the policy process on contentious issues such as climate change or population ageing. Policy process theory maintains that learning within and across coalitions is a central predictor of coalition formation and policy change but has yet to explain how policy learning works. The present article explains the formation and maintenance of coalitions by focusing on the ways actors adopt policy beliefs from other actors in policy debates. A policy debate is a complex social system in which temporal network dependence guides how actors contribute ideological statements to the debate. Belief adoption matters in three complementary ways: bonding, which exploits cues within coalitions; bridging, which explores new beliefs outside one's perimeter in the debate; and repulsion, which reinforces polarization between coalitions and cements their belief systems. We formalize this theory of endogenous coalition formation in policy debates and test it on a micro-level empirical dataset using statistical network analysis and event history analysis.

cs.SI↗

Data2Neo - A Tool for Complex Neo4j Data Integration

This paper introduces Data2Neo, an open-source Python library for converting relational data into knowledge graphs stored in Neo4j databases. With extensive customization options and support for continuous online data integration from various data sources, Data2Neo is designed to be user-friendly, efficient, and scalable to large datasets. The tool significantly lowers the barrier to entry for creating and using knowledge graphs, making this increasingly popular form of data representation accessible to a wider audience. The code is available at https://github.com/jkminder/data2neo .

cs.DB↗

Disentangling Active and Passive Cosponsorship in the U.S. Congress

In the U.S. Congress, legislators can use active and passive cosponsorship to support bills. We show that these two types of cosponsorship are driven by two different motivations: the backing of political colleagues and the backing of the bill's content. To this end, we develop an Encoder+RGCN based model that learns legislator representations from bill texts and speech transcripts. These representations predict active and passive cosponsorship with an F1-score of 0.88. Applying our representations to predict voting decisions, we show that they are interpretable and generalize to unseen tasks.

cs.LG↗

Quantifying Triadic Closure in Multi-Edge Social Networks

Multi-edge networks capture repeated interactions between individuals. In social networks, such edges often form closed triangles, or triads. Standard approaches to measure this triadic closure, however, fail for multi-edge networks, because they do not consider that triads can be formed by edges of different multiplicity. We propose a novel measure of triadic closure for multi-edge networks of social interactions based on a shared partner statistic. We demonstrate that our operalization is able to detect meaningful closure in synthetic and empirical multi-edge networks, where common approaches fail. This is a cornerstone in driving inferential network analyses from the analysis of binary networks towards the analyses of multi-edge and weighted networks, which offer a more realistic representation of social interactions and relations.

cs.SI↗