arXiv subjects

Yun Yang

Publications and source records attributed to Yun Yang.

At least 55 records · Page 3Linked to original sources

arXiv2025

Improving Retrieval-Augmented Deep Assertion Generation via Joint Training

Unit testing attempts to validate the correctness of basic units of the software system under test and has a crucial role in software development and testing. Very recent work proposes a retrieve-and-edit approach to generate unit test oracles, i.e., assertions. Despite being promising, it is still far from perfect due to some limitations, such as splitting assertion retrieval and generation into two separate components without benefiting each other. In this paper, we propose AG-RAG, a retrieval-augmented automated assertion generation approach that leverages external codebases and joint training to address various technical limitations of prior work. Inspired by the plastic surgery hypothesis, AG-RAG attempts to combine relevant unit tests and advanced pre-trained language models (PLMs) with retrieval-augmented fine-tuning. AG-RAG builds a dense retriever to search for relevant test-assert pairs (TAPs) with semantic matching and a retrieval-augmented generator to synthesize accurate assertions with the focal-test and retrieved TAPs as input. Besides, AG-RAG leverages a code-aware language model CodeT5 as the cornerstone to facilitate both assertion retrieval and generation tasks. Furthermore, the retriever is optimized in conjunction with the generator as a whole pipeline with a joint training strategy. This unified design fully adapts both components specifically for retrieving more useful TAPs, thereby generating accurate assertions. We extensively evaluate AG-RAG against six state-of-the-art AG approaches on two benchmarks and three metrics. Experimental results show that AG-RAG significantly outperforms previous AG approaches on all benchmarks and metrics, e.g., improving the most recent baseline EditAS by 20.82% and 26.98% in terms of accuracy. AG-RAG also correctly generates 1739 and 2866 unique assertions that all baselines fail to generate, 3.45X and 9.20X more than EditAS.

cs.SE↗

arXiv2025

Improving Deep Assertion Generation via Fine-Tuning Retrieval-Augmented Pre-trained Language Models

Unit testing validates the correctness of the units of the software system under test and serves as the cornerstone in improving software quality and reliability. To reduce manual efforts in writing unit tests, some techniques have been proposed to automatically generate test assertions, with recent integration-based approaches considered state-of-the-art. Despite being promising, such integration-based approaches face several limitations, including reliance on lexical matching for assertion retrieval and a limited training corpus for assertion generation. This paper proposes a novel retrieval-augmented deep assertion generation approach, namely RetriGen, based on a hybrid retriever and a pre-trained language model (PLM)-based generator. Given a focal-test, RetriGen first builds a hybrid assertion retriever to search for the most relevant Test-Assert Pair from external codebases. The retrieval process considers lexical similarity and semantical similarity via a token-based and an embedding-based retriever, respectively. RetriGen then treats assertion generation as a sequence-to-sequence task and designs a PLM-based assertion generator to predict a correct assertion. We conduct extensive experiments to evaluate RetriGen against six state-of-the-art approaches across two large-scale datasets and two metrics. The results demonstrate that RetriGen achieves 57.66% accuracy and 73.24% CodeBLEU, outperforming all baselines with average improvements of 50.66% and 14.14%, respectively.

cs.SE↗

arXiv2025

SIP-IFVM: A time-evolving coronal model with an extended magnetic field decomposition strategy

Time-evolving magnetohydrodynamic (MHD) coronal modeling, driven by a series of time-dependent photospheric magnetograms, represents a new generation of coronal simulations. This approach offers greater realism compared to traditional coronal models constrained by a static magnetogram. However, its practical application is seriously limited by low computational efficiency and poor numerical stability. Therefore, we propose an extended magnetic field decomposition strategy and implement it in the implicit MHD model to develop a coronal model that is both efficient and numerically stable enough for simulating the long-term evolutions of the global corona. The traditional decomposition strategies split the magnetic field into a time-invariant potential field and a time-dependent component $\mathbf{B}_1$. It works well for quasi-steady-state coronal simulations where $\left|\mathbf{B}_1\right|$ is typically small. However, as the inner-boundary magnetic field evolves, $\left|\mathbf{B}_1\right|$ can grow significantly larger and its discretization errors often lead to nonphysical negative thermal pressure, ultimately causing the code to crash. In this paper, we mitigate such undesired situations by introducing a temporally piecewise-constant variable to accommodate part of the non-potential field and remain $\left|\mathbf{B}_1\right|$ consistently small throughout the simulations. We incorporate this novel magnetic field decomposition strategy into our implicit MHD coronal model and apply it to simulate the evolution of coronal structures within 0.1 AU over two solar-maximum Carrington rotations. The results show that this coronal model effectively captures observations and performs more than 80 times faster than real time using only 192 CPU cores, making it well-suited for practical applications in simulating the time-evolving corona.

astro-ph.SR↗

arXiv2025

Geometric flows and space-periodic solitons on the light-cone

This paper investigates curve flows on the light-cone in the 3-dimensional Minkowski space. We derive the Harnack inequality for the heat flow and present a detailed classification of space-periodic solitons for a third-order curvature flow. The nontrivial periodic solutions to this flow are expressed in terms of the Jacobi elliptic sine function. Additionally, the closed soliton solutions form a family of transcendental curves, denoted by $\mathrm{x}_{p,q}$, which are characterized by a rotation index $p$ and close after $q$ periods of their curvature functions. The ratio $p/q$ satisfies $p/q \in (\sqrt{2/3}, 1)$, where $p$ and $q$ are relatively prime positive integers. Guided by the classification process, we obtain the analytic solutions to a second-order nonlinear ordinary differential equation.

math.DG↗

arXiv2025

Equi-centro-affine extremal hypersurfaces in ellipsoid

This paper explores equi-centro-affine extremal hypersurfaces in an ellipsoid. By analyzing the evolution of invariant submanifold flows under centro-affine unimodular transformations, we derive the first and second variational formulas for the associated invariant area. Stability analysis reveals that the circles with radius $r=\sqrt{6}/3$ on $\mathbb{S}^2(1)$ are characterized as being equi-centro-affine maximal. Furthermore, we provide a detailed classification of the compact isoparametric equi-centro-affine extremal hypersurfaces on $(n+1)$-dimensional sphere, as well as the generalized closed equi-centro-affine extremal curves on $2$-dimensional sphere. These curves are shown to belong to a family of transcendental curves $\mathrm{x}_{p,q}$ ($p,q$ are two coprime positive integers satisfying that $1/2<p/q<1$ ). Additionally, we establish an equi-centro-affine version of isoperimetric inequality ${}^{ec}\hspace{-1mm}L^3\leq (4π-A)(2π-A)A$ on $\mathbb{S}^2(1)$.

math.DG↗

arXiv2025

Testing Conditional Mean Independence Using Generative Neural Networks

Conditional mean independence (CMI) testing is crucial for statistical tasks including model determination and variable importance evaluation. In this work, we introduce a novel population CMI measure and a bootstrap-based testing procedure that utilizes deep generative neural networks to estimate the conditional mean functions involved in the population measure. The test statistic is thoughtfully constructed to ensure that even slowly decaying nonparametric estimation errors do not affect the asymptotic accuracy of the test. Our approach demonstrates strong empirical performance in scenarios with high-dimensional covariates and response variable, can handle multivariate responses, and maintains nontrivial power against local alternatives outside an $n^{-1/2}$ neighborhood of the null hypothesis. We also use numerical simulations and real-world imaging data applications to highlight the efficacy and versatility of our testing procedure.

stat.ML↗

arXiv2024

When LLMs Meet Cybersecurity: A Systematic Literature Review

The rapid development of large language models (LLMs) has opened new avenues across various fields, including cybersecurity, which faces an evolving threat landscape and demand for innovative technologies. Despite initial explorations into the application of LLMs in cybersecurity, there is a lack of a comprehensive overview of this research area. This paper addresses this gap by providing a systematic literature review, covering the analysis of over 300 works, encompassing 25 LLMs and more than 10 downstream scenarios. Our comprehensive overview addresses three key research questions: the construction of cybersecurity-oriented LLMs, the application of LLMs to various cybersecurity tasks, the challenges and further research in this area. This study aims to shed light on the extensive potential of LLMs in enhancing cybersecurity practices and serve as a valuable resource for applying LLMs in this field. We also maintain and regularly update a list of practical guides on LLMs for cybersecurity at https://github.com/tmylla/Awesome-LLM4Cybersecurity.

cs.CR↗

arXiv2024

Conditional Diffusion Models are Minimax-Optimal and Manifold-Adaptive for Conditional Distribution Estimation

We consider a class of conditional forward-backward diffusion models for conditional generative modeling, that is, generating new data given a covariate (or control variable). To formally study the theoretical properties of these conditional generative models, we adopt a statistical framework of distribution regression to characterize the large sample properties of the conditional distribution estimators induced by these conditional forward-backward diffusion models. Here, the conditional distribution of data is assumed to smoothly change over the covariate. In particular, our derived convergence rate is minimax-optimal under the total variation metric within the regimes covered by the existing literature. Additionally, we extend our theory by allowing both the data and the covariate variable to potentially admit a low-dimensional manifold structure. In this scenario, we demonstrate that the conditional forward-backward diffusion model can adapt to both manifold structures, meaning that the derived estimation error bound (under the Wasserstein metric) depends only on the intrinsic dimensionalities of the data and the covariate.

math.ST↗

arXiv2024

Wasserstein Proximal Coordinate Gradient Algorithms

Motivated by approximation Bayesian computation using mean-field variational approximation and the computation of equilibrium in multi-species systems with cross-interaction, this paper investigates the composite geodesically convex optimization problem over multiple distributions. The objective functional under consideration is composed of a convex potential energy on a product of Wasserstein spaces and a sum of convex self-interaction and internal energies associated with each distribution. To efficiently solve this problem, we introduce the Wasserstein Proximal Coordinate Gradient (WPCG) algorithms with parallel, sequential, and random update schemes. Under a quadratic growth (QG) condition that is weaker than the usual strong convexity requirement on the objective functional, we show that WPCG converges exponentially fast to the unique global optimum. In the absence of the QG condition, WPCG is still demonstrated to converge to the global optimal solution, albeit at a slower polynomial rate. Numerical results for both motivating examples are consistent with our theoretical findings.

math.OC↗

arXiv2024

A Survey on Large Language Models for Software Engineering

Software Engineering (SE) is the systematic design, development, maintenance, and management of software applications underpinning the digital infrastructure of our modern world. Very recently, the SE community has seen a rapidly increasing number of techniques employing Large Language Models (LLMs) to automate a broad range of SE tasks. Nevertheless, existing information of the applications, effects, and possible limitations of LLMs within SE is still not well-studied. In this paper, we provide a systematic survey to summarize the current state-of-the-art research in the LLM-based SE community. We summarize 62 representative LLMs of Code across three model architectures, 15 pre-training objectives across four categories, and 16 downstream tasks across five categories. We then present a detailed summarization of the recent SE studies for which LLMs are commonly utilized, including 947 studies for 112 specific code-related tasks across five crucial phases within the SE workflow. We also discuss several critical aspects during the integration of LLMs into SE, such as empirical evaluation, benchmarking, security and reliability, domain tuning, compressing and distillation. Finally, we highlight several challenges and potential opportunities on applying LLMs for future SE studies, such as exploring domain LLMs and constructing clean evaluation datasets. Overall, our work can help researchers gain a comprehensive understanding about the achievements of the existing LLM-based SE studies and promote the practical application of these techniques. Our artifacts are publicly available and will be continuously updated at the living repository: https://github.com/iSEngLab/AwesomeLLM4SE.

cs.SE↗

arXiv2024

Doubly Robust Conditional Independence Testing with Generative Neural Networks

This article addresses the problem of testing the conditional independence of two generic random vectors $X$ and $Y$ given a third random vector $Z$, which plays an important role in statistical and machine learning applications. We propose a new non-parametric testing procedure that avoids explicitly estimating any conditional distributions but instead requires sampling from the two marginal conditional distributions of $X$ given $Z$ and $Y$ given $Z$. We further propose using a generative neural network (GNN) framework to sample from these approximated marginal conditional distributions, which tends to mitigate the curse of dimensionality due to its adaptivity to any low-dimensional structures and smoothness underlying the data. Theoretically, our test statistic is shown to enjoy a doubly robust property against GNN approximation errors, meaning that the test statistic retains all desirable properties of the oracle test statistic utilizing the true marginal conditional distributions, as long as the product of the two approximation errors decays to zero faster than the parametric rate. Asymptotic properties of our statistic and the consistency of a bootstrap procedure are derived under both null and local alternatives. Extensive numerical experiments and real data analysis illustrate the effectiveness and broad applicability of our proposed test.

stat.ME↗

arXiv2024

On the Computational Complexity of Metropolis-Adjusted Langevin Algorithms for Bayesian Posterior Sampling

In this paper, we examine the computational complexity of sampling from a Bayesian posterior (or pseudo-posterior) using the Metropolis-adjusted Langevin algorithm (MALA). MALA first employs a discrete-time Langevin SDE to propose a new state, and then adjusts the proposed state using Metropolis-Hastings rejection. Most existing theoretical analyses of MALA rely on the smoothness and strong log-concavity properties of the target distribution, which are often lacking in practical Bayesian problems. Our analysis hinges on statistical large sample theory, which constrains the deviation of the Bayesian posterior from being smooth and log-concave in a very specific way. In particular, we introduce a new technique for bounding the mixing time of a Markov chain with a continuous state space via the $s$-conductance profile, offering improvements over existing techniques in several aspects. By employing this new technique, we establish the optimal parameter dimension dependence of $d^{1/3}$ and condition number dependence of $κ$ in the non-asymptotic mixing time upper bound for MALA after the burn-in period, under a standard Bayesian setting where the target posterior distribution is close to a $d$-dimensional Gaussian distribution with a covariance matrix having a condition number $κ$. We also prove a matching mixing time lower bound for sampling from a multivariate Gaussian via MALA to complement the upper bound.

math.ST↗

arXiv2024

Statistically Optimal K-means Clustering via Nonnegative Low-rank Semidefinite Programming

$K$-means clustering is a widely used machine learning method for identifying patterns in large datasets. Recently, semidefinite programming (SDP) relaxations have been proposed for solving the $K$-means optimization problem, which enjoy strong statistical optimality guarantees. However, the prohibitive cost of implementing an SDP solver renders these guarantees inaccessible to practical datasets. In contrast, nonnegative matrix factorization (NMF) is a simple clustering algorithm widely used by machine learning practitioners, but it lacks a solid statistical underpinning and theoretical guarantees. In this paper, we consider an NMF-like algorithm that solves a nonnegative low-rank restriction of the SDP-relaxed $K$-means formulation using a nonconvex Burer--Monteiro factorization approach. The resulting algorithm is as simple and scalable as state-of-the-art NMF algorithms while also enjoying the same strong statistical optimality guarantees as the SDP. In our experiments, we observe that our algorithm achieves significantly smaller mis-clustering errors compared to the existing state-of-the-art while maintaining scalability.

stat.ML↗

arXiv2024

An eternal hypersurface flow arising in centro-affine geometry

In this paper, the existence and uniqueness for a specific centro-affine invariant hypersurface flow in $R^{n+1}$ are studied, and the corresponding evolutionary processes in both centro-affine and Euclidean settings are explored. It turns out that the flow exhibits similar properties as the standard heat flow. In addition, the long time existence of the flow is investigated, which asserts that the hypersurface governed by the flow converges asymptotically toward an ellipsoid via systematically investigating evolutions of the centro-affine invariants. Furthermore, the classification of the eternal solutions for the flow is provided.

math.DG↗

arXiv2024

A Practical Beamforming Design for Active RIS-assisted MU-MISO Systems

Reconfigurable Intelligent Surfaces (RIS) have been proposed as a revolutionary technology with the potential to address several critical requirements of 6G communication systems. Despite its powerful ability for radio environment reconfiguration, the ``double fading'' effect constricts the practical system performance enhancements due to the significant path loss. A new active RIS architecture has been recently proposed to overcome this challenge. However, existing active RIS studies rely on an ideal amplification model without considering the practical hardware limitation of amplifiers, which may cause performance degradation using such inaccurate active RIS modeling. Motivated by this fact, in this paper we first investigate the amplification principle of typical active RIS and propose a more accurate amplification model based on amplifier hardware characteristics. Then, based on the new amplification model, we propose a novel joint transmit beamforming and RIS reflection beamforming design considering the incident signal power on practical active RIS for multiuser multi-input single-output (MU-MISO) communication system. Fractional programming (FP), majorization minimization (MM) and block coordinate descent (BCD) methods are used to solve for the complex problem. Simulation results indicate the importance of the consideration of practical amplifier hardware characteristics in the joint beamforming designs and demonstrate the effectiveness of the proposed algorithm compared to other benchmarks.

eess.SP↗

arXiv2023

Bayesian Model Selection via Mean-Field Variational Approximation

This article considers Bayesian model selection via mean-field (MF) variational approximation. Towards this goal, we study the non-asymptotic properties of MF inference under the Bayesian framework that allows latent variables and model mis-specification. Concretely, we show a Bernstein von-Mises (BvM) theorem for the variational distribution from MF under possible model mis-specification, which implies the distributional convergence of MF variational approximation to a normal distribution centering at the maximal likelihood estimator (within the specified model). Motivated by the BvM theorem, we propose a model selection criterion using the evidence lower bound (ELBO), and demonstrate that the model selected by ELBO tends to asymptotically agree with the one selected by the commonly used Bayesian information criterion (BIC) as sample size tends to infinity. Comparing to BIC, ELBO tends to incur smaller approximation error to the log-marginal likelihood (a.k.a. model evidence) due to a better dimension dependence and full incorporation of the prior information. Moreover, we show the geometric convergence of the coordinate ascent variational inference (CAVI) algorithm under the parametric model framework, which provides a practical guidance on how many iterations one typically needs to run when approximating the ELBO. These findings demonstrate that variational inference is capable of providing a computationally efficient alternative to conventional approaches in tasks beyond obtaining point estimates, which is also empirically demonstrated by our extensive numerical experiments.

stat.ME↗

arXiv2023

Evaluating residual acceleration noise for TianQin gravitational waves observatory with an empirical magnetic field model

TianQin (TQ) project plans to deploy three satellites in space around the Earth to measure the displacement change of test masses caused by gravitational waves via laser interferometry. The requirement of the acceleration noise of the test mass is on the order of $10^{-15}~\,{\rm m}\,{\rm s}^{-2}\,{\rm Hz}^{-1/2}$ in the sensitive frequency range of TQ, %the extremely precise acceleration measurement requirements make it necessary to investigate acceleration noise due to space magnetic fields. which is so stringent that the acceleration noise caused by the interaction of the space magnetic field with the test mass needs to be investigated. In this work, by using the Tsyganenko model, a data-based empirical space magnetic field model, we obtain the magnetic field distribution around TQ's orbit spanning two solar cycles in 23 years from 1998 to 2020. With the obtained space magnetic field, we derive the distribution and amplitude spectral densities (ASDs) of the acceleration noise of TQ in 23 years. Our results reveal that the average values of the ratio of the acceleration noise cauesd by the space magnetic field to the requirements of TQ at 1 mHz ($R_{\rm 1mHz}$) and 6 mHz ($R_{\rm 6mHz}$) are 0.123$\pm$0.052 and 0.027$\pm$0.013, respectively. The occurence probabilities of $R_{\rm 1mHz}>0.2$ and $>0.3$ are only 7.9% and 1.2%, respectively, and $R_{\rm 6mHz}$ never exceeds 0.2.

astro-ph.IM↗

arXiv2023

EdgeDis: Enabling Fast, Economical, and Reliable Data Dissemination for Mobile Edge Computing

Mobile edge computing (MEC) enables web data caching in close geographic proximity to end users. Popular data can be cached on edge servers located less than hundreds of meters away from end users. This ensures bounded latency guarantees for various latency-sensitive web applications. However, transmitting a large volume of data out of the cloud onto many geographically-distributed web servers individually can be expensive. In addition, web content dissemination may be interrupted by various intentional and accidental events in the volatile MEC environment, which undermines dissemination efficiency and subsequently incurs extra transmission costs. To tackle the above challenges, we present a novel scheme named EdgeDis that coordinates data dissemination by distributed consensus among those servers. We analyze EdgeDis's validity theoretically and evaluate its performance experimentally. Results demonstrate that compared with baseline and state-of-the-art schemes, EdgeDis: 1) is 5.97x - 7.52x faster; 2) reduces dissemination costs by 48.21% to 91.87%; and 3) reduces performance loss caused by dissemination failures by up to 97.30% in time and 96.35% in costs.

cs.DC↗