SearcharxivSearch

arXiv subjects

Lina Wang

Publications and source records attributed to Lina Wang.

At least 19 recordsLinked to original sources

DPDL: Towards Differential Privacy Preservation in Decentralized Stochastic Learning on Non-IID Data

In the paradigm of decentralized learning, a group of agents collaborate to train a global model using distributed datasets without a central server. Although the power of collaboration has been verified by many state-of-the-art studies, it entails extensive gradient information exchanging among the agents and thus induces high risk of privacy leakage for the individual agents. Moreover, in real-world applications, the training data are usually non-identically and independently distributed across the agents, inducing more challenges to enable privacy-preserved decentralized learning. To address these issues, we propose a privacy-preserved decentralized learning algorithm with non-IID data, DPDL, which leverages the notion of Differential Privacy (DP) in cross-gradient aggregation through a similarity-based calibration technique. Specifically, in each round, each agent perturbs the cross-gradients (i.e., the derivatives of its neighbors' local model in its private local data) by Gaussian noise mechanism before sharing them with its neighbors; it then adopt cosine similarity to calibrate the received perturbed cross-gradients such that the aggregation of the calibrated cross-gradients can be utilized to effectively update local model in a momentum-like manner. Our rigorous theoretical analysis not only reveals the minimum noise level required to achieve a specific level of privacy preservation, but also illustrates that our algorithm still achieves a linear speedup in training with non-IID data. We finally conduct extensive experiments on real-world dataset to validate the effectiveness of our algorithm in defending privacy attacks and in training accurate models.

cs.LG

A novel class of high-order uniformly accurate exponential integrators with local linear extension for the charged-particle dynamics under strong magnetic field

In this paper, we develop a novel class of high-order uniformly accurate exponential integrators for charged-particle dynamics under a strong magnetic field. The small parameter $0<\varepsilon\ll 1$ induces rapid temporal oscillations, rendering traditional numerical methods prohibitively expensive due to severe step-size restrictions. To address this issue, a linearization technology that introduces auxiliary polynomial variables is employed to recast the original charged-particle dynamics as a higher-dimensional system. Classical exponential integrators are subsequently applied to this augmented formulation, which inherently carries richer structural information, thereby yielding a family of uniformly accurate exponential integrators that can reach arbitrarily high order without requiring any order conditions. For the maximal ordering scaling strong magnetic field, we rigorously demonstrate via algebraic techniques that the proposed schemes with auxiliary polynomial variables of degree $k(k\geq 2)$ achieve an $\mathcal{O}(\varepsilon h^{k+1})$ improved error estimate for the position and a uniform $\mathcal{O}(h^{k+1})$ error estimate for the velocity. Numerical experiments validate the advantages of the methods. The theoretical and numerical in vestigation is finally extended to relativistic charged-particle dynamics in a four-dimensional framework with maximal ordering scaling strong magnetic field.

math.NA

Mos-Gen: A Generative Molecular Framework for Mosquito Insecticide Design

Mosquito-borne infectious diseases cause more than 700000 deaths worldwide each year. The long-term use of conventional chemical insecticides has induced serious resistance problems, creating an urgent need to develop novel, highly effective, and ecologically sustainable alternatives. While existing artificial intelligence approaches in this domain have focused primarily on activity prediction and classification, they leave a critical gap in the de~novo generation of novel molecular scaffolds. In this study, we propose Mos-Gen, a motif-aware generative collaborative framework that couples the pretrained molecular representation model Uni-Mol with a variational autoencoder (VAE), specifically tailored for the design of disulfide-containing allicin derivatives as mosquito insecticides. Among the generated candidates, fourteen compounds -- comprising nine predicted positives and five predicted negatives -- were selected for chemical synthesis and experimental validation. The hit rate among the predicted positives reached 78%, whereas none of the predicted negatives exhibited mosquitocidal activity. These experimental results fully validated the high-precision screening capability of the Mos-Gen framework.

cs.LG

Solve Crude Oil Scheduling Problems by Using Quantum-Classical Hybrid Algorithms

The optimization of front-end crude oil scheduling is a critical determinant of refinery profitability and operational stability. However, the coupling of discrete logistics events (e.g., vessel berthing) with continuous material flows (e.g., pipeline transfers) renders this problem an NP-hard Mixed-Integer Linear Programming (MILP) challenge, often intractable for classical solvers at industrial scales. This study proposes a novel hybrid quantum-classical framework to address these computational bottlenecks. We employ Benders Decomposition to decouple the monolithic model into a discrete Master Problem (MP) and a continuous Subproblem (SP). To exploit the search capabilities of quantum computing, the MP is reformulated as a Quadratic Unconstrained Binary Optimization (QUBO) model and solved via a hybrid quantum solver, while the SP enforces mass balance and quality constraints through iterative optimality and feasibility cuts. Extensive experiments on 15 multi-scale instances demonstrate that the proposed framework significantly outperforms traditional metaheuristics (e.g., Genetic Algorithms, Tabu Search), reducing total operating costs by approximately 73--80% and achieving computational speeds comparable to state-of-the-art commercial solvers (Gurobi). By effectively leveraging global optimality cuts, the method overcomes the tendency of heuristic approaches to trap in local optima, providing a robust and scalable solution for complex refinery logistics.

quant-ph

Explicit relaxation Particle-in-Cell methods for Vlasov-Poisson equations with a strong magnetic field

In this work, we present a novel family of explicit relaxation Particle-in-Cell (ER-PIC) methods for the Vlasov-Poisson equation with a strong magnetic field. These schemes achieve exact energy conservation by combining a splitting framework with the dynamic updating of a relaxation parameter at each time step. Using an averaging technique, we rigorously establish second-order error bounds for the Strang-type ER-PIC method and uniform first order accuracy in position for the Lie-Trotter ER-PIC scheme. Numerical experiments across the fluid, finite Larmor radius, and diffusion regimes confirm the accuracy and energy conservation of our methods.

math.NA

ROSS: RObust decentralized Stochastic learning based on Shapley values

In the paradigm of decentralized learning, a group of agents collaborate to learn a global model using a distributed dataset without a central server; nevertheless, it is severely challenged by the heterogeneity of the data distribution across the agents. For example, the data may be distributed non-independently and identically, and even be noised or poisoned. To address these data challenges, we propose ROSS, a novel robust decentralized stochastic learning algorithm based on Shapley values, in this paper. Specifically, in each round, each agent aggregates the cross-gradient information from its neighbors, i.e., the derivatives of its local model with respect to the datasets of its neighbors, to update its local model in a momentum like manner, while we innovate in weighting the derivatives according to their contributions measured by Shapley values. We perform solid theoretical analysis to reveal the linear convergence speedup of our ROSS algorithm. We also verify the efficacy of our algorithm through extensive experiments on public datasets. Our results demonstrate that, in face of the above variety of data challenges, our ROSS algorithm has significant advantages over existing state-of-the-art proposals in terms of both convergence and prediction accuracy.

cs.LG

MacPrompt: Maraconic-guided Jailbreak against Text-to-Image Models

Text-to-image (T2I) models have raised increasing safety concerns due to their capacity to generate NSFW and other banned objects. To mitigate these risks, safety filters and concept removal techniques have been introduced to block inappropriate prompts or erase sensitive concepts from the models. However, all the existing defense methods are not well prepared to handle diverse adversarial prompts. In this work, we introduce MacPrompt, a novel black-box and cross-lingual attack that reveals previously overlooked vulnerabilities in T2I safety mechanisms. Unlike existing attacks that rely on synonym substitution or prompt obfuscation, MacPrompt constructs macaronic adversarial prompts by performing cross-lingual character-level recombination of harmful terms, enabling fine-grained control over both semantics and appearance. By leveraging this design, MacPrompt crafts prompts with high semantic similarity to the original harmful inputs (up to 0.96) while bypassing major safety filters (up to 100%). More critically, it achieves attack success rates as high as 92% for sex-related content and 90% for violence, effectively breaking even state-of-the-art concept removal defenses. These results underscore the pressing need to reassess the robustness of existing T2I safety mechanisms against linguistically diverse and fine-grained adversarial strategies.

cs.CR

Co-TAP: Three-Layer Agent Interaction Protocol Technical Report

This paper proposes Co-TAP (T: Triple, A: Agent, P: Protocol), a three-layer agent interaction protocol designed to address the challenges faced by multi-agent systems across the three core dimensions of Interoperability, Interaction and Collaboration, and Knowledge Sharing. We have designed and proposed a layered solution composed of three core protocols: the Human-Agent Interaction Protocol (HAI), the Unified Agent Protocol (UAP), and the Memory-Extraction-Knowledge Protocol (MEK). HAI focuses on the interaction layer, standardizing the flow of information between users, interfaces, and agents by defining a standardized, event-driven communication paradigm. This ensures the real-time performance, reliability, and synergy of interactions. As the core of the infrastructure layer, UAP is designed to break down communication barriers among heterogeneous agents through unified service discovery and protocol conversion mechanisms, thereby enabling seamless interconnection and interoperability of the underlying network. MEK, in turn, operates at the cognitive layer. By establishing a standardized ''Memory (M) - Extraction (E) - Knowledge (K)'' cognitive chain, it empowers agents with the ability to learn from individual experiences and form shareable knowledge, thereby laying the foundation for the realization of true collective intelligence. We believe this protocol framework will provide a solid engineering foundation and theoretical guidance for building the next generation of efficient, scalable, and intelligent multi-agent applications.

cs.AI

Towards Action Hijacking of Large Language Model-based Agent

Recently, applications powered by Large Language Models (LLMs) have made significant strides in tackling complex tasks. By harnessing the advanced reasoning capabilities and extensive knowledge embedded in LLMs, these applications can generate detailed action plans that are subsequently executed by external tools. Furthermore, the integration of retrieval-augmented generation (RAG) enhances performance by incorporating up-to-date, domain-specific knowledge into the planning and execution processes. This approach has seen widespread adoption across various sectors, including healthcare, finance, and software development. Meanwhile, there are also growing concerns regarding the security of LLM-based applications. Researchers have disclosed various attacks, represented by jailbreak and prompt injection, to hijack the output actions of these applications. Existing attacks mainly focus on crafting semantically harmful prompts, and their validity could diminish when security filters are employed. In this paper, we introduce AI$\mathbf{^2}$, a novel attack to manipulate the action plans of LLM-based applications. Different from existing solutions, the innovation of AI$\mathbf{^2}$ lies in leveraging the knowledge from the application's database to facilitate the construction of malicious but semantically-harmless prompts. To this end, it first collects action-aware knowledge from the victim application. Based on such knowledge, the attacker can generate misleading input, which can mislead the LLM to generate harmful action plans, while bypassing possible detection mechanisms easily. Our evaluations on three real-world applications demonstrate the effectiveness of AI$\mathbf{^2}$: it achieves an average attack success rate of 84.30\% with the best of 99.70\%. Besides, it gets an average bypass rate of 92.7\% against common safety filters and 59.45\% against dedicated defense.

cs.CR

Dynamic Shock Recovery in IO Networks with Priority Constraints

Physical risks, such as droughts, floods, rising temperatures, earthquakes, infrastructure failures, and geopolitical conflicts, can ripple through global supply chains, raising costs, and constraining production across industries. Assessing these risks requires understanding not only their immediate effects, but also their cascading impacts. For example, a localized drought can disrupt the supply of critical raw materials such as cobalt or copper, affecting battery and electric vehicle production. Similarly, regional conflicts can impede cross-border trade, leading to broader economic consequences. Building on an existing model of simultaneous supply and demand shocks, we introduce a new propagation algorithm, Priority with Constraint, which modifies standard priority-based rationing by incorporating a minimum supply guarantee for all customers, regardless of their size or priority ranking. We also identify a buffer effect inherent in the Industry Proportional algorithm, which reflects real-world economic resilience. Finally, we extend the static shock propagation model to incorporate dynamic processes. We introduce mechanisms for gradual shock propagation, reflecting demand stickiness and the potential buffering role of inventories, and gradual recovery, modeling the simultaneous recovery of supply capacity and the inherent tendency for demand to return to pre-shock levels. Simulations demonstrate how the interplay between demand adjustment speed and supply recovery speed significantly influences the severity and duration of the economic impact after a shock.

physics.soc-ph

PATFinger: Prompt-Adapted Transferable Fingerprinting against Unauthorized Multimodal Dataset Usage

The multimodal datasets can be leveraged to pre-train large-scale vision-language models by providing cross-modal semantics. Current endeavors for determining the usage of datasets mainly focus on single-modal dataset ownership verification through intrusive methods and non-intrusive techniques, while cross-modal approaches remain under-explored. Intrusive methods can adapt to multimodal datasets but degrade model accuracy, while non-intrusive methods rely on label-driven decision boundaries that fail to guarantee stable behaviors for verification. To address these issues, we propose a novel prompt-adapted transferable fingerprinting scheme from a training-free perspective, called PATFinger, which incorporates the global optimal perturbation (GOP) and the adaptive prompts to capture dataset-specific distribution characteristics. Our scheme utilizes inherent dataset attributes as fingerprints instead of compelling the model to learn triggers. The GOP is derived from the sample distribution to maximize embedding drifts between different modalities. Subsequently, our PATFinger re-aligns the adaptive prompt with GOP samples to capture the cross-modal interactions on the carefully crafted surrogate model. This allows the dataset owner to check the usage of datasets by observing specific prediction behaviors linked to the PATFinger during retrieval queries. Extensive experiments demonstrate the effectiveness of our scheme against unauthorized multimodal dataset usage on various cross-modal retrieval architectures by 30% over state-of-the-art baselines.

cs.IR

PDSL: Privacy-Preserved Decentralized Stochastic Learning with Heterogeneous Data Distribution

In the paradigm of decentralized learning, a group of agents collaborates to learn a global model using distributed datasets without a central server. However, due to the heterogeneity of the local data across the different agents, learning a robust global model is rather challenging. Moreover, the collaboration of the agents relies on their gradient information exchange, which poses a risk of privacy leakage. In this paper, to address these issues, we propose PDSL, a novel privacy-preserved decentralized stochastic learning algorithm with heterogeneous data distribution. On one hand, we innovate in utilizing the notion of Shapley values such that each agent can precisely measure the contributions of its heterogeneous neighbors to the global learning goal; on the other hand, we leverage the notion of differential privacy to prevent each agent from suffering privacy leakage when it contributes gradient information to its neighbors. We conduct both solid theoretical analysis and extensive experiments to demonstrate the efficacy of our PDSL algorithm in terms of privacy preservation and convergence.

cs.LG

Fourth-order uniformly accurate integrators with long time near conservations for the nonlinear Dirac equation in the nonrelativistic regime

In this paper, we propose two novel fourth-order integrators that exhibit uniformly high accuracy and long-term near conservations for solving the nonlinear Dirac equation (NLDE) in the nonrelativistic regime. In this regime, the solution of the NLDE exhibits highly oscillatory behavior in time, characterized by a wavelength of O($\varepsilon^{2}$) with a small parameter $\varepsilon>0$. To ensure uniform temporal accuracy, we employ a two-scale approach in conjunction with exponential integrators, utilizing operator decomposition techniques for the NLDE. The proposed methods are rigorously proved to achieve fourth-order uniform accuracy in time for all $\varepsilon\in (0,1]$. Furthermore, we successfully incorporate symmetry into the integrator, and the long-term near conservation properties are analyzed through the modulated Fourier expansion. The proposed schemes are readily extendable to linear Dirac equations incorporating magnetic potentials, the dynamics of traveling wave solutions and the two/three-dimensional Dirac equations. The validity of all theoretical ndings and extensions is numerically substantiated through a series of numerical experiments.

math.NA

Transfer Learning of Real Image Features with Soft Contrastive Loss for Fake Image Detection

In the last few years, the artifact patterns in fake images synthesized by different generative models have been inconsistent, leading to the failure of previous research that relied on spotting subtle differences between real and fake. In our preliminary experiments, we find that the artifacts in fake images always change with the development of the generative model, while natural images exhibit stable statistical properties. In this paper, we employ natural traces shared only by real images as an additional target for a classifier. Specifically, we introduce a self-supervised feature mapping process for natural trace extraction and develop a transfer learning based on soft contrastive loss to bring them closer to real images and further away from fake ones. This motivates the detector to make decisions based on the proximity of images to the natural traces. To conduct a comprehensive experiment, we built a high-quality and diverse dataset that includes generative models comprising GANs and diffusion models, to evaluate the effectiveness in generalizing unknown forgery techniques and robustness in surviving different transformations. Experimental results show that our proposed method gives 96.2% mAP significantly outperforms the baselines. Extensive experiments conducted on popular commercial platforms reveal that our proposed method achieves an accuracy exceeding 78.4%, underscoring its practicality for real-world application deployment.

cs.CV

Exploration of Zeolites as High-Performance Electrode Protective Layers for Alkali-Metal Batteries

The electrode-electrolyte interfaces play pivotal roles in alkali-metal batteries, necessitating superior electrochemical stability, excellent electrical insulation, and high ionic conductivity. This study proposes using zeolites as interfacial protective layers owing to their inherently high stability with both alkali metals and high-voltage cathodes, as well as exceptionally wide bandgaps that minimize electron transport. To further pinpoint zeolites with rapid ionic diffusivity among their versatile structures, we devise a universal approach to explore diffusion dynamics in arbitrary structures. Through first-principles calculations, we identify the diffusion networks of Li+, Na+, and K+ in twenty-two, seventeen, and four zeolites, respectively. Eventually, we predict five, seven, and three zeolites as suitable interfacial protective layer for lithium-, sodium-, and potassium-metal batteries, respectively, each characterized by a diffusion barrier below 0.3 eV. This research automates the exploration of diffusion dynamics in complex materials and underscores the significant potential of zeolites as interfacial protective layers in alkali-metal batteries.

cond-mat.mtrl-sci

Stabilizing Single-Atom Catalysts on Metastable Phases of Transition Metal Dichalcogenides

Single-atom catalysts have attracted significant attention due to their exceptional atomic utilization and high efficiency in a range of catalytic reactions. However, these systems often face thermodynamic instability, leading to agglomeration under operational conditions. In this study, we investigate the interactions of twelve types of catalytic atoms (Fe, Co, Ni, Cu, Ru, Rh, Pd, Ag, Ir, Pt, Au, and Bi) on three crystalline phases (1T, 1T', and 2H) of six transition metal dichalcogenide layers (MoS2, MoSe2, MoTe2, WS2, WSe2, and WTe2) based on first-principles calculations. We ultimately identify 82 stable single-atom systems that thermodynamically prevent the formation of metal clusters on these substrates. Notably, our findings reveal that the metastable 1T and 1T' phases significantly enhance the binding strength with single atoms and promote their thermodynamic stability. This research offers valuable insights into the design of stable single-atom systems and paves the way for discovering innovative catalysts in the future.

cond-mat.mtrl-sci

PDSR: A Privacy-Preserving Diversified Service Recommendation Method on Distributed Data

The last decade has witnessed a tremendous growth of service computing, while efficient service recommendation methods are desired to recommend high-quality services to users. It is well known that collaborative filtering is one of the most popular methods for service recommendation based on QoS, and many existing proposals focus on improving recommendation accuracy, i.e., recommending high-quality redundant services. Nevertheless, users may have different requirements on QoS, and hence diversified recommendation has been attracting increasing attention in recent years to fulfill users' diverse demands and to explore potential services. Unfortunately, the recommendation performances relies on a large volume of data (e.g., QoS data), whereas the data may be distributed across multiple platforms. Therefore, to enable data sharing across the different platforms for diversified service recommendation, we propose a Privacy-preserving Diversified Service Recommendation (PDSR) method. Specifically, we innovate in leveraging the Locality-Sensitive Hashing (LSH) mechanism such that privacy-preserved data sharing across different platforms is enabled to construct a service similarity graph. Based on the similarity graph, we propose a novel accuracy-diversity metric and design a $2$-approximation algorithm to select $K$ services to recommend by maximizing the accuracy-diversity measure. Extensive experiments on real datasets are conducted to verify the efficacy of our PDSR method.

cs.IR

KGPA: Robustness Evaluation for Large Language Models via Cross-Domain Knowledge Graphs

Existing frameworks for assessing robustness of large language models (LLMs) overly depend on specific benchmarks, increasing costs and failing to evaluate performance of LLMs in professional domains due to dataset limitations. This paper proposes a framework that systematically evaluates the robustness of LLMs under adversarial attack scenarios by leveraging knowledge graphs (KGs). Our framework generates original prompts from the triplets of knowledge graphs and creates adversarial prompts by poisoning, assessing the robustness of LLMs through the results of these adversarial attacks. We systematically evaluate the effectiveness of this framework and its modules. Experiments show that adversarial robustness of the ChatGPT family ranks as GPT-4-turbo > GPT-4o > GPT-3.5-turbo, and the robustness of large language models is influenced by the professional domains in which they operate.

cs.CL