Searcharxiv⌕ Search

arXiv subjects

Xing Zhang

Publications and source records attributed to Xing Zhang.

At least 73 records · Page 4Linked to original sources

Exploring the design space of machine-learning models for quantum chemistry with a fully differentiable framework

Traditional atomistic machine learning (ML) models serve as surrogates for quantum mechanical (QM) properties, predicting quantities such as dipole moments and polarizabilities, directly from compositions and geometries of atomic configurations. With the emergence of ML approaches to predict the "ingredients" of a QM calculation, such as the ground state charge density or the effective single-particle Hamiltonian, it has become possible to obtain multiple properties through analytical physics-based operations on these intermediate ML predictions. We present a framework to seamlessly integrate the prediction of an effective electronic Hamiltonian, for both molecular and condensed-phase systems, with PySCFAD, a differentiable QM workflow that facilitates its indirect training against functions of the Hamiltonian, such as electronic energy levels, dipole moments, polarizability, etc. We then use this framework to explore various possible choices within the design space of hybrid ML/QM models, examining the influence of incorporating multiple targets on model performance and learning a reduced-basis ML Hamiltonian that can reproduce targets computed from a much larger basis. Our benchmarks evaluate the accuracy and transferability of these hybrid models, compare them against predictions of atomic properties from their surrogate models, and provide indications to guide the design of the interface between the ML and QM components of the model.

physics.chem-ph↗

Doing Less for More: Consumer Search and Undertreatment in Credence Service Markets

In many service markets, expert providers possess an information advantage over consumers regarding the necessary services, creating opportunities for fraudulent practices. These may involve overtreatment through unnecessary services or undertreatment with ineffective solutions that fail to address consumers' problems. When issues are resolved, consumers exit the market; when unresolved, they must decide whether to revisit the initial provider or seek a new one. Little is known about how repeated interactions and the consumer search process influence expert fraud and consumer welfare in such markets. We develop a dynamic game-theoretic model to examine the role of consumer search behavior and repeated interactions between consumers and service providers. We find that overtreatment and undertreatment can arise simultaneously in equilibrium. Interestingly, undertreatment-being less costly for the consumer-can initially act as a "hook" to induce acceptance of a minor treatment recommendation. When this minor treatment fails to resolve the issue, it can generate additional demand for a more expensive and serious treatment. This would arise when the cost of revisiting the initial provider is lower than that of searching for a new one. The extent of undertreatment exhibits a non-monotonic relationship with consumers' ex ante belief about the nature of their problems and the market's ethical level. Our results can shed light on how market ethical levels, provider capabilities and capacities, and consumer privacy protection policies interact with undertreatment and affect consumer welfare. Specifically, consumer welfare can decrease as the market becomes more ethical. Enhancing providers' diagnostic capabilities and capacities can exacerbate undertreatment. Providing access to consumers' diagnosis histories can help mitigate the undertreatment issue and improve consumer welfare.

econ.TH↗

MQADet: A Plug-and-Play Paradigm for Enhancing Open-Vocabulary Object Detection via Multimodal Question Answering

Open-vocabulary detection (OVD) is a challenging task to detect and classify objects from an unrestricted set of categories, including those unseen during training. Existing open-vocabulary detectors are limited by complex visual-textual misalignment and long-tailed category imbalances, leading to suboptimal performance in challenging scenarios. To address these limitations, we introduce MQADet, a universal paradigm for enhancing existing open-vocabulary detectors by leveraging the cross-modal reasoning capabilities of multimodal large language models (MLLMs). MQADet functions as a plug-and-play solution that integrates seamlessly with pre-trained object detectors without substantial additional training costs. Specifically, we design a novel three-stage Multimodal Question Answering (MQA) pipeline to guide the MLLMs to precisely localize complex textual and visual targets while effectively enhancing the focus of existing object detectors on relevant objects. To validate our approach, we present a new benchmark for evaluating our paradigm on four challenging open-vocabulary datasets, employing three state-of-the-art object detectors as baselines. Experimental results demonstrate that our proposed paradigm significantly improves the performance of existing detectors, particularly in unseen complex categories, across diverse and challenging scenarios. To facilitate future research, we will publicly release our code.

cs.CV↗

Circuit Transformer: A Transformer That Preserves Logical Equivalence

Implementing Boolean functions with circuits consisting of logic gates is fundamental in digital computer design. However, the implemented circuit must be exactly equivalent, which hinders generative neural approaches on this task due to their occasionally wrong predictions. In this study, we introduce a generative neural model, the "Circuit Transformer", which eliminates such wrong predictions and produces logic circuits strictly equivalent to given Boolean functions. The main idea is a carefully designed decoding mechanism that builds a circuit step-by-step by generating tokens, which has beneficial "cutoff properties" that block a candidate token once it invalidate equivalence. In such a way, the proposed model works similar to typical LLMs while logical equivalence is strictly preserved. A Markov decision process formulation is also proposed for optimizing certain objectives of circuits. Experimentally, we trained an 88-million-parameter Circuit Transformer to generate equivalent yet more compact forms of input circuits, outperforming existing neural approaches on both synthetic and real world benchmarks, without any violation of equivalence constraints.

cs.LG↗

Skeleton-Guided-Translation: A Benchmarking Framework for Code Repository Translation with Fine-Grained Quality Evaluation

The advancement of large language models has intensified the need to modernize enterprise applications and migrate legacy systems to secure, versatile languages. However, existing code translation benchmarks primarily focus on individual functions, overlooking the complexities involved in translating entire repositories, such as maintaining inter-module coherence and managing dependencies. While some recent repository-level translation benchmarks attempt to address these challenges, they still face limitations, including poor maintainability and overly coarse evaluation granularity, which make them less developer-friendly. We introduce Skeleton-Guided-Translation, a framework for repository-level Java to C# code translation with fine-grained quality evaluation. It uses a two-step process: first translating the repository's structural "skeletons", then translating the full repository guided by these skeletons. Building on this, we present TRANSREPO-BENCH, a benchmark of high quality open-source Java repositories and their corresponding C# skeletons, including matching unit tests and build configurations. Our unit tests are fixed and can be applied across multiple or incremental translations without manual adjustments, enhancing automation and scalability in evaluations. Additionally, we develop fine-grained evaluation metrics that assess translation quality at the individual test case level, addressing traditional binary metrics' inability to distinguish when build failures cause all tests to fail. Evaluations using TRANSREPO-BENCH highlight key challenges and advance more accurate repository level code translation.

cs.SE↗

Ab initio quantum many-body description of superconducting trends in the cuprates

Using a systematic ab initio quantum many-body approach that goes beyond low-energy models, we directly compute the superconducting pairing order and estimate the pairing gap of several doped cuprate materials and structures within a purely electronic picture. We find that we can correctly capture two well-known trends: the pressure effect, where the pairing order and gap increase with intra-layer pressure, and the layer effect, where the pairing order and gap vary with the number of copper-oxygen layers. From these calculations, we observe that the strength of superexchange and the covalency at optimal doping are the best descriptors for these trends. Our microscopic analysis further identifies that strong short-range spin fluctuations and multi-orbital charge fluctuations drive the development of the pairing order. Our work illustrates the possibility of a material-specific ab initio understanding of unconventional high-temperature superconducting materials.

cond-mat.supr-con↗

Contention-Aware Microservice Deployment in Collaborative Mobile Edge Networks

As an emerging computing paradigm, mobile edge computing (MEC) provides processing capabilities at the network edge, aiming to reduce latency and improve user experience. Meanwhile, the advancement of containerization technology facilitates the deployment of microservice-based applications via edge node collaboration, ensuring highly efficient service delivery. However, existing research overlooks the resource contention among microservices in MEC. This neglect potentially results in inadequate resources for microservices constituting latency-sensitive applications, leading to increased response time and ultimately compromising quality of service (QoS). To solve this problem, we propose the Contention-Aware Multi-Application Microservice Deployment (CAMD) algorithm for collaborative MEC, balancing rapid response for applications with low-latency requirements and overall processing efficiency. The CAMD algorithm decomposes the overall deployment problem into manageable sub-problems, each focusing on a single microservice, then employs a heuristic approach to optimize these sub-problems, and ultimately arrives at an optimized deployment scheme through an iterative process. Finally, the superiority of the proposed algorithm is evidenced through intensive experiments and comparison with baseline algorithms.

cs.NI↗

Thermodynamic bounce effect in quantum BTZ black hole

A novel thermodynamic phenomenon has been observed in the quantum Bañados-Teitelboim-Zanelli (qBTZ) black hole, utilizing generalized free energy and Kramer escape rate. This phenomenon also reveals the unique property of the quantum black hole. The stochastic thermal motion of various thermodynamic states within the black hole system induces phase transitions, under the influence of generalized free energy which obtained by extending Maxwell's construction. Through the analysis of Kramer escape rate, it is discovered that the qBTZ black hole thermodynamic system exhibits a bounce effect. It originates from the non-monotonicity of entropy in black hole thermodynamic systems. Furthermore, the overall thermodynamic picture of the qBTZ black hole has been obtained under different quantum backreactions.

gr-qc↗

Validity-Preserving Delta Debugging via Generator Trace Reduction

Reducing test inputs that trigger bugs is crucial for efficient debugging. Delta debugging is the most popular approach for this purpose. When test inputs need to conform to certain specifications, existing delta debugging practice encounters a validity problem: it blindly applies reduction rules, producing a large number of invalid test inputs that do not satisfy the required specifications. This overall diminishing effectiveness and efficiency becomes even more pronounced when the specifications extend beyond syntactical structures. Our key insight is that we should leverage input generators, which are aware of these specifications, to generate valid reduced inputs, rather than straightforwardly performing reduction on test inputs. In this paper, we propose a generator-based delta debugging method, namely GReduce, which derives validity-preserving reducers. Specifically, given a generator and its execution, demonstrating how the bug-inducing test input is generated, GReduce searches for other executions on the generator that yield reduced, valid test inputs. The evaluation results on five benchmarks (i.e., graphs, DL models, JavaScript programs, SymPy, and algebraic data types) show that GReduce substantially outperforms state-of-the-art syntax-based reducers including Perses and T-PDD, and also outperforms QuickCheck, SmartCheck, as well as the state-of-the-art choice-sequence-based reducer Hypothesis, demonstrating the effectiveness, efficiency, and versatility of GReduce.

cs.SE↗

Incentive-Driven Task Offloading and Collaborative Computing in Device-Assisted MEC Networks

Edge computing (EC), positioned near end devices, holds significant potential for delivering low-latency, energy-efficient, and secure services. This makes it a crucial component of the Internet of Things (IoT). However, the increasing number of IoT devices and emerging services place tremendous pressure on edge servers (ESs). To better handle dynamically arriving heterogeneous tasks, ESs and IoT devices with idle resources can collaborate in processing tasks. Considering the selfishness and heterogeneity of IoT devices and ESs, we propose an incentive-driven multi-level task allocation framework. Specifically, we categorize IoT devices into task IoT devices (TDs), which generate tasks, and auxiliary IoT devices (ADs), which have idle resources. We use a bargaining game to determine the initial offloading decision and the payment fee for each TD, as well as a double auction to incentivize ADs to participate in task processing. Additionally, we develop a priority-based inter-cell task scheduling algorithm to address the uneven distribution of user tasks across different cells. Finally, we theoretically analyze the performance of the proposed framework. Simulation results demonstrate that our proposed framework outperforms benchmark methods.

cs.GT↗

Efficient Implementation of the Random Phase Approximation with Domain-based Local Pair Natural Orbitals

We present an efficient implementation of the random phase approximation (RPA) for molecular systems within the domain-based local pair natural orbital (DLPNO) framework. With optimized parameters, DLPNO-RPA achieves approximately 99.9% accuracy in the total correlation energy compared to a canonical implementation, enabling highly accurate reaction energies and potential energy surfaces to be computed while substantially reducing computational costs. As an application, we demonstrate the capability of DLPNO-RPA to efficiently calculate basis set-converged binding energies for a set of large molecules, with results showing excellent agreement with high-level reference data from both coupled cluster and diffusion Monte Carlo. This development paves the way for the routine use of RPA-based methods in molecular quantum chemistry.

physics.chem-ph↗

Efficient Adaptation of Pre-trained Vision Transformer via Householder Transformation

A common strategy for Parameter-Efficient Fine-Tuning (PEFT) of pre-trained Vision Transformers (ViTs) involves adapting the model to downstream tasks by learning a low-rank adaptation matrix. This matrix is decomposed into a product of down-projection and up-projection matrices, with the bottleneck dimensionality being crucial for reducing the number of learnable parameters, as exemplified by prevalent methods like LoRA and Adapter. However, these low-rank strategies typically employ a fixed bottleneck dimensionality, which limits their flexibility in handling layer-wise variations. To address this limitation, we propose a novel PEFT approach inspired by Singular Value Decomposition (SVD) for representing the adaptation matrix. SVD decomposes a matrix into the product of a left unitary matrix, a diagonal matrix of scaling values, and a right unitary matrix. We utilize Householder transformations to construct orthogonal matrices that efficiently mimic the unitary matrices, requiring only a vector. The diagonal values are learned in a layer-wise manner, allowing them to flexibly capture the unique properties of each layer. This approach enables the generation of adaptation matrices with varying ranks across different layers, providing greater flexibility in adapting pre-trained models. Experiments on standard downstream vision tasks demonstrate that our method achieves promising fine-tuning performance.

cs.CV↗

One-Dimensional Ionic-Bonded Structures in NiSe Nanowire

One-dimensional van der Waals (1D vdW) materials, characterized by atomic chains bonded ionically or covalently in one direction and held together by van der Waals interactions in the perpendicular directions, have recently gained intensive attention due to their exceptional functions. In this work, we report the discovery of 1D ionic-bonded structures in NiSe nanowires. Utilizing aberration-corrected scanning transmission electron microscopy, we identified four distinct structural phases composed of two fundamental 1D building blocks: a triangle-shaped unit and a parallelogram-shaped unit. These phases can transform into one another through topotactic combinations of the structural units. Density functional theory calculations reveal that these structural units are bound by ionic bonds, unlike the van der Waals forces typically found in 1D vdW materials. The diverse arrangements of these building blocks may give rise to unique electronic structures and magnetic properties, paving the way for designing advanced materials with novel functionalities.

cond-mat.mes-hall↗

Fuse Your Latents: Video Editing with Multi-source Latent Diffusion Models

Latent Diffusion Models (LDMs) are renowned for their powerful capabilities in image and video synthesis. Yet, compared to text-to-image (T2I) editing, text-to-video (T2V) editing suffers from a lack of decent temporal consistency and structure, due to insufficient pre-training data, limited model editability, or extensive tuning costs. To address this gap, we propose FLDM (Fused Latent Diffusion Model), a training-free framework that achieves high-quality T2V editing by integrating various T2I and T2V LDMs. Specifically, FLDM utilizes a hyper-parameter with an update schedule to effectively fuse image and video latents during the denoising process. This paper is the first to reveal that T2I and T2V LDMs can complement each other in terms of structure and temporal consistency, ultimately generating high-quality videos. It is worth noting that FLDM can serve as a versatile plugin, applicable to off-the-shelf image and video LDMs, to significantly enhance the quality of video editing. Extensive quantitative and qualitative experiments on popular T2I and T2V LDMs demonstrate FLDM's superior editing quality than state-of-the-art T2V editing methods. Our project code is available at https://github.com/lutianyi0603/fuse_your_latents.

cs.CV↗

Symmetric Cayley graphs on non-abelian simple groups of valency 7

Let $Γ$ be a connected $7$-valent symmetric Cayley graph on a finite non-abelian simple group $G$. If $Γ$ is not normal, Li {\em et al.} [On 7-valent symmetric Cayley graphs of finite simple groups, J. Algebraic Combin. 56 (2022) 1097-1118] characterised the group pairs $(\mathrm{soc}(\mathrm{Aut}(Γ)/K),GK/K)$, where $K$ is a maximal intransitive normal subgroup of $\mathrm{Aut}(Γ)$. In this paper, we improve this result by proving that if $Γ$ is not normal, then $\mathrm{Aut}(Γ)$ contains an arc-transitive non-abelian simple normal subgroup $T$ such that $G<T$ and $(T,G)=(\mathrm{A}_{n},\mathrm{A}_{n-1})$ with $n=7$, $3\cdot 7$, $3^2\cdot 7$, $2^2\cdot 3\cdot 7$, $2^3\cdot3\cdot7$, $2^3\cdot3^2\cdot5\cdot7$, $2^4\cdot3^2\cdot5\cdot7$, $2^6\cdot3\cdot7$, $2^7\cdot3\cdot7$, $2^6\cdot3^2\cdot7$, $2^6\cdot3^4\cdot5^2\cdot7$, $2^8\cdot3^4\cdot5^2\cdot7$, $2^7\cdot3^4\cdot5^2\cdot7$, $2^{10}\cdot3^2\cdot7$, $2^{24}\cdot3^2\cdot7$. Furthermore, $\mathrm{soc}(\mathrm{Aut}(Γ)/R)=(T\times R)/R$, where $R$ is the largest solvable normal subgroup of $\mathrm{Aut}(Γ)$.

math.GR↗

Adaptive Multi-Layer Deployment for A Digital Twin Empowered Satellite-Terrestrial Integrated Network

With the development of satellite communication technology, satellite-terrestrial integrated networks (STIN), which integrate satellite networks and ground networks, can realize seamless global coverage of communication services. Confronting the intricacies of network dynamics, the diversity of resource heterogeneity, and the unpredictability of user mobility, dynamic resource allocation within networks faces formidable challenges. Digital twin (DT), as a new technique, can reflect a physical network to a virtual network to monitor, analyze, and optimize the physical network. Nevertheless, in the process of constructing the DT model, the deployment location and resource allocation of DTs may adversely affect its performance. Therefore, we propose a STIN model, which alleviates the problem of insufficient single-layer deployment flexibility of the traditional edge network by deploying DTs in multi-layer nodes in a STIN. To address the challenge of deploying DTs in the network, we propose multi-layer DT deployment in a STIN to reduce system delay. Then we adopt a multi-agent reinforcement learning (MARL) scheme to explore the optimal strategy of the DT multi-layer deployment problem. The implemented scheme demonstrates a notable reduction in system delay, as evidenced by simulation outcomes.

cs.NI↗

On isomorphisms of $m$-Cayley digraphs

The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In this paper, we consider this problem for $m$-Cayley digraphs which are generalization of Cayley digraphs. Let $m$ be a positive integer. A digraph admitting a group $G$ of automorphisms acting semiregularly on the vertices with exactly $m$ orbits is called an $m$-Cayley digraph of $G$. In particular, $1$-Cayley digraph is just the Cayley digraph. We first characterize the normalizer of $G$ in the full automorphism group of an $m$-Cayley digraph of a finite group $G$. This generalizes a similar result for Cayley digraph achieved by Godsil in 1981. Then we use this to study the isomorphisms of $m$-Cayley digraphs. The CI-property of a Cayley digraph (CI stands for `Cayley isomorphism') and the DCI-groups (whose Cayley digraphs are all CI-digraphs) are two key topics in the study of isomorphisms of Cayley digraphs. We generalize these concepts into $m$-Cayley digraphs by defining $m$CI- and $m$PCI-digraphs, and correspondingly, $m$DCI- and $m$PDCI-groups. Analogues to Babai's criterion for CI-digraphs are given for $m$CI- and $m$PCI-digraphs, respectively. With these we then classify finite $m$DCI-groups for each $m\geq 2$, and finite $m$PDCI-groups for each $m\geq 4$. Similar results are also obtained for $m$-Cayley graphs. Note that 1DCI-groups are just DCI-groups, and the classification of finite DCI-groups is a long-standing open problem that has been worked on a lot.

math.CO↗

General Quantum Alchemical Free Energy Simulations via Hamiltonian Interpolation

We present an implementation of alchemical free energy simulations at the quantum mechanical level by directly interpolating the electronic Hamiltonian. The method is compatible with any level of electronic structure theory and requires only one quantum calculation for each molecular dynamics step in contrast to multiple energy evaluations that would be needed when interpolating the ground-state energies. We demonstrate the correctness and applicability of the technique by computing alchemical free energy changes of gas-phase molecules, with both nuclear and electron creation/annihilation. We also show an initial application to first-principles pKa calculation for solvated molecules where we quantum mechanically annihilate a bonded proton.

physics.chem-ph↗