SearcharxivSearch

arXiv subjects

Xingru Chen

Publications and source records attributed to Xingru Chen.

18 recordsLinked to original sources

Control of Harmful Information Spreading on Adaptive Higher-Order Networks via Group Dissolution

Curbing harmful information contagion remains a critical challenge, motivating platform-level interventions such as group dissolution to sever transmission chains. However, in practice, users affected by dissolution often exhibit adaptive behavior, rewiring to form new groups. Yet, it remains unclear how these two mechanisms jointly shape information contagion and whether group dissolution remains effective in suppressing it. Here, we develop an adaptive higher-order contagion model that integrates platform-induced group dissolution with user adaptive rewiring, and derive a theoretical framework. Notably, we reveal an effective window for group dissolution, bounded by a critical infection rate. Above this threshold, dissolution backfires and amplifies information prevalence. Within this window, dissolution acts non-monotonically, initially exacerbating prevalence before eradicating contagion via a discontinuous transition beyond a critical dissolution rate. We further show that higher-order reinforcement expands this infection-rate window over which dissolution remains effective, whereas rewiring homophily substantially narrows it. Simulations on empirical hypergraph also validate these findings. Our work highlights the interplay between top-down platform interventions and bottom-up user adaptation, underscoring the need to account for adaptive responses when designing strategies to curb harmful information without unintended amplification.

physics.soc-ph

LaCache: Exact Caching and Precision-Adaptive Inference for Diffusion Large Language Models

Diffusion-based Large Language Models(DLLMs) enable parallel generation via Semi-Autoregressive (SAR) decoding in text generation. However, current methods suffer from severe operator-level redundancy: they recompute the entire sequence during denoising steps, ignoring that the prefix and masked suffix remain invariant within a block. We propose LaCache, a training-free acceleration framework that alleviates this redundancy through lossless caching and mixed precision. Specifically, LaCache employs Lossless State Memoization (LSM) by caching three types of intermediate results: (i) EmbedCache for embedding outputs, (ii) RoPECache for token-wise pre-attention states, and (iii) FACache for the online softmax statistics within FlashAttention. These caches allow the model to skip redundant computation on unchanged tokens without altering the output. To further alleviate memory-bandwidth bottlenecks, LaCache inegrates a per-group FP8 quantization strategy for FFN layers, tailored to step-dependent activation distributions across the diffusion process. Experiments demonstrate that LaCache alone achieves approximately 1.3X end-to-end speedup over vanilla DLLM. When combined with existing acceleration methods, LaCache reaches up to 40.2X end-to-end speedup while maintaining comparable task accuracy.

cs.AI

Evolution of cooperation in the multiplex

Across biological and social systems, cooperation often depends on phenotypic cues rather than random encounters. To account for real-world interactions unfolding across multiple, simultaneous dimensions, here we develop a general framework for the evolution of cooperation in multiplex networks governed by multi-phenotype homophily. We derive analytical conditions for natural selection to favor cooperation across phenotypic traits that are independent or exhibit epistasis and under different modes of mutation coupling. Despite the integration of fitness across layers, the conditions for cooperation resolve into layer-specific $\sigma$-rules, depending only on the local payoff structure, the effective number of phenotypes, and the mutation rates. We show that phenotypic diversity fosters cooperation by partitioning populations into assortative niches. Furthermore, in finite populations, intensifying the prisoner's dilemma shifts the dependence of cooperation on strategy mutation from monotonically decreasing, through U-shaped, to monotonically increasing. Our work provides a unified account of how multi-phenotype homophily underpins the evolutionary dynamics of cooperation in heterogeneous populations.

q-bio.PE

Dynamics of Multi-Agent Actor-Critic Learning in Stochastic Games: from Multistability and Chaos to Stable Cooperation

Achieving robust coordination and cooperation is a central challenge in multi-agent reinforcement learning (MARL). Uncovering the mechanisms underlying such emergent behaviors calls for a dynamical understanding of learn processes. In this work, we investigate the dynamics of actor-critic agents in stochastic games, focusing on the impact of entropy regularization. By leveraging time-scale separation, we derive the system's evolution equations, which are then formally analyzed using dynamical systems theory. We find that in the constant-sum game of Matching Pennies, the system exhibits chaotic behavior. Entropy regularization mitigates this chaos and drives the dynamics toward convergence to fair cooperation. In contrast, in the general-sum game of the Prisoner's Dilemma, the system displays multistability. Interestingly, the three stable equilibria of the system correspond to the well-known ALLC (Always Cooperate), ALLD (Always Defect), and GRIM (Grim Trigger) strategies from evolutionary game theory (EGT). Entropy regularization strengthens system resilience by enlarging the basin of attraction of the cooperative equilibrium. Our findings reveal a close link between the mechanism of direct reciprocity in EGT and how cooperation emerges in MARL, offering insights for designing more robust and collaborative multi-agent systems.

physics.soc-ph

Social Imitation Dynamics of Vaccination Driven by Vaccine Effectiveness and Beliefs

Declines in vaccination coverage for vaccine-preventable diseases, such as measles and chickenpox, have enabled their surprising comebacks and pose significant public health challenges in the wake of growing vaccine hesitancy. Vaccine opt-outs and refusals are often fueled by beliefs concerning perceptions of vaccine effectiveness and exaggerated risks. Here, we quantify the impact of competing beliefs -- vaccine-averse versus vaccine-neutral -- on social imitation dynamics of vaccination, alongside the epidemiological dynamics of disease transmission. These beliefs may be pre-existing and fixed, or coevolving attitudes. This interplay among beliefs, behaviors, and disease dynamics demonstrates that individuals are not perfectly rational; rather, they base their vaccine uptake decisions on beliefs, personal experiences, and social influences. We find that the presence of a small proportion of fixed vaccine-averse beliefs can significantly exacerbate the vaccination dilemma, making the tipping point in the hysteresis loop more sensitive to changes in individuals' perceived costs of vaccination and vaccine effectiveness. However, in scenarios where competing beliefs spread concurrently with vaccination behavior, their double-edged impact can lead to self-correction and alignment between vaccine beliefs and behaviors. The results show that coevolution of vaccine beliefs and behaviors makes populations more sensitive to abrupt changes in perceptions of vaccine cost and effectiveness compared to scenarios without beliefs. Our work provides valuable insights into harnessing the social contagion of even vaccine-neutral attitudes to overcome vaccine hesitancy.

physics.soc-ph

Unbending strategies shepherd cooperation and suppress extortion in spatial populations

Evolutionary game dynamics on networks typically consider the competition among simple strategies such as cooperation and defection in the Prisoner's Dilemma and summarize the effect of population structure as network reciprocity. However, it remains largely unknown regarding the evolutionary dynamics involving multiple powerful strategies typically considered in repeated games, such as the zero-determinant (ZD) strategies that are able to enforce a linear payoff relationship between them and their co-players. Here, we consider the evolutionary dynamics of always cooperate (AllC), extortionate ZD (extortioners), and unbending players in lattice populations based on the commonly used death-birth updating. Out of the class of unbending strategies, we consider a particular candidate, PSO Gambler, a machine-learning-optimized memory-one strategy, which can foster reciprocal cooperation and fairness among extortionate players. We derive analytical results under weak selection and rare mutations, including pairwise fixation probabilities and long-term frequencies of strategies. In the absence of the third unbending type, extortioners can achieve a half-half split in equilibrium with unconditional cooperators for sufficiently large extortion factors. However, the presence of unbending players fundamentally changes the dynamics and tilts the system to favor unbending cooperation. Most surprisingly, extortioners cannot dominate at all regardless of how large their extortion factor is, and the long-term frequency of unbending players is maintained almost as a constant. Our analytical method is applicable to studying the evolutionary dynamics of multiple strategies in structured populations. Our work provides insights into the interplay between network reciprocity and direct reciprocity, revealing the role of unbending strategies in enforcing fairness and suppressing extortion.

physics.soc-ph

COLE: A Hierarchical Generation Framework for Multi-Layered and Editable Graphic Design

Graphic design, which has been evolving since the 15th century, plays a crucial role in advertising. The creation of high-quality designs demands design-oriented planning, reasoning, and layer-wise generation. Unlike the recent CanvaGPT, which integrates GPT-4 with existing design templates to build a custom GPT, this paper introduces the COLE system - a hierarchical generation framework designed to comprehensively address these challenges. This COLE system can transform a vague intention prompt into a high-quality multi-layered graphic design, while also supporting flexible editing based on user input. Examples of such input might include directives like ``design a poster for Hisaishi's concert.'' The key insight is to dissect the complex task of text-to-design generation into a hierarchy of simpler sub-tasks, each addressed by specialized models working collaboratively. The results from these models are then consolidated to produce a cohesive final output. Our hierarchical task decomposition can streamline the complex process and significantly enhance generation reliability. Our COLE system comprises multiple fine-tuned Large Language Models (LLMs), Large Multimodal Models (LMMs), and Diffusion Models (DMs), each specifically tailored for design-aware layer-wise captioning, layout planning, reasoning, and the task of generating images and text. Furthermore, we construct the DESIGNINTENTION benchmark to demonstrate the superiority of our COLE system over existing methods in generating high-quality graphic designs from user intent. Last, we present a Canva-like multi-layered image editing tool to support flexible editing of the generated multi-layered graphic design images. We perceive our COLE system as an important step towards addressing more complex and multi-layered graphic design generation tasks in the future.

cs.CV

Determinants of successful disease control through voluntary quarantine dynamics on social networks

In the wake of epidemics, quarantine measures are typically recommended by health authorities or governments to help control the spread of the disease. Compared with mandatory quarantine, voluntary quarantine offers individuals the liberty to decide whether to isolate themselves in case of infection exposure, driven by their personal assessment of the trade-off between economic loss and health risks as well as their own sense of social responsibility and concern for public health. To better understand self-motivated health behavior choices under these factors, here we incorporate voluntary quarantine into an endemic disease model -- the susceptible-infected-susceptible (SIS) model -- and perform comprehensive agent-based simulations to characterize the resulting behavior-disease interactions in structured populations. We quantify the conditions under which voluntary quarantine will be an effective intervention measure to mitigate disease burden. Furthermore, we demonstrate how individual decision-making factors, including the level of temptation to refrain from quarantine and the degree of social compassion, impact compliance levels of voluntary quarantines and the consequent collective disease mitigation efforts. We find that successful disease control requires either a sufficiently low level of temptation or a sufficiently high degree of social compassion, such that even complete containment of the epidemic is attainable. In addition to well-mixed populations, our simulation results are applicable to other more realistic social networks of contacts, including spatial lattices, small-world networks, and real social networks. Our work offers new insights into the fundamental social dilemma aspect of disease control through non-pharmaceutical interventions, such as voluntary quarantine and isolation, where the collective outcome of individual decision-making is crucial.

physics.soc-ph

Mathematics of multi-agent learning systems at the interface of game theory and artificial intelligence

Evolutionary Game Theory (EGT) and Artificial Intelligence (AI) are two fields that, at first glance, might seem distinct, but they have notable connections and intersections. The former focuses on the evolution of behaviors (or strategies) in a population, where individuals interact with others and update their strategies based on imitation (or social learning). The more successful a strategy is, the more prevalent it becomes over time. The latter, meanwhile, is centered on machine learning algorithms and (deep) neural networks. It is often from a single-agent perspective but increasingly involves multi-agent environments, in which intelligent agents adjust their strategies based on feedback and experience, somewhat akin to the evolutionary process yet distinct in their self-learning capacities. In light of the key components necessary to address real-world problems, including (i) learning and adaptation, (ii) cooperation and competition, (iii) robustness and stability, and altogether (iv) population dynamics of individual agents whose strategies evolve, the cross-fertilization of ideas between both fields will contribute to the advancement of mathematics of multi-agent learning systems, in particular, to the nascent domain of ``collective cooperative intelligence'' bridging evolutionary dynamics and multi-agent reinforcement learning.

physics.soc-ph

An approach for performance requirements verification and test environments generation

Model-based testing (MBT) is a method that supports the design and execution of test cases by models that specify the intended behaviors of a system under test. While systematic literature reviews on MBT in general exist, the state of the art on modeling and testing performance requirements has seen much less attention. Therefore, we conducted a systematic mapping study on model-based performance testing. Then, we studied natural language software requirements specifications in order to understand which and how performance requirements are typically specified. Since none of the identified MBT techniques supported a major benefit of modeling, namely identifying faults in requirements specifications, we developed the Performance Requirements verificatiOn and Test EnvironmentS generaTion approach (PRO-TEST). Finally, we evaluated PRO-TEST on 149 requirements specifications. We found and analyzed 57 primary studies from the systematic mapping study and extracted 50 performance requirements models. However, those models don't achieve the goals of MBT, which are validating requirements, ensuring their testability, and generating the minimum required test cases. We analyzed 77 Software Requirements Specification (SRS) documents, extracted 149 performance requirements from those SRS, and illustrate that with PRO-TEST we can model performance requirements, find issues in those requirements and detect missing ones. We detected three not-quantifiable requirements, 43 not-quantified requirements, and 180 underspecified parameters in the 149 modeled performance requirements. Furthermore, we generated 96 test environments from those models. By modeling performance requirements with PRO-TEST, we can identify issues in the requirements related to their ambiguity, measurability, and completeness. Additionally, it allows to generate parameters for test environments.

cs.SE

Evolutionary Dynamics with Randomly Distributed Benevolent Individuals

Understanding the evolution of cooperation is pivotal in biology and social science. Public resources sharing is a common scenario in the real world. In our study, we explore the evolutionary dynamics of cooperation on a regular graph with degree $k$, introducing the presence of a third strategy, namely the benevolence, who does not evolve over time, but provides a fixed benefit to all its neighbors. We find that the presence of the benevolence can foster the development of cooperative behavior and it follows a simple rule: $b/c > k - p_S(k-1)$. Our results provide new insights into the evolution of cooperation in structured populations.

q-bio.PE

Large scale reuse of microservices using DevOps and InnerSource practices -- A longitudinal case study

Contemporary practices such as InnerSource and DevOps promote software reuse. This study investigates the implications of using contemporary practices on software reuse. In particular, we investigate the costs, benefits, challenges, and potential improvements in contemporary reuse at Ericsson. We performed the study in two phases: a) the initial data collection based on a combination of data collection methods (e.g., interviews, discussions, company portals), and b) a follow-up group discussion after a year to understand the status of the challenges and improvements identified in the first phase. Our results indicate that developing reusable assets resulted in upfront costs, such as additional effort in ensuring compliance. Furthermore, development with reuse also resulted in additional effort, for example, in integrating and understanding reusable assets. Ericsson perceived the additional effort as an investment resulting in long-term benefits such as improved quality, productivity, customer experience, and way of working. Ericsson's main challenge was increased pressure on the producers of reusable assets, which was mitigated by scaling the InnerSource adoption. InnerSource success is evident from the increase in the contributions to reusable assets. In addition, Ericsson implemented measures such as automating the compliance check, which enhanced the maturity of reusable assets and resulted in increased reuse.

cs.SE

Identifying Bridges and Catalysts for Persistent Cooperation Using Network-Based Approach

The framework of iterated Prisoner's Dilemma (IPD) is commonly used to study direct reciprocity and cooperation, with a focus on the assessment of the generosity and reciprocal fairness of an IPD strategy in one-on-one settings. In order to understand the persistence and resilience of reciprocal cooperation, here we study long-term population dynamics of IPD strategies using the Moran process where stochastic dynamics of strategy competition can lead to the rise and fall of cooperation. Although prior work has included a handful of typical IPD strategies in the consideration, it remains largely unclear which type of IPD strategies is pivotal in steering the population away from defection and providing an escape hatch for establishing cooperation. We use a network-based approach to analyze and characterize networks of evolutionary pathways that bridge transient episodes of evolution dominated by depressing defection and ultimately catalyze the evolution of reciprocal cooperation in the long run. We group IPD strategies into three types according to their stationary cooperativity with an unconditional cooperator: the good (fully cooperative), the bad (fully exploitive), and the ugly (in between the former two types). We consider the mutation-selection equilibrium with rare mutations and quantify the impact of the presence versus absence of any given IPD strategy on the resulting population equilibrium. We identify catalysts (certain IPD strategies) as well as bridges (particular evolutionary pathways) that are most crucial for boosting the abundance of good types and suppressing that of bad types or having the highest betweenness centrality. Our work has practical implications and broad applicability to real-world cooperation problems by leveraging catalysts and bridges that are capable of strengthening persistence and resilience.

physics.soc-ph

Steering control of payoff-maximizing players in adaptive learning dynamics

Evolutionary game theory provides a mathematical foundation for cross-disciplinary fertilization, especially for integrating ideas from artificial intelligence and game theory. Such integration offers a transparent and rigorous approach to complex decision-making problems in a variety of important contexts, ranging from evolutionary computation to machine behavior. Despite the astronomically huge individual behavioral strategy space for interactions in the iterated Prisoner's Dilemma (IPD) games, the so-called Zero-Determinant (ZD) strategies is a set of rather simple memory-one strategies yet can unilaterally set a linear payoff relationship between themselves and their opponent. Although the witting of ZD strategies gives players an upper hand in the IPD games, we find and characterize unbending strategies that can force ZD players to be fair in their own interest. Moreover, our analysis reveals the ubiquity of unbending properties in common IPD strategies which are previously overlooked. In this work, we demonstrate the important steering role of unbending strategies in fostering fairness and cooperation in pairwise interactions. Our results will help bring a new perspective by means of combining game theory and multi-agent learning systems for optimizing winning strategies that are robust to noises, errors, and deceptions in non-zero-sum games.

physics.soc-ph

The Geometry of Zero-Determinant Strategies

The advent of Zero-Determinant (ZD) strategies has reshaped the study of reciprocity and cooperation in the iterated Prisoner's Dilemma games. The ramification of ZD strategies has been demonstrated through their ability to unilaterally enforce a linear relationship between their own average payoff and that of their co-player. Common practice conveniently represents this relationship by a straight line in the parametric plot of pairwise payoffs. Yet little attention has been paid to studying the actual geometry of the strategy space of all admissible ZD strategies. Here, our work offers intuitive geometric relationships between different classes of ZD strategies as well as nontrivial geometric interpretations of their specific parameterizations. Adaptive dynamics of ZD strategies further reveals the unforeseen connection between general ZD strategies and the so-called equalizers that can set any co-player's payoff to a fixed value. We show that the class of equalizers forming a hyperplane is the critical equilibrium manifold, only part of which is stable. The same hyperplane is also a separatrix of the cooperation-enhancing region where the optimum response is to increase cooperation for each of the four payoff outcomes. Our results shed light on the simple but elegant geometry of ZD strategies that is previously overlooked.

physics.soc-ph

Outlearning Extortioners by Fair-minded Unbending Strategies

Recent theory shows that extortioners taking advantage of the zero-determinant (ZD) strategy can unilaterally claim an unfair share of the payoffs in the Iterated Prisoner's Dilemma. It is thus suggested that against a fixed extortioner, any adapting co-player should be subdued with full cooperation as their best response. In contrast, recent experiments demonstrate that human players often choose not to accede to extortion out of concern for fairness, actually causing extortioners to suffer more loss than themselves. In light of this, here we reveal fair-minded strategies that are unbending to extortion such that any payoff-maximizing extortioner ultimately will concede in their own interest by offering a fair split in head-to-head matches. We find and characterize multiple general classes of such unbending strategies, including generous zero-determinant strategies and Win-Stay, Lose-Shift as particular examples. When against fixed unbending players, extortioners are forced with consequentially increasing losses whenever intending to demand more unfair share. Our analysis also pivots to the importance of payoff structure in determining the superiority of zero-determinant strategies and in particular their extortion ability. We show that an extortionate ZD player can be even outperformed by, for example, Win-Stay Lose-Shift, if the total payoff of unilateral cooperation is smaller than that of mutual defection. Unbending strategies can be used to outlearn evolutionary extortioners and catalyze the evolution of Tit-for-Tat-like strategies out of ZD players. Our work has implications for promoting fairness and resisting extortion so as to uphold a just and cooperative society.

physics.soc-ph

Highly coordinated nationwide massive travel restrictions are central to effective mitigation and control of COVID-19 outbreaks in China

The COVID-19, the disease caused by the novel coronavirus 2019 (SARS-CoV-2), has caused graving woes across the globe since first reported in the epicenter Wuhan, Hubei, China, December 2019. The spread of COVID-19 in China has been successfully curtailed by massive travel restrictions that put more than 900 million people housebound for more than two months since the lockdown of Wuhan on 23 January 2020 when other provinces in China followed suit. Here, we assess the impact of China's massive lockdowns and travel restrictions reflected by the changes in mobility patterns before and during the lockdown period. We quantify the synchrony of mobility patterns across provinces and within provinces. Using these mobility data, we calibrate movement flow between provinces in combination with an epidemiological compartment model to quantify the effectiveness of lockdowns and reductions in disease transmission. Our analysis demonstrates that the onset and phase of local community transmission in other provinces depends on the cumulative population outflow received from the epicenter Hubei. As such, infections can propagate further into other interconnected places both near and far, thereby necessitating synchronous lockdowns. Moreover, our data-driven modeling analysis shows that lockdowns and consequently reduced mobility lag a certain time to elicit an actual impact on slowing down the spreading and ultimately putting the epidemic under check. In spite of the vastly heterogeneous demographics and epidemiological characteristics across China, mobility data shows that massive travel restrictions have been applied consistently via a top-down approach along with high levels of compliance from the bottom up.

physics.soc-ph

Social learning of prescribing behavior can promote population optimum of antibiotic use

The rise and spread of antibiotic resistance causes worsening medical cost and mortality especially for life-threatening bacteria infections, thereby posing a major threat to global health. Prescribing behavior of physicians is one of the important factors impacting the underlying dynamics of resistance evolution. It remains unclear when individual prescribing decisions can lead to the overuse of antibiotics on the population level, and whether population optimum of antibiotic use can be reached through an adaptive social learning process that governs the evolution of prescribing norm. Here we study a behavior-disease interaction model, specifically incorporating a feedback loop between prescription behavior and resistance evolution. We identify the conditions under which antibiotic resistance can evolve as a result of the tragedy of the commons in antibiotic overuse. Furthermore, we show that fast social learning that adjusts prescribing behavior in prompt response to resistance evolution can steer out cyclic oscillations of antibiotic usage quickly towards the stable population optimum of prescribing. Our work demonstrates that provision of prompt feedback to prescribing behavior with the collective consequences of treatment decisions and costs that are associated with resistance helps curb the overuse of antibiotics.

q-bio.PE