arXiv subjects

Peng Liu

Publications and source records attributed to Peng Liu.

At least 109 records · Page 6Linked to original sources

arXiv2025

FlakyGuard: Automatically Fixing Flaky Tests at Industry Scale

Flaky tests that non-deterministically pass or fail waste developer time and slow release cycles. While large language models (LLMs) show promise for automatically repairing flaky tests, existing approaches like FlakyDoctor fail in industrial settings due to the context problem: providing either too little context (missing critical production code) or too much context (overwhelming the LLM with irrelevant information). We present FlakyGuard, which addresses this problem by treating code as a graph structure and using selective graph exploration to find only the most relevant context. Evaluation on real-world flaky tests from industrial repositories shows that FlakyGuard repairs 47.6 % of reproducible flaky tests with 51.8 % of the fixes accepted by developers. Besides it outperforms state-of-the-art approaches by at least 22 % in repair success rate. Developer surveys confirm that 100 % find FlakyGuard's root cause explanations useful.

cs.SE↗

arXiv2025

An Integrated Fusion Framework for Ensemble Learning Leveraging Gradient Boosting and Fuzzy Rule-Based Models

The integration of different learning paradigms has long been a focus of machine learning research, aimed at overcoming the inherent limitations of individual methods. Fuzzy rule-based models excel in interpretability and have seen widespread application across diverse fields. However, they face challenges such as complex design specifications and scalability issues with large datasets. The fusion of different techniques and strategies, particularly Gradient Boosting, with Fuzzy Rule-Based Models offers a robust solution to these challenges. This paper proposes an Integrated Fusion Framework that merges the strengths of both paradigms to enhance model performance and interpretability. At each iteration, a Fuzzy Rule-Based Model is constructed and controlled by a dynamic factor to optimize its contribution to the overall ensemble. This control factor serves multiple purposes: it prevents model dominance, encourages diversity, acts as a regularization parameter, and provides a mechanism for dynamic tuning based on model performance, thus mitigating the risk of overfitting. Additionally, the framework incorporates a sample-based correction mechanism that allows for adaptive adjustments based on feedback from a validation set. Experimental results substantiate the efficacy of the presented gradient boosting framework for fuzzy rule-based models, demonstrating performance enhancement, especially in terms of mitigating overfitting and complexity typically associated with many rules. By leveraging an optimal factor to govern the contribution of each model, the framework improves performance, maintains interpretability, and simplifies the maintenance and update of the models.

cs.LG↗

arXiv2025

Implicit Federated In-context Learning For Task-Specific LLM Fine-Tuning

As large language models continue to develop and expand, the extensive public data they rely on faces the risk of depletion. Consequently, leveraging private data within organizations to enhance the performance of large models has emerged as a key challenge. The federated learning paradigm, combined with model fine-tuning techniques, effectively reduces the number of trainable parameters. However,the necessity to process high-dimensional feature spaces results in substantial overall computational overhead. To address this issue, we propose the Implicit Federated In-Context Learning (IFed-ICL) framework. IFed-ICL draws inspiration from federated learning to establish a novel distributed collaborative paradigm, by converting client local context examples into implicit vector representations, it enables distributed collaborative computation during the inference phase and injects model residual streams to enhance model performance. Experiments demonstrate that our proposed method achieves outstanding performance across multiple text classification tasks. Compared to traditional methods, IFed-ICL avoids the extensive parameter updates required by conventional fine-tuning methods while reducing data transmission and local computation at the client level in federated learning. This enables efficient distributed context learning using local private-domain data, significantly improving model performance on specific tasks.

cs.LG↗

arXiv2025

Lambda Value-at-Risk under ambiguity and risk sharing

In this paper, we investigate the Lambda Value-at-Risk ($Λ$VaR) under ambiguity, where the ambiguity is represented by a family of probability measures. We establish that for increasing Lambda functions, the robust (i.e., worst-case) $Λ$VaR under such an ambiguity set is equivalent to $Λ$VaR computed with respect to a capacity, a novel extension in the literature. This framework unifies and extends both traditional $Λ$VaR and Choquet quantiles (Value-at-Risk under ambiguity). We analyze the fundamental properties of this extended risk measure and establish a novel equivalent representation for $Λ$VaR under capacities with monotone Lambda functions in terms of families of downsets. Moreover, explicit formulas are derived for robust $Λ$VaR when ambiguity sets are characterized by $ϕ$-divergence and the likelihood ratio constraints, respectively. We further explore the applications in risk sharing among multiple agents. We demonstrate that the family of risk measures induced by families of downsets is closed under inf-convolution. In particular, we prove that the inf-convolution of $Λ$VaR with capacities and monotone Lambda functions is another$Λ$VaR under a capacity. The explicit forms of optimal allocations are also derived. Moreover, we obtain more explicit results for risk sharing under ambiguity sets characterized by $ϕ$-divergence and likelihood ratio constraints. Finally, we explore comonotonic risk-sharing for $Λ$VaR under ambiguity.

q-fin.RM↗

arXiv2025

Totally Anti-symmetric Spinor Tensors in Minkowski Space

The spinor tensor $ε_{AB}$ has a special property that its elements can be formulated into an algebraic expression of the indices. All the totally anti-symmetric tensors in Minkowski space are expressed by $ε_{AB}$. By using the property, we give a simple proof of the total anti-symmetry for the volume spinor tensor.

math-ph↗

arXiv2025

Enpowering Your Pansharpening Models with Generalizability: Unified Distribution is All You Need

Existing deep learning-based models for remote sensing pansharpening exhibit exceptional performance on training datasets. However, due to sensor-specific characteristics and varying imaging conditions, these models suffer from substantial performance degradation when applied to unseen satellite data, lacking generalizability and thus limiting their applicability. We argue that the performance drops stem primarily from distributional discrepancies from different sources and the key to addressing this challenge lies in bridging the gap between training and testing distributions. To validate the idea and further achieve a "train once, deploy forever" capability, this paper introduces a novel and intuitive approach to enpower any pansharpening models with generalizability by employing a unified distribution strategy (UniPAN). Specifically, we construct a distribution transformation function that normalizes the pixels sampled from different sources to conform to an identical distribution. The deep models are trained on the transformed domain, and during testing on new datasets, the new data are also transformed to match the training distribution. UniPAN aims to train and test the model on a unified and consistent distribution, thereby enhancing its generalizability. Extensive experiments validate the efficacy of UniPAN, demonstrating its potential to significantly enhance the performance of deep pansharpening models across diverse satellite sensors. Codes: https://github.com/yc-cui/UniPAN.

cs.CV↗

arXiv2025

The local Gaussian correlation networks among return tails in the Chinese stock market

Financial networks based on Pearson correlations have been intensively studied. However, previous studies may have led to misleading and catastrophic results because of several critical shortcomings of the Pearson correlation. The local Gaussian correlation coefficient, a new measurement of statistical dependence between variables, has unique advantages including capturing local nonlinear dependence and handling heavy-tailed distributions. This study constructs financial networks using the local Gaussian correlation coefficients between tail regions of stock returns in the Shanghai Stock Exchange. The work systematically analyzes fundamental network metrics including node centrality, average shortest path length, and entropy. Compared with the local Gaussian correlation network among positive tails and the conventional Pearson correlation network, the properties of the local Gaussian correlation network among negative tails are more sensitive to the stock market risks. This finding suggests researchers should prioritize the local Gaussian correlation network among negative tails. Future work should reevaluate existing findings using the local Gaussian correlation method.

q-fin.GN↗

arXiv2025

Anti-correlation network among China A-shares

The correlation-based financial networks are studied intensively. However, previous studies ignored the importance of the anti-correlation. This paper is the first to consider the anti-correlation and positive correlation separately, and accordingly construct the weighted temporal anti-correlation and positive correlation networks among stocks listed in the Shanghai and Shenzhen stock exchanges. For both types of networks during the first 24 years of this century, fundamental topological measurements are analyzed systematically. This paper unveils some essential differences in these topological measurements between the anti-correlation and positive correlation networks. It also observes an asymmetry effect between the stock market decline and rise. The methodology proposed in this paper has the potential to reveal significant differences in the topological structure and dynamics of a complex financial system, stock behavior, investment portfolios, and risk management, offering insights that are not visible when all correlations are considered together. More importantly, this paper proposes a new direction for studying complex systems: the anti-correlation network. It is well worth reexamining previous relevant studies using this new methodology.

q-fin.ST↗

arXiv2025

An Imitative Reinforcement Learning Framework for Pursuit-Lock-Launch Missions

Unmanned Combat Aerial Vehicle (UCAV) Within-Visual-Range (WVR) engagement, referring to a fight between two or more UCAVs at close quarters, plays a decisive role on the aerial battlefields. With the development of artificial intelligence, WVR engagement progressively advances towards intelligent and autonomous modes. However, autonomous WVR engagement policy learning is hindered by challenges such as weak exploration capabilities, low learning efficiency, and unrealistic simulated environments. To overcome these challenges, we propose a novel imitative reinforcement learning framework, which efficiently leverages expert data while enabling autonomous exploration. The proposed framework not only enhances learning efficiency through expert imitation, but also ensures adaptability to dynamic environments via autonomous exploration with reinforcement learning. Therefore, the proposed framework can learn a successful policy of `pursuit-lock-launch' for UCAVs. To support data-driven learning, we establish an environment based on the Harfang3D sandbox. The extensive experiment results indicate that the proposed framework excels in this multistage task, and significantly outperforms state-of-the-art reinforcement learning and imitation learning methods. Thanks to the ability of imitating experts and autonomous exploration, our framework can quickly learn the critical knowledge in complex aerial combat tasks, achieving up to a 100% success rate and demonstrating excellent robustness.

cs.LG↗

arXiv2025

VLM-FO1: Bridging the Gap Between High-Level Reasoning and Fine-Grained Perception in VLMs

Vision-Language Models (VLMs) excel at high-level scene understanding but falter on fine-grained perception tasks requiring precise localization. This failure stems from a fundamental mismatch, as generating exact numerical coordinates is a challenging task for language-centric architectures. In this paper, we introduce VLM-FO1, a novel framework that overcomes this limitation by reframing object-centric perception from a brittle coordinate generation problem into a robust feature retrieval task. Our method operates as a plug-and-play module that integrates with any pre-trained VLM. It leverages a Hybrid Fine-grained Region Encoder (HFRE), featuring a dual vision encoder, to generate powerful region tokens rich in both semantic and spatial detail. A token-based referencing system then enables the LLM to seamlessly reason about and ground language in these specific visual regions. Experiments show that VLM-FO1 achieves state-of-the-art performance across a diverse suite of benchmarks, demonstrating exceptional capabilities in object grounding, region generational understanding, and visual region reasoning. Crucially, our two-stage training strategy ensures that these perception gains are achieved without compromising the base model's general visual understanding capabilities. VLM-FO1 establishes an effective and flexible paradigm for building perception-aware VLMs, bridging the gap between high-level reasoning and fine-grained visual grounding.

cs.CV↗

arXiv2025

Wireless Powered MEC Systems via Discrete Pinching Antennas: TDMA versus NOMA

Pinching antennas (PAs), a new type of reconfigurable and flexible antenna structures, have recently attracted significant research interest due to their ability to create line-of-sight links and mitigate large-scale path loss. Owing to their potential benefits, integrating PAs into wireless powered mobile edge computing (MEC) systems is regarded as a viable solution to enhance both energy transfer and task offloading efficiency. Unlike prior studies that assume ideal continuous PA placement along waveguides, this paper investigates a practical discrete PA-assisted wireless powered MEC framework, where devices first harvest energy from PA-emitted radio-frequency signals and then adopt a partial offloading mode, allocating part of the harvested energy to local computing and the remainder to uplink offloading. The uplink phase considers both the time-division multiple access (TDMA) and non-orthogonal multiple access (NOMA), each examined under three levels of PA activation flexibility. For each configuration, we formulate a joint optimization problem to maximize the total computational bits and conduct a theoretical performance comparison between the TDMA and NOMA schemes. To address the resulting mixed-integer nonlinear problems, we develop a two-layer algorithm that combines closed-form solutions based on Karush-Kuhn-Tucker (KKT) conditions with a cross-entropy-based learning method. Numerical results validate the superiority of the proposed design in terms of the harvested energy and computation performance, revealing that TDMA and NOMA achieve comparable performance under coarser PA activation levels, whereas finer activation granularity enables TDMA to achieve superior computation performance over NOMA.

eess.SP↗

arXiv2025

UnifiedRL: A Reinforcement Learning Algorithm Tailored for Multi-Task Fusion in Large-Scale Recommender Systems

As the last pivotal stage of Recommender System (RS), Multi-Task Fusion (MTF) is responsible for combining multiple scores outputted by Multi-Task Learning (MTL) model into a final score to maximize user satisfaction. Recently, to optimize long-term user satisfaction, Reinforcement Learning (RL) is used for MTF in RSs. However, the existing offline RL algorithms used for MTF have the following severe problems: a) To avoid Out-of-Distribution (OOD), their constraints are overly strict, which seriously damage performance; b) They are unaware of the exploration policy used to collect training data, only suboptimal policy can be learned; c) Their exploration policies are inefficient and hurt user experience. To solve the above problems, we propose an innovative method called UnifiedRL tailored for MTF in large-scale RSs. UnifiedRL seamlessly integrates offline RL model with its custom exploration policy to relax overly strict constraints, which is different from existing RL-MTF methods and significantly improves performance. In addition, compared to existing exploration policies, UnifiedRL's custom exploration policy is highly efficient, enabling frequent online exploration and offline training iterations, which further improves performance. Extensive offline and online experiments are conducted in a large-scale RS. The results demonstrate that UnifiedRL outperforms other existing MTF methods remarkably, achieving a +4.64% increase in user valid consumption and a +1.74% increase in user duration time. To the best of our knowledge, UnifiedRL is the first RL algorithm tailored for MTF in RSs and has been successfully deployed in multiple large-scale RSs since June 2023, yielding significant benefits.

cs.IR↗

arXiv2025

Dynamic User Interest Augmentation via Stream Clustering and Memory Networks in Large-Scale Recommender Systems

Recommender System (RS) provides personalized recommendation service based on user interest. However, lots of users' interests are sparse due to lacking consumption behaviors, making it challenging to provide accurate recommendations for them, which is widespread in large-scale RSs. In particular, efficiently solving this problem in the ranking stage of RS is an even greater challenge, which requires an end-to-end and real-time approach. To solve this problem, we propose an innovative method called Dynamic User Interest Augmentation (DUIA). DUIA enhances user interest including user profile and user history behavior sequences by generating enhancement vectors and personalized enhancement vectors through dynamic stream clustering of similar users and relevant items from multiple perspectives. To realize stream clustering, we specially design an algorithm called Gradient-based Hierarchical Clustering Algorithm (GHCA) for DUIA, which performs clustering via gradient descent and stores the cluster centers in memory networks. Extensive offline and online experiments demonstrate that DUIA not only significantly improves model performance for users with sparse interests but also delivers notable gains for other users. As an end-to-end method, DUIA can be easily integrated with existing models. Furthermore, DUIA is also used for long-tail items and cold-start problem, which also yields excellent improvements. Since 2022, DUIA has been successfully deployed in multiple industrial RSs in Tencent and was made public in May 2024. Moreover, the thoughts behind DUIA, dynamic stream clustering and similarity-based enhancement, have inspired relevant works and have also been applied in other stages of RS.

cs.IR↗

arXiv2025

A zero-dead-time strontium lattice clock with a stability at $10^{-19}$ level

Optical atomic clocks play a crucial role in fundamental physics, relativistic geodesy, and the future redefinition of the SI second. Standard operation relies on cyclic interrogation sequences, which alternate between atomic interrogation and dead time used for state preparation and readout. This approach introduces the Dick effect, where laser frequency noise aliases onto the atomic transition frequency. Although reducing laser noise improves clock stability, the Dick effect remains a key limitation. In this work, we demonstrate a zero-dead-time optical clock based on two interleaved ensembles of cold $^{87}\text{Sr}$ atoms. Our system significantly suppresses this noise and achieves a fractional frequency instability at the $10^{-19}$ level between 10,000 and 20,000 seconds over repeated measurements, with a best value of $2.9 \times 10^{-19}$ at $τ= 20,000$ seconds. The estimated long-term stability based on the combined data of these measurements reaches $2.5 \times 10^{-19}$ at one day. These results represent a more than ninefold improvement over a conventional single-ensemble clock, highlighting its potential for next-generation timekeeping applications.

physics.atom-ph↗

arXiv2025

Improved systematic evaluation of a strontium optical clock with uncertainty below $1\times 10^{-18}$

We report a systematic uncertainty of $9.2\times 10^{-19}$ for the USTC Sr1 optical lattice clock, achieving accuracy at the level required for the roadmap of the redefinition of the SI second. A finite-element model with {\it in situ}-validated, spatially-resolved chamber emissivity reduced blackbody radiation shift uncertainty to $6.3\times 10^{-19}$. Concurrently, an externally mounted lattice cavity combined with a larger beam waist suppressed density shifts. Enhanced lattice depth modulation consolidated lattice light shift uncertainty to $6.3\times 10^{-19}$ by enabling simultaneous determination of key polarizabilities and magic wavelength. Magnetic shifts were resolved below $10^{-18}$ via precision characterization of the second-order Zeeman coefficient. Supported by a crystalline-coated ultra-low-expansion cavity-stabilized laser and refined temperature control suppressing BBR fluctuations, the clock also achieves a frequency stability better than $1\times10^{-18}$ at 30,000-s averaging time. These developments collectively establish a new benchmark in USTC Sr1 clock performance and pave the way for high-accuracy applications in metrology and fundamental physics.

physics.atom-ph↗

arXiv2025

Dense Matter in Neutron Stars with eXTP

In this White Paper, we present the potential of the enhanced X-ray Timing and Polarimetry (eXTP) mission to constrain the equation of state of dense matter in neutron stars, exploring regimes not directly accessible to terrestrial experiments. By observing a diverse population of neutron stars - including isolated objects, X-ray bursters, and accreting systems - eXTP's unique combination of timing, spectroscopy, and polarimetry enables high-precision measurements of compactness, spin, surface temperature, polarimetric signals, and timing irregularity. These multifaceted observations, combined with advances in theoretical modeling, pave the way toward a comprehensive description of the properties and phases of dense matter from the crust to the core of neutron stars. Under development by an international Consortium led by the Institute of High Energy Physics of the Chinese Academy of Sciences, the eXTP mission is planned to be launched in early 2030.

astro-ph.HE↗

arXiv2025

Discovery of the anti-glitch in PSR J1835$-$1106

We report the detection of an anti-glitch with a fractional frequency change of $Δν/ν=-3.46(6)\times10^{-9}$ in the rotation-powered pulsar PSR J1835$-$1106 at MJD 55813, based on timing observations collected with the Nanshan 26-m and Parkes 64-m radio telescopes from January 2000 to July 2022. A comparison of the average pulse profiles within $\pm300$ d of the event reveals no significant morphological changes. We also estimate the angular velocity lag between the normal and superfluid components at the time of the glitch, showing that one of the superfluid glitch models is incompatible with PSR J1835$-$1106 due to its insufficient spin-down rate and angular velocity lag. The wind braking scenario offers a viable alternative, consistent with the observed spin-down behavior, glitch amplitude, and post-glitch recovery. High-cadence, high-sensitivity monitoring of similar events is essential to distinguish between internal (superfluid) and external (wind-related) glitch mechanisms.

astro-ph.HE↗

arXiv2025

Risk sharing with Lambda value at risk under heterogeneous beliefs

In this paper, we study the risk sharing problem among multiple agents using Lambda Value-at-Risk as their preference functional, under heterogeneous beliefs, where beliefs are represented by several probability measures. We obtain semi-explicit formulas for the inf-convolution of multiple Lambda Value-at-Risk measures under heterogeneous beliefs and the explicit forms of the corresponding optimal allocations. To show the impact of belief heterogeneity, we consider three cases: homogeneous beliefs, conditional beliefs and absolutely continuous beliefs. For those cases, we find more explicit expressions for the inf-convolution, showing the influence of the relation of the beliefs on the inf-convolution. Moreover, we consider, in a two-agent setting, the inf-convolution of one Lambda Value-at-Risk and a general risk measure, including expected utility, distortion risk measures and Lambda Value-at-Risk as special cases, with differing beliefs. The expression of the inf-convolution and the form of the optimal allocation are obtained. In all above cases we demonstrate that trivial outcomes arise when both belief inconsistency and risk tolerance are high. Finally, we discuss risk sharing for an alternative definition of Lambda Value-at-Risk.

q-fin.RM↗