SearcharxivSearch

arXiv subjects

Huimin Hu

Publications and source records attributed to Huimin Hu.

8 recordsLinked to original sources

Asymptotics of Nonparametric Estimation under General Non-monotone MAR Missingness: A Nonparametric Maximum Likelihood Approach

Missing data constitute a pervasive challenge in empirical research. Consequently, there is an ever-growing number of methods designed to address this challenge, with multiple imputation and inverse probability weighting the dominant strategies. Despite this, theoretical guarantees remain limited, particularly in the challenging case of non-monotone missing at random (MAR). When guarantees exist, they are often confined to simplified settings such as missing completely at random, monotone or block-wise missingness, or rest on restrictive assumptions about the missingness mechanism. In this paper, we utilize the theory of sieve maximum likelihood to establish a general rate of convergence under MAR that requires no modeling of the missingness mechanism and no restriction on the configuration of missing patterns, beyond MAR itself and a natural positivity condition. Applying this result to density estimation, we show that the complete-data density can be estimated at the minimax rate over a H\"older class, up to a logarithmic factor, for any prescribed smoothness level. The missingness does not affect the rate and enters only through a constant. The estimator is approximated in practice by a simple expectation-maximization (EM) algorithm operating on the incomplete data directly. In simulations, it performs comparably to the kernel density estimator supplied with the complete data across a wide range of missingness levels.

stat.ME

DiffTestGen: Change-Directed LLM-Based Testing for Exposing Behavioral Differences

As software evolves over time, it is important to ensure that any behavioral changes occur as intended by developers. A promising approach for this goal is to generate tests that expose behavioral differences between the old and new versions of a program. However, current approaches fail to trigger behavioral differences for many code changes. This paper presents~DiffTestGen, a novel change-directed, LLM-based differential testing approach specifically designed to expose behavioral differences introduced by a code change. The approach is enabled by two key contributions: First, DiffTestGen leverages static call graph analysis and project documentation to identify valid entry points for test generation and to guide the LLM toward reaching the changed code. Second, DiffTestGen iteratively improves our newly introduced union coverage metric, which combines coverage of modified code in the old and the new version, by providing targeted coverage feedback to the LLM. We evaluate DiffTestGen on two datasets comprising a total of 463 PRs. DiffTestGen exposes behavioral differences in 78.2% of the PRs while achieving an average union coverage of 90.7%. Compared with the baselines, DiffTestGen exposes 99 more PRs overall and increases code coverage by 12.5% and 15.6% percentage points, respectively. By integrating DiffTestGen with the Testora regression detector, we show that the identified behavioral differences can be used to detect regression bugs missed by the best existing approaches.

cs.SE

Average AoI in Pinching Antenna-assisted WPCNs with Probabilistic LoS Blockage

This paper analyzes the age of information (AoI) for a pinching antenna (PA)-assisted wireless powered communication network (WPCN) with probabilistic line-of-sight (LoS) blockage. AoI is a key metric for evaluating the freshness of status updates in IoT networks, and its optimization is crucial for ensuring the performance of time-critical applications. To facilitate analysis and gain useful insights, we consider a representative scenario, where an IoT device harvests energy from a base station (BS) equipped with a PA and transmits data packets to it. The IoT device harvests energy via the PA until its capacitor is fully charged, then transmits status updates using all stored energy. We derive closed-form expressions for the average AoI by analyzing the capacitor charging time, transmission success probability, and inter-arrival time of successful updates. To minimize the average AoI, we formulate an optimization problem of PA position, and propose a one-dimensional search to solve it. The simulation results show that the optimal PA position is the one closest to the IoT device, and this conclusion can be extended to the multi-IoT devices frequency division multiple access (FDMA) scenario. The PA-based systems significantly outperform the conventional fixed-antenna systems.

cs.IT

CodeMapper: A Language-Agnostic Approach to Mapping Code Regions Across Commits

During software evolution, developers commonly face the problem of mapping a specific code region from one commit to another. For example, they may want to determine how the condition of an if-statement, a specific line in a configuration file, or the definition of a function changes. We call this the code mapping problem. Existing techniques, such as git diff, address this problem only insufficiently because they show all changes made to a file instead of focusing on a code region of the developer's choice. Other techniques focus on specific code elements and programming languages (e.g., methods in Java), limiting their applicability. This paper introduces CodeMapper, an approach to address the code mapping problem in a way that is independent of specific program elements and programming languages. Given a code region in one commit, CodeMapper finds the corresponding region in another commit. The approach consists of two phases: (i) computing candidate regions by analyzing diffs, detecting code movements, and searching for specific code fragments, and (ii) selecting the most likely target region by calculating similarities. Our evaluation applies CodeMapper to four datasets, including two new hand-annotated datasets containing code region pairs in ten popular programming languages. CodeMapper correctly identifies the expected target region in 71.0%--94.5% of all cases, improving over the best available baselines by 1.5--58.8 absolute percent points.

cs.SE

Spatially Adaptive SWIPT with Pinching Antenna under Probabilistic LoS Blockage

This paper considers a power-splitting (PS)-based simultaneous wireless information and power transfer (SWIPT) system employing a reconfigurable pinching antenna (PA) under probabilistic line-of-sight (LoS) blockage. We formulate a joint optimization of the PA position and PS ratio to maximize the average signal-to-noise ratio (SNR) at the user, subject to its average energy harvesting (EH) and PA placement range. We derive the closed-form solution. Results show that the EH requirement has a deterministic impact on the optimal PA position and its feasible region, requiring the PA close to the user for large channel gain. Moreover, stronger waveguide attenuation lowers the overall SNR and shifts the optimal PA toward the feed point, while heavier LoS blockage degrades the SNR uniformly with little change in the optimal PA position. Spatial PA adaptation combined with dynamic PS ensures robust SWIPT performance, and mechanical reconfigurability enhances sustainability by guaranteeing energy feasibility in dynamic environments.

eess.SP

STAR-RIS Enabled ISAC Systems: Joint Rate Splitting and Beamforming Optimization

This paper delves into an integrated sensing and communication (ISAC) system bolstered by a simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS). Within this system, a base station (BS) is equipped with communication and radar capabilities, enabling it to communicate with ground terminals (GTs) and concurrently probe for echo signals from a target of interest. Moreover, to manage interference and improve communication quality, the rate splitting multiple access (RSMA) scheme is incorporated into the system. The signal-to-interference-plus-noise ratio (SINR) of the received sensing echo signals is a measure of sensing performance. We formulate a joint optimization problem of common rates, transmit beamforming at the BS, and passive beamforming vectors of the STAR-RIS. The objective is to maximize sensing SINR while guaranteeing the communication rate requirements for each GT. We present an iterative algorithm to address the non-convex problem by invoking Dinkelbach's transform, semidefinite relaxation (SDR), majorization-minimization, and sequential rank-one constraint relaxation (SROCR) theories. Simulation results manifest that the performance of the studied ISAC network enhanced by the STAR-RIS and RSMA surpasses other benchmarks considerably. The results evidently indicate the superior performance improvement of the ISAC system with the proposed RSMA-based transmission strategy design and the dynamic optimization of both transmission and reflection beamforming at STAR-RIS.

cs.IT

Bayesian estimation of transmission networks for infectious diseases

Reconstructing transmission networks is essential for identifying key factors like superspreaders and high-risk locations, which are critical for developing effective pandemic prevention strategies. In this study, we developed a Bayesian framework that integrates genomic and temporal data to reconstruct transmission networks for infectious diseases. The Bayesian transmission model accounts for the latent period and differentiates between symptom onset and actual infection time, enhancing the accuracy of transmission dynamics and epidemiological models. Additionally, the model allows for the transmission of multiple pathogen lineages, reflecting the complexity of real-world transmission events more accurately than models that assume a single lineage transmission. Simulation results show that the Bayesian model reliably estimates both the model parameters and the transmission network. Moreover, hypothesis testing effectively identifies direct transmission events. This approach highlights the crucial role of genetic data in reconstructing transmission networks and understanding the origins and transmission dynamics of infectious diseases.

q-bio.QM

Strong convergence of the tamed Euler scheme for scalar SDEs with superlinearly growing and discontinuous drift coefficient

In this paper, we consider scalar stochastic differential equations (SDEs) with a superlinearly growing and piecewise continuous drift coefficient. Existence and uniqueness of strong solutions of such SDEs are obtained. Furthermore, the classical $L_p$-error rate 1/2 for all $p\in [1, +\infty)$ is recovered for the tamed Euler scheme. A numerical example is provided to support our conclusion.

math.PR