Searcharxiv⌕ Search

arXiv subjects

Chen Shen

Publications and source records attributed to Chen Shen.

At least 109 records · Page 6Linked to original sources

Damping Tuning Considering Random Disturbances Adopting Distributionally Robust Optimization

In scenarios where high penetration of renewable energy sources (RES) is connected to the grid over long distances, the output of RES exhibits significant fluctuations, making it difficult to accurately characterize. The intermittency and uncertainty of these fluctuations pose challenges to the stability of the power system. This paper proposes a distributionally robust damping optimization control framework (DRDOC) to address the uncertainty in the true distribution of random disturbances caused by RES. First, the installation location of damping controllers and key control parameters are determined through Sobol sensitivity indices and participation factors. Next, a nonlinear relationship between damping and random disturbances is established with Polynomial Chaos Expansion (PCE). The uncertainty in the distribution of disturbances is captured by ambiguity sets. The DRDOC is formulated as a convex optimization problem, which is further simplified for efficient computation. Finally, the optimal control parameters are derived through convex optimization techniques. Simulation results demonstrate the effectiveness and distribution robustness of the proposed DRDOC.

math.OC↗

SciPIP: An LLM-based Scientific Paper Idea Proposer

The rapid advancement of large language models (LLMs) has opened new possibilities for automating the proposal of innovative scientific ideas. This process involves two key phases: literature retrieval and idea generation. However, existing approaches often fall short due to their reliance on keyword-based search tools during the retrieval phase, which neglects crucial semantic information and frequently results in incomplete retrieval outcomes. Similarly, in the idea generation phase, current methodologies tend to depend solely on the internal knowledge of LLMs or metadata from retrieved papers, thereby overlooking significant valuable insights contained within the full texts. To address these limitations, we introduce SciPIP, an innovative framework designed to enhance the LLM-based proposal of scientific ideas through improvements in both literature retrieval and idea generation. Our approach begins with the construction of a comprehensive literature database that supports advanced retrieval based not only on keywords but also on semantics and citation relationships. This is complemented by the introduction of a multi-granularity retrieval algorithm aimed at ensuring more thorough and exhaustive retrieval results. For the idea generation phase, we propose a dual-path framework that effectively integrates both the content of retrieved papers and the extensive internal knowledge of LLMs. This integration significantly boosts the novelty, feasibility, and practical value of proposed ideas. Our experiments, conducted across various domains such as natural language processing and computer vision, demonstrate SciPIP's capability to generate a multitude of innovative and useful ideas. These findings underscore SciPIP's potential as a valuable tool for researchers seeking to advance their fields with groundbreaking concepts.

cs.CL↗

SuperSalt: Equivariant Neural Network Force Fields for Multicomponent Molten Salts System

Molten salts are crucial for clean energy applications, yet exploring their thermophysical properties across diverse chemical space remains challenging. We present the development of a machine learning interatomic potential (MLIP) called SuperSalt, which targets 11-cation chloride melts and captures the essential physics of molten salts with near-DFT accuracy. Using an efficient workflow that integrates systems of one, two, and 11 components, the SuperSalt potential can accurately predict thermophysical properties such as density, bulk modulus, thermal expansion, and heat capacity. Our model is validated across a broad chemical space, demonstrating excellent transferability. We further illustrate how Bayesian optimization combined with SuperSalt can accelerate the discovery of optimal salt compositions with desired properties. This work provides a foundation for future studies that allows easy extensions to more complex systems, such as those containing additional elements. SuperSalt represents a shift towards a more universal, efficient, and accurate modeling of molten salts for advanced energy applications.

cond-mat.mtrl-sci↗

Mutation mitigates finite-size effects in spatial evolutionary games

Agent-based simulations are essential for studying cooperation on spatial networks. However, finite-size effects -- random fluctuations due to limited network sizes -- can cause certain strategies to unexpectedly dominate or disappear, leading to unreliable outcomes. While enlarging network sizes or carefully preparing initial states can reduce these effects, both approaches require significant computational resources. In this study, we demonstrate that incorporating mutation into simulations on limited networks offers an effective and resource-efficient alternative. Using spatial optional public goods games and a more intricate tolerance-based variant, we find that rare mutations preserve inherently stable equilibria. When equilibria are affected by finite-size effects, introducing moderate mutation rates prevent finite-size-induced strategy dominance or extinction, producing results consistent with large-network simulations. Our findings position mutation as a practical tool for improving the reliability of agent-based models and emphasize the importance of mutation sensitivity analysis in managing finite-size effects across spatial networks.

physics.soc-ph↗

Optional participation only provides a narrow scope for sustaining cooperation

Understanding how cooperation emerges in public goods games is crucial for addressing societal challenges. While optional participation can establish cooperation without identifying cooperators, it relies on specific assumptions -- that individuals abstain and receive a non-negative payoff, or that non-participants cause damage to public goods -- which limits our understanding of its broader role. We generalize this mechanism by considering non-participants' payoffs and their potential direct influence on public goods, allowing us to examine how various strategic motives for non-participation affect cooperation. Using replicator dynamics, we find that cooperation thrives only when non-participants are motivated by individualistic or prosocial values, with individualistic motivations yielding optimal cooperation. These findings are robust to mutation, which slightly enlarges the region where cooperation can be maintained through cyclic dominance among strategies. Our results suggest that while optional participation can benefit cooperation, its effectiveness is limited and highlights the limitations of bottom-up schemes in supporting public goods.

math.DS↗

Financial Risk Assessment via Long-term Payment Behavior Sequence Folding

Online inclusive financial services encounter significant financial risks due to their expansive user base and low default costs. By real-world practice, we reveal that utilizing longer-term user payment behaviors can enhance models' ability to forecast financial risks. However, learning long behavior sequences is non-trivial for deep sequential models. Additionally, the diverse fields of payment behaviors carry rich information, requiring thorough exploitation. These factors collectively complicate the task of long-term user behavior modeling. To tackle these challenges, we propose a Long-term Payment Behavior Sequence Folding method, referred to as LBSF. In LBSF, payment behavior sequences are folded based on merchants, using the merchant field as an intrinsic grouping criterion, which enables informative parallelism without reliance on external knowledge. Meanwhile, we maximize the utility of payment details through a multi-field behavior encoding mechanism. Subsequently, behavior aggregation at the merchant level followed by relational learning across merchants facilitates comprehensive user financial representation. We evaluate LBSF on the financial risk assessment task using a large-scale real-world dataset. The results demonstrate that folding long behavior sequences based on internal behavioral cues effectively models long-term patterns and changes, thereby generating more accurate user financial profiles for practical applications.

cs.CY↗

Seeing Clearly by Layer Two: Enhancing Attention Heads to Alleviate Hallucination in LVLMs

The hallucination problem in multimodal large language models (MLLMs) remains a common issue. Although image tokens occupy a majority of the input sequence of MLLMs, there is limited research to explore the relationship between image tokens and hallucinations. In this paper, we analyze the distribution of attention scores for image tokens across each layer and head of the model, revealing an intriguing and common phenomenon: most hallucinations are closely linked to the pattern of attention sinks in the self-attention matrix of image tokens, where shallow layers exhibit dense attention sinks and deeper layers show sparse attention sinks. We further analyze the attention heads of different layers and find that heads with high-density attention sink in the image part play a positive role in alleviating hallucinations. In this paper, we propose a training-free method named \textcolor{red}{\textbf{E}}nhancing \textcolor{red}{\textbf{A}}ttention \textcolor{red}{\textbf{H}}eads (EAH), an approach designed to enhance the convergence of image tokens attention sinks in the shallow layers. EAH identifies the attention head that shows the vision sink in a shallow layer and extracts its attention matrix. This attention map is then broadcast to other heads in the layer, thereby strengthening the layer to pay more attention to the image itself. With extensive experiments, EAH shows significant hallucination-mitigating performance on different MLLMs and metrics, proving its effectiveness and generality.

cs.CV↗

A Distributionally Robust Control Strategy for Frequency Safety based on Koopman Operator Described System Model

As the proportion of renewable energy and power electronics in the power system increases, modeling frequency dynamics under power deficits becomes more challenging. Although data-driven methods help mitigate these challenges, they are exposed to data noise and training errors, leading to uncertain prediction errors. To address uncertain and limited statistical information of prediction errors, we introduce a distributionally robust data-enabled emergency frequency control (DREFC) framework. It aims to ensure a high probability of frequency safety and allows for adjustable control conservativeness for decision makers. Specifically, DREFC solves a min-max optimization problem to find the optimal control that is robust to distribution of prediction errors within a Wasserstein-distance-based ambiguity set. With an analytical approximation for VaR constraints, we achieve a computationally efficient reformulations. Simulations demonstrate that DREFC ensures frequency safety, low control costs and low computation time.

eess.SY↗

Instance-adaptive Zero-shot Chain-of-Thought Prompting

Zero-shot Chain-of-Thought (CoT) prompting emerges as a simple and effective strategy for enhancing the performance of large language models (LLMs) in real-world reasoning tasks. Nonetheless, the efficacy of a singular, task-level prompt uniformly applied across the whole of instances is inherently limited since one prompt cannot be a good partner for all, a more appropriate approach should consider the interaction between the prompt and each instance meticulously. This work introduces an instance-adaptive prompting algorithm as an alternative zero-shot CoT reasoning scheme by adaptively differentiating good and bad prompts. Concretely, we first employ analysis on LLMs through the lens of information flow to detect the mechanism under zero-shot CoT reasoning, in which we discover that information flows from question to prompt and question to rationale jointly influence the reasoning results most. We notice that a better zero-shot CoT reasoning needs the prompt to obtain semantic information from the question then the rationale aggregates sufficient information from the question directly and via the prompt indirectly. On the contrary, lacking any of those would probably lead to a bad one. Stem from that, we further propose an instance-adaptive prompting strategy (IAP) for zero-shot CoT reasoning. Experiments conducted with LLaMA-2, LLaMA-3, and Qwen on math, logic, and commonsense reasoning tasks (e.g., GSM8K, MMLU, Causal Judgement) obtain consistent improvement, demonstrating that the instance-adaptive zero-shot CoT prompting performs better than other task-level methods with some curated prompts or sophisticated procedures, showing the significance of our findings in the zero-shot CoT reasoning mechanism.

cs.CL↗

Constructive agents nullify the ability of destructive agents to foster cooperation in public goods games

Existing studies have revealed a paradoxical phenomenon in public goods games, wherein destructive agents, harming both cooperators and defectors, can unexpectedly bolster cooperation. Building upon this intriguing premise, our paper introduces a novel concept: constructive agents, which confer additional benefits to both cooperators and defectors. We investigate the impact of these agents on cooperation dynamics within the framework of public goods games. Employing replicator dynamics, we find that unlike destructive agents, the mere presence of constructive agents does not significantly alter the defective equilibrium. However, when the benefits from constructive agents are outweighed by the damage inflicted by destructive agents, the addition of constructive agents does not affect the ability of destructive agents to sustain cooperation. In this scenario, cooperators can be maintained through a cyclic dominance between cooperators, defectors, and destructive agents, with constructive agents adding complexity but not fundamentally changing the equilibrium. Conversely, if the benefits from constructive agents surpass the harm caused by destructive agents, the presence of constructive agents nullifies the ability of destructive agents to foster cooperation. Our results highlight the nuanced role of constructive agents in cooperation dynamics, emphasizing the necessity of carefully assessing incentive balances when encouraging cooperation.

physics.soc-ph↗

From Redundancy to Relevance: Information Flow in LVLMs Across Reasoning Tasks

Large Vision Language Models (LVLMs) achieve great performance on visual-language reasoning tasks, however, the black-box nature of LVLMs hinders in-depth research on the reasoning mechanism. As all images need to be converted into image tokens to fit the input format of large language models (LLMs) along with natural language prompts, sequential visual representation is essential to the performance of LVLMs, and the information flow analysis approach can be an effective tool for determining interactions between these representations. In this paper, we propose integrating attention analysis with LLaVA-CAM, concretely, attention scores highlight relevant regions during forward propagation, while LLaVA-CAM captures gradient changes through backward propagation, revealing key image features. By exploring the information flow from the perspective of visual representation contribution, we observe that it tends to converge in shallow layers but diversify in deeper layers. To validate our analysis, we conduct comprehensive experiments with truncation strategies across various LVLMs for visual question answering and image captioning tasks, and experimental results not only verify our hypothesis but also reveal a consistent pattern of information flow convergence in the corresponding layers, and the information flow cliff layer will be different due to different contexts. The paper's source code can be accessed from \url{https://github.com/zhangbaijin/From-Redundancy-to-Relevance}

cs.CL↗

Best Practices for Fitting Machine Learning Interatomic Potentials for Molten Salts: A Case Study Using NaCl-MgCl2

In this work, we developed a compositionally transferable machine learning interatomic potential using atomic cluster expansion potential and PBE-D3 method for (NaCl)1-x(MgCl2)x molten salt and we showed that it is possible to fit a robust potential for this pseudo-binary system by only including data from x={0, 1/3, 2/3, 1}. We also assessed the performance of several DFT methods including PBE-D3, PBE-D4, R2SCAN-D4, and R2SCAN-rVV10 on unary NaCl and MgCl2 salts. Our results show that the R2SCAN-D4 method calculates the thermophysical properties of NaCl and MgCl2 with an overall modestly better accuracy compared to the other three methods.

cond-mat.mtrl-sci↗

Unbiased third-party bots lead to a tradeoff between cooperation and social payoffs

The rise of artificial intelligence (AI) offers new opportunities to influence cooperative dynamics with greater applicability and control. In this paper, we examine the impact of third-party bots--agents that do not directly participate in games but unbiasedly modify the payoffs of normal players engaged in prisoner's dilemma interactions--on the emergence of cooperation. Using an evolutionary simulation model, we demonstrate that unbiased bots are unable to shift the defective equilibrium among normal players in well-mixed populations. However, in structured populations, despite their unbiased actions, the bots spontaneously generate distinct impacts on cooperators and defectors, leading to enhanced cooperation. Notably, bots that apply negative influences are more effective at promoting cooperation than those applying positive ones, as fewer bots are needed to catalyze cooperative behavior among normal players. However, as the number of bots increases, a trade-off emerges: while cooperation is maintained, overall social payoffs decline. These findings highlight the need for careful management of AI's role in social systems, as even well-intentioned bots can have unintended consequences on collective outcomes.

physics.soc-ph↗

NEST-RQ: Next Token Prediction for Speech Self-Supervised Pre-Training

Speech self-supervised pre-training can effectively improve the performance of downstream tasks. However, previous self-supervised learning (SSL) methods for speech, such as HuBERT and BEST-RQ, focus on utilizing non-causal encoders with bidirectional context, and lack sufficient support for downstream streaming models. To address this issue, we introduce the next token prediction based speech pre-training method with random-projection quantizer (NEST-RQ). NEST-RQ employs causal encoders with only left context and uses next token prediction (NTP) as the training task. On the large-scale dataset, compared to BEST-RQ, the proposed NEST-RQ achieves comparable performance on non-streaming automatic speech recognition (ASR) and better performance on streaming ASR. We also conduct analytical experiments in terms of the future context size of streaming ASR, the codebook quality of SSL and the model size of the encoder. In summary, the paper demonstrates the feasibility of the NTP in speech SSL and provides empirical evidence and insights for speech SSL research.

eess.AS↗

An active filament on a cylindrical surface: morphologies and dynamics

Structure and dynamics of an active polymer on a smooth cylindrical surface are studied by Brownian dynamics simulations. The effect of active force on the polymer adsorption behavior and the combined effect of chain mobility, length N, rigidity \k{appa}, and cylinder radius, R, on phase diagrams are systemically investigated. We find that complete adsorption is replaced by irregular alternative adsorption/desorption process at a large driving force. Three typical (spiral, helix-like, rod-like) conformations of the active polymer are observed, dependent on N, \k{appa}, and R. Dynamically, the polymer shows rotational motion in spiral state, snake-like motion in the intermediate state, and straight translational motion without turning back in the rod-like state. In the spiral state, we find that rotation velocity ω and chain length follows a power-law relation ω~N^(-0.42), consistent with the torque-balance theory of general Archimedean spirals. And the polymer shows super-diffusive behavior along the cylinder at long time in the helix-like and rod-like states. Our results highlight the mobility, rigidity, as well as curvature of surface can be used to regulate the polymer behavior.

cond-mat.soft↗

Self-Learning Symmetric Multi-view Probabilistic Clustering

Multi-view Clustering (MVC) has achieved significant progress, with many efforts dedicated to learn knowledge from multiple views. However, most existing methods are either not applicable or require additional steps for incomplete MVC. Such a limitation results in poor-quality clustering performance and poor missing view adaptation. Besides, noise or outliers might significantly degrade the overall clustering performance, which are not handled well by most existing methods. In this paper, we propose a novel unified framework for incomplete and complete MVC named self-learning symmetric multi-view probabilistic clustering (SLS-MPC). SLS-MPC proposes a novel symmetric multi-view probability estimation and equivalently transforms multi-view pairwise posterior matching probability into composition of each view's individual distribution, which tolerates data missing and might extend to any number of views. Then, SLS-MPC proposes a novel self-learning probability function without any prior knowledge and hyper-parameters to learn each view's individual distribution. Next, graph-context-aware refinement with path propagation and co-neighbor propagation is used to refine pairwise probability, which alleviates the impact of noise and outliers. Finally, SLS-MPC proposes a probabilistic clustering algorithm to adjust clustering assignments by maximizing the joint probability iteratively without category information. Extensive experiments on multiple benchmarks show that SLS-MPC outperforms previous state-of-the-art methods.

cs.CV↗

Multi-Agent, Human-Agent and Beyond: A Survey on Cooperation in Social Dilemmas

The study of cooperation within social dilemmas has long been a fundamental topic across various disciplines, including computer science and social science. Recent advancements in Artificial Intelligence (AI) have significantly reshaped this field, offering fresh insights into understanding and enhancing cooperation. This survey examines three key areas at the intersection of AI and cooperation in social dilemmas. First, focusing on multi-agent cooperation, we review the intrinsic and external motivations that support cooperation among rational agents, and the methods employed to develop effective strategies against diverse opponents. Second, looking into human-agent cooperation, we discuss the current AI algorithms for cooperating with humans and the human biases towards AI agents. Third, we review the emergent field of leveraging AI agents to enhance cooperation among humans. We conclude by discussing future research avenues, such as using large language models, establishing unified theoretical frameworks, revisiting existing theories of human cooperation, and exploring multiple real-world applications.

cs.AI↗

Large-vocabulary forensic pathological analyses via prototypical cross-modal contrastive learning

Forensic pathology is critical in determining the cause and manner of death through post-mortem examinations, both macroscopic and microscopic. The field, however, grapples with issues such as outcome variability, laborious processes, and a scarcity of trained professionals. This paper presents SongCi, an innovative visual-language model (VLM) designed specifically for forensic pathology. SongCi utilizes advanced prototypical cross-modal self-supervised contrastive learning to enhance the accuracy, efficiency, and generalizability of forensic analyses. It was pre-trained and evaluated on a comprehensive multi-center dataset, which includes over 16 million high-resolution image patches, 2,228 vision-language pairs of post-mortem whole slide images (WSIs), and corresponding gross key findings, along with 471 distinct diagnostic outcomes. Our findings indicate that SongCi surpasses existing multi-modal AI models in many forensic pathology tasks, performs comparably to experienced forensic pathologists and significantly better than less experienced ones, and provides detailed multi-modal explainability, offering critical assistance in forensic investigations. To the best of our knowledge, SongCi is the first VLM specifically developed for forensic pathological analysis and the first large-vocabulary computational pathology (CPath) model that directly processes gigapixel WSIs in forensic science.

eess.IV↗