arXiv subjects

Peng Liu

Publications and source records attributed to Peng Liu.

At least 145 records · Page 8Linked to original sources

arXiv2025

An accelerated semi-proximal ADMM with applications to multi-block sparse optimization problems

As an extension of the alternating direction method of multipliers (ADMM), the semi-proximal ADMM (sPADMM) has been widely used in various fields due to its flexibility and robustness. In this paper, we first show that the two-block sPADMM algorithm can achieve an $O(1/\sqrt{K})$ non-ergodic convergence rate. Then we propose an accelerated sPADMM (AsPADMM) algorithm by introducing extrapolation techniques and incrementing penalty parameters. The proposed AsPADMM algorithm is proven to converge globally to an optimal solution with a non-ergodic convergence rate of $O(1/K)$. Furthermore, the AsPADMM can be extended and combined with the symmetric Gauss-Seidel decomposition to achieve an accelerated ADMM for multi-block problems. Finally, we apply the proposed AsPADMM to solving the multi-block subproblems in difference-of-convex algorithms for robust low-rank tensor completion problems and mixed sparse optimization problems. The numerical results suggest that the acceleration techniques bring about a notable improvement in the convergence speed.

math.OC↗

arXiv2025

LLM-BSCVM: An LLM-Based Blockchain Smart Contract Vulnerability Management Framework

Smart contracts are a key component of the Web 3.0 ecosystem, widely applied in blockchain services and decentralized applications. However, the automated execution feature of smart contracts makes them vulnerable to potential attacks due to inherent flaws, which can lead to severe security risks and financial losses, even threatening the integrity of the entire decentralized finance system. Currently, research on smart contract vulnerabilities has evolved from traditional program analysis methods to deep learning techniques, with the gradual introduction of Large Language Models. However, existing studies mainly focus on vulnerability detection, lacking systematic cause analysis and Vulnerability Repair. To address this gap, we propose LLM-BSCVM, a Large Language Model-based smart contract vulnerability management framework, designed to provide end-to-end vulnerability detection, analysis, repair, and evaluation capabilities for Web 3.0 ecosystem. LLM-BSCVM combines retrieval-augmented generation technology and multi-agent collaboration, introducing a three-stage method of Decompose-Retrieve-Generate. This approach enables smart contract vulnerability management through the collaborative efforts of six intelligent agents, specifically: vulnerability detection, cause analysis, repair suggestion generation, risk assessment, vulnerability repair, and patch evaluation. Experimental results demonstrate that LLM-BSCVM achieves a vulnerability detection accuracy and F1 score exceeding 91\% on benchmark datasets, comparable to the performance of state-of-the-art (SOTA) methods, while reducing the false positive rate from 7.2\% in SOTA methods to 5.1\%, thus enhancing the reliability of vulnerability management. Furthermore, LLM-BSCVM supports continuous security monitoring and governance of smart contracts through a knowledge base hot-swapping dynamic update mechanism.

cs.CR↗

arXiv2025

Mamba-MOC: A Multicategory Remote Object Counting via State Space Model

Multicategory remote object counting is a fundamental task in computer vision, aimed at accurately estimating the number of objects of various categories in remote images. Existing methods rely on CNNs and Transformers, but CNNs struggle to capture global dependencies, and Transformers are computationally expensive, which limits their effectiveness in remote applications. Recently, Mamba has emerged as a promising solution in the field of computer vision, offering a linear complexity for modeling global dependencies. To this end, we propose Mamba-MOC, a mamba-based network designed for multi-category remote object counting, which represents the first application of Mamba to remote sensing object counting. Specifically, we propose a cross-scale interaction module to facilitate the deep integration of hierarchical features. Then we design a context state space model to capture both global and local contextual information and provide local neighborhood information during the scan process. Experimental results in large-scale realistic scenarios demonstrate that our proposed method achieves state-of-the-art performance compared with some mainstream counting algorithms.

cs.CV↗

arXiv2025

Bridging Theory and Experiment in Materials Discovery: Machine-Learning-Assisted Prediction of Synthesizable Structures

Even though thermodynamic energy-based crystal structure prediction (CSP) has revolutionized materials discovery, the energy-driven CSP approaches often struggle to identify experimentally realizable metastable materials synthesized through kinetically controlled pathways, creating a critical gap between theoretical predictions and experimental synthesis. Here, we propose a synthesizability-driven CSP framework that integrates symmetry-guided structure derivation with a Wyckoff encode-based machine-learning model, allowing for the efficient localization of subspaces likely to yield highly synthesizable structures. Within the identified promising subspaces, a structure-based synthesizability evaluation model, fine-tuned using recently synthesized structures to enhance predictive accuracy, is employed in conjunction with ab initio calculations to systematically identify synthesizable candidates. The framework successfully reproduces 13 experimentally known XSe (X = Sc, Ti, Mn, Fe, Ni, Cu, Zn) structures, demonstrating its effectiveness in predicting synthesizable structures. Notably, 92,310 structures are filtered from the 554,054 candidates predicted by GNoME, exhibiting great potential for promising synthesizability. Additionally, eight thermodynamically favorable Hf-X-O (X = Ti, V, and Mn) structures have been identified, among which three HfV$_2$O$_7$ candidates exhibit high synthesizability, presenting viable candidates for experimental realization and potentially associated with experimentally observed temperature-induced phase transitions. This work establishes a data-driven paradigm for machine-learning-assisted inorganic materials synthesis, highlighting its potential to bridge the gap between computational predictions and experimental realization while unlocking new opportunities for the targeted discovery of novel functional materials.

cond-mat.mtrl-sci↗

arXiv2025

A universal scaling law for active diffusion in complex media

Using granular experiments and computer simulations, we investigate the long-time diffusion of active tracers in a broad class of complex media composed of frozen obstacles of diverse structures. By introducing a dimensionless persistence length $Q = v_d τ_r / d_t$, we propose a modified scaling relation that independently collapses experimental and simulation results across active and passive particles, diverse media, and distinct propulsion mechanisms. Our results reveal a universal active diffusion-structure relation that holds across both equilibrium and nonequilibrium regimes, providing a simple predictive framework for active diffusion in complex environments.

cond-mat.soft↗

arXiv2025

Towards Intelligent Edge Sensing for ISCC Network: Joint Multi-Tier DNN Partitioning and Beamforming Design

The combination of Integrated Sensing and Communication (ISAC) and Mobile Edge Computing (MEC) enables devices to simultaneously sense the environment and offload data to the base stations (BS) for intelligent processing, thereby reducing local computational burdens. However, transmitting raw sensing data from ISAC devices to the BS often incurs substantial fronthaul overhead and latency. This paper investigates a three-tier collaborative inference framework enabled by Integrated Sensing, Communication, and Computing (ISCC), where cloud servers, MEC servers, and ISAC devices cooperatively execute different segments of a pre-trained deep neural network (DNN) for intelligent sensing. By offloading intermediate DNN features, the proposed framework can significantly reduce fronthaul transmission load. Furthermore, multiple-input multiple-output (MIMO) technology is employed to enhance both sensing quality and offloading efficiency. To minimize the overall sensing task inference latency across all ISAC devices, we jointly optimize the DNN partitioning strategy, ISAC beamforming, and computational resource allocation at the MEC servers and devices, subject to sensing beampattern constraints. We also propose an efficient two-layer optimization algorithm. In the inner layer, we derive closed-form solutions for computational resource allocation using the Karush-Kuhn-Tucker conditions. Moreover, we design the ISAC beamforming vectors via an iterative method based on the majorization-minimization and weighted minimum mean square error techniques. In the outer layer, we develop a cross-entropy based probabilistic learning algorithm to determine an optimal DNN partitioning strategy. Simulation results demonstrate that the proposed framework substantially outperforms existing two-tier schemes in inference latency.

eess.SP↗

arXiv2025

Efficient and wavelength-tunable second-harmonic generation towards the green gap

Achieving compact and efficient visible laser sources is crucial for a wide range of applications. However traditional semiconductor laser technology faces difficulties in producing high-brightness green light, leaving a green gap in wavelength coverage. Second-harmonic generation (SHG) offers a promising alternative by converting near-infrared sources to visible wavelengths with high efficiency and spectral purity. Here, we demonstrate efficient and tunable SHG within the green spectrum using a high-Q Si3N4 microresonator. A space-charge grating induced by the photogalvanic effect realizes reconfigurable grating numbers and flexible wavelength tuning. Additionally, grating formation dynamics and competition is observed. These findings underscore the potential of silicon nitride as a robust, integrative platform for on-chip, tunable green light sources.

physics.optics↗

arXiv2025

DR.FIX: Automatically Fixing Data Races at Industry Scale

Data races are a prevalent class of concurrency bugs in shared-memory parallel programs, posing significant challenges to software reliability and reproducibility. While there is an extensive body of research on detecting data races and a wealth of practical detection tools across various programming languages, considerably less effort has been directed toward automatically fixing data races at an industrial scale. In large codebases, data races are continuously introduced and exhibit myriad patterns, making automated fixing particularly challenging. In this paper, we tackle the problem of automatically fixing data races at an industrial scale. We present Dr.Fix, a tool that combines large language models (LLMs) with program analysis to generate fixes for data races in real-world settings, effectively addressing a broad spectrum of racy patterns in complex code contexts. Implemented for Go--the programming language widely used in modern microservice architectures where concurrency is pervasive and data races are common--Dr.Fix seamlessly integrates into existing development workflows. We detail the design of Dr.Fix and examine how individual design choices influence the quality of the fixes produced. Over the past 18 months, Dr.Fix has been integrated into developer workflows at Uber demonstrating its practical utility. During this period, Dr.Fix produced patches for 224 (55%) from a corpus of 404 data races spanning various categories; 193 of these patches (86%) were accepted by more than a hundred developers via code reviews and integrated into the codebase.

cs.DC↗

arXiv2025

VLM-R1: A Stable and Generalizable R1-style Large Vision-Language Model

Recently DeepSeek R1 has shown that reinforcement learning (RL) can substantially improve the reasoning capabilities of Large Language Models (LLMs) through a simple yet effective design. The core of R1 lies in its rule-based reward formulation, which leverages tasks with deterministic ground-truth answers to enable precise and stable reward computation. In the visual domain, we similarly observe that a wide range of visual understanding tasks are inherently equipped with well-defined ground-truth annotations. This property makes them naturally compatible with rule-based reward mechanisms. Motivated by this observation, we investigate the extension of R1-style reinforcement learning to Vision-Language Models (VLMs), aiming to enhance their visual reasoning capabilities. To this end, we develop VLM-R1, a dedicated framework designed to harness RL for improving VLMs' performance on general vision-language tasks. Using this framework, we further explore the feasibility of applying RL to visual domain. Experimental results indicate that the RL-based model not only delivers competitive performance on visual understanding tasks but also surpasses Supervised Fine-Tuning (SFT) in generalization ability. Furthermore, we conduct comprehensive ablation studies that uncover a series of noteworthy insights, including the presence of reward hacking in object detection, the emergence of the "OD aha moment", the impact of training data quality, and the scaling behavior of RL across different model sizes. Through these analyses, we aim to deepen the understanding of how reinforcement learning enhances the capabilities of vision-language models, and we hope our findings and open-source contributions will support continued progress in the vision-language RL community. Our code and model are available at https://github.com/om-ai-lab/VLM-R1

cs.CV↗

arXiv2025

Spontaneous Vectorization in the Einstein-Born-Infeld-Vector Model

We investigate spontaneous vectorization in the Einstein-Born-Infeld-Vector (EBIV) model, where a massless vector field is nonminimally coupled to a nonlinear Born-Infeld (BI) electromagnetic field. This coupling results in an effective mass for the vector field in a Born-Infeld black hole (BIBH) background, triggering tachyonic instability. We numerically construct and analyze such vectorized Born-Infeld black holes (VBIBHs), focusing on their domain of existence, thermodynamic properties, and energy distributions in both Reissner-Nordström (RN)-like and Schwarzschild-like backgrounds. In RN-like BI backgrounds, vectorized solutions emerge from the perturbative instability threshold and persist down to extremality, exhibiting higher entropy and lower free energy compared to their unvectorized counterparts. Conversely, in Schwarzschild-like backgrounds, VBIBHs show bifurcation behavior with two coexisting solution branches, only one of which is thermodynamically favored. We reveal a contrasting energy redistribution pattern between the internal and external fields in the two regimes, governed by the competition between the vector field and the nonlinear BI field. Our findings highlight the rich structure of spontaneous vectorization in nonlinear electrodynamics and provide novel insights into black hole physics beyond linear Maxwell theory.

gr-qc↗

arXiv2025

Screened volume law of Holographic Entanglement Entropy in Holographic Spontaneous Vectorization model

We present a holographic study of spontaneous vectorization in the background of an isotropic asymptotically AdS black brane. By extending spontaneous scalarization to vector fields, we demonstrate how the effective mass of the vector field drives tachyonic instability, leading to a transition from the AdS-RN phase to a vectorized phase. Thermodynamic analysis reveals the critical temperature $ T_c $ and coupling $ α_c $ for this transition, with the vectorized phase exhibiting lower free energy. A central discovery is the emergence of a ``screened volume law'' in the holographic entanglement entropy (HEE), a novel phenomenon where the entanglement entropy scales with the subregion size via a screened entropy density distinct from thermal entropy. This arises from a geometric constraint tied to the vanishing of the Christoffel symbol $ Γ^z{}_{xx} $, which defines an effective boundary outside the horizons. Unlike conventional ``entanglement shadows'' in black hole systems, this surface acts as a boundary for minimal surfaces in a translationally invariant geometry. This screening effect suggests the inability of entanglement measure to fully probe the Hilbert space of this thermal system. Additionally, the HEE in the vectorized phase displays non-monotonic temperature dependence. These results establish spontaneous vectorization as a mechanism for generating novel entanglement structures in holographic systems, with implications for quantum information and critical phenomena in strongly coupled systems.

hep-th↗

arXiv2025

Spontaneous Vectorization in the Einstein-Maxwell-Vector Model

We investigate spontaneous vectorization in the Einstein-Maxwell-Vector (EMV) model, introducing a novel mechanism driven by the interplay between electromagnetic and vector fields. A key innovation in our work is the resolution of an apparent divergence in the vector field near the event horizon, achieved by employing a generalized coordinate transformation. This not only extends the domain of existence for vectorized Reissner-Nordström black holes (VRNBHs), but also refines the theoretical understanding of such solutions. We introduce a new concept of combined charge $\sqrt{\tilde{Q}^2 + \tilde{P}^2}$, which better captures the underlying physics of these black holes and provides a unified framework for analyzing thermodynamics and observable phenomena such as light ring structures. Our findings suggest that VRNBHs exhibit enhanced thermodynamic preference and distinctive light ring properties compared to Reissner-Nordström solutions. Moreover, we demonstrate how this combined charge approach reveals connections to two-charge black hole solutions, offering promising avenues for observational verification within the context of effective field theories.

gr-qc↗

arXiv2025

RCCFormer: A Robust Crowd Counting Network Based on Transformer

Crowd counting, which is a key computer vision task, has emerged as a fundamental technology in crowd analysis and public safety management. However, challenges such as scale variations and complex backgrounds significantly impact the accuracy of crowd counting. To mitigate these issues, this paper proposes a robust Transformer-based crowd counting network, termed RCCFormer, specifically designed for background suppression and scale awareness. The proposed method incorporates a Multi-level Feature Fusion Module (MFFM), which meticulously integrates features extracted at diverse stages of the backbone architecture. It establishes a strong baseline capable of capturing intricate and comprehensive feature representations, surpassing traditional baselines. Furthermore, the introduced Detail-Embedded Attention Block (DEAB) captures contextual information and local details through global self-attention and local attention along with a learnable manner for efficient fusion. This enhances the model's ability to focus on foreground regions while effectively mitigating background noise interference. Additionally, we develop an Adaptive Scale-Aware Module (ASAM), with our novel Input-dependent Deformable Convolution (IDConv) as its fundamental building block. This module dynamically adapts to changes in head target shapes and scales, significantly improving the network's capability to accommodate large-scale variations. The effectiveness of the proposed method is validated on the ShanghaiTech Part_A and Part_B, NWPU-Crowd, and QNRF datasets. The results demonstrate that our RCCFormer achieves excellent performance across all four datasets, showcasing state-of-the-art outcomes.

cs.CV↗

arXiv2025

Embedding Reliability Verification Constraints into Generation Expansion Planning

Generation planning approaches face challenges in managing the incompatible mathematical structures between stochastic production simulations for reliability assessment and optimization models for generation planning, which hinders the integration of reliability constraints. This study proposes an approach to embedding reliability verification constraints into generation expansion planning by leveraging a weighted oblique decision tree (WODT) technique. For each planning year, a generation mix dataset, labeled with reliability assessment simulations, is generated. An WODT model is trained using this dataset. Reliability-feasible regions are extracted via depth-first search technique and formulated as disjunctive constraints. These constraints are then transformed into mixed-integer linear form using a convex hull modeling technique and embedded into a unit commitment-integrated generation expansion planning model. The proposed approach is validated through a long-term generation planning case study for the Electric Reliability Council of Texas (ERCOT) region, demonstrating its effectiveness in achieving reliable and optimal planning solutions.

cs.AI↗

arXiv2025

Overcoming the Identity Mapping Problem in Self-Supervised Hyperspectral Anomaly Detection

The surge of deep learning has catalyzed considerable progress in self-supervised Hyperspectral Anomaly Detection (HAD). The core premise for self-supervised HAD is that anomalous pixels are inherently more challenging to reconstruct, resulting in larger errors compared to the background. However, owing to the powerful nonlinear fitting capabilities of neural networks, self-supervised models often suffer from the Identity Mapping Problem (IMP). The IMP manifests as a tendency for the model to overfit to the entire image, particularly with increasing network complexity or prolonged training iterations. Consequently, the whole image can be precisely reconstructed, and even the anomalous pixels exhibit imperceptible errors, making them difficult to detect. Despite the proposal of several models aimed at addressing the IMP-related issues, a unified descriptive framework and validation of solutions for IMP remain lacking. In this paper, we conduct an in-depth exploration to IMP, and summarize a unified framework that describes IMP from the perspective of network optimization, which encompasses three aspects: perturbation, reconstruction, and regularization. Correspondingly, we introduce three solutions: superpixel pooling and uppooling for perturbation, error-adaptive convolution for reconstruction, and online background pixel mining for regularization. With extensive experiments being conducted to validate the effectiveness, it is hoped that our work will provide valuable insights and inspire further research for self-supervised HAD. Code: \url{https://github.com/yc-cui/Super-AD}.

eess.IV↗

arXiv2025

Evaluating Molecule Synthesizability via Retrosynthetic Planning and Reaction Prediction

A significant challenge in wet lab experiments with current drug design generative models is the trade-off between pharmacological properties and synthesizability. Molecules predicted to have highly desirable properties are often difficult to synthesize, while those that are easily synthesizable tend to exhibit less favorable properties. As a result, evaluating the synthesizability of molecules in general drug design scenarios remains a significant challenge in the field of drug discovery. The commonly used synthetic accessibility (SA) score aims to evaluate the ease of synthesizing generated molecules, but it falls short of guaranteeing that synthetic routes can actually be found. Inspired by recent advances in top-down synthetic route generation and forward reaction prediction, we propose a new, data-driven metric to evaluate molecule synthesizability. This novel metric leverages the synergistic duality between retrosynthetic planners and reaction predictors, both of which are trained on extensive reaction datasets. To demonstrate the efficacy of our metric, we conduct a comprehensive evaluation of round-trip scores across a range of representative molecule generative models.

cs.LG↗

arXiv2025

The Timing and Polarization of PSR J0002+6216

The combined timing analysis of data from the Five-hundred-meter Aperture Spherical Radio Telescope (FAST) and the Fermi Large Area Telescope (Fermi-LAT) confirmed that PSR J0002+6216 is not a hyper-velocity (exceeding 1000 km s$^{-1}$) pulsar. From this analysis, we determined the total proper motion of PSR J0002+6216 to be $μ_{\rm tot}=39.05\pm15.79$ mas yr$^{-1}$, which is consistent with Very Long Baseline Interferometry (VLBI) measurements to within 0.24$σ$. Moreover, two glitches were detected for the first time, which occurred on MJD 58850(17) and MJD 60421(6), respectively. The second glitch exhibited an exponential recovery process, with $Q = 0.0090(3)$ and $τ_{\rm d} = 45(3)$ days. Additionally, with FAST high-sensitivity observations, we measured the interstellar rotation measure (RM) and the three-dimensional (3D) orientation of the spin axis for the first time, and updated the dispersion measure (DM) of PSR J0002+6216. Currently, no variations in RM or DM have been detected. By combining the measured RM with the observed position angle of the spin axis, we determined that the intrinsic position angle of the pulsar's spin axis is $ψ_{0}(\text{intrinsic}) = 89.9^{\circ} \pm 4.6^{\circ}$. When we compared this with the proper motion position angle obtained from VLBI, we found a misalignment of approximately 23$^{\circ}$ between the spin and velocity angles of PSR J0002+6216. At present, pulsars with 2D spin-velocity angle measurements are unable to fully test the Janka et al.(2022) model. However, with more high-precision observational data in the future, we will be able to further test models related to pulsar birth.

astro-ph.HE↗

arXiv2025

Bayesian Inference General Procedures for A Single-subject Test Study

Abnormality detection in identifying a single-subject which deviates from the majority of a control group dataset is a fundamental problem. Typically, the control group is characterised using standard Normal statistics, and the detection of a single abnormal subject is in that context. However, in many situations, the control group cannot be described by Normal statistics, making standard statistical methods inappropriate. This paper presents a Bayesian Inference General Procedures for A Single-subject Test (BIGPAST) designed to mitigate the effects of skewness under the assumption that the dataset of the control group comes from the skewed Student $ t $ distribution. BIGPAST operates under the null hypothesis that the single-subject follows the same distribution as the control group. We assess BIGPAST's performance against other methods through simulation studies. The results demonstrate that BIGPAST is robust against deviations from normality and outperforms the existing approaches in accuracy nearest to the nominal accuracy 0.95. BIGPAST can reduce model misspecification errors under the skewed Student $t$ assumption by up to 12 times, as demonstrated in Section 3.3. We apply BIGPAST to a Magnetoencephalography (MEG) dataset consisting of an individual with mild traumatic brain injury and an age and gender-matched control group. For example, the previous method failed to detect abnormalities in 8 brain areas, whereas BIGPAST successfully identified them, demonstrating its effectiveness in detecting abnormalities in a single-subject.

stat.AP↗