Searcharxiv⌕ Search

arXiv subjects

Rong Hu

Publications and source records attributed to Rong Hu.

At least 19 recordsLinked to original sources
arXiv2026

ObGynLongBench: Revealing the Evidence-to-EHR Gap in Longitudinal EHR Decision-Making

The application of large language models (LLMs) to personalized medical assistants has garnered growing interest. However, existing medical benchmarks largely rely on static question answering with pre-selected evidence, leaving unclear whether LLMs can make reliable clinical decisions from real longitudinal electronic health records (EHRs). To bridge this gap, we introduce ObGynLongBench, a rule-grounded long-context EHR benchmark for obstetric and gynecologic decision-making, comprising 1,500 clinical decision-point cases from 976 real pregnancy EHR histories and traceable rules. Each case is anchored to a patient, a pregnancy-timeline point, and a pre-decision information boundary, enabling Evidence-only, Visit-level EHR, and History-level EHR evaluation. Evaluating 17 LLMs reveals a substantial Evidence-to-EHR Gap: models perform well when evidence is directly provided, but accuracy drops when evidence must be extracted from same-day records or full pre-decision EHR histories. Further analyses identify evidence utilization as a key bottleneck: performance decreases with longer EHR contexts and more complex evidence requirements, and earlier failures often predict later failures within the same patient history. Finally, active-search agents perform best among EHR access strategies, highlighting patient-specific evidence utilization as a central challenge for reliable personalized medical assistants. Resources are available at https://github.com/xiangjun2003/ObgynLongbench.

cs.CL↗
arXiv2026

Coordinated Disentanglement with Iterative Mode Discovery Under Hidden Correlations

Disentangled representation learning is a powerful paradigm for robust attribute prediction. While recent methods address attribute correlations, hidden correlations remain underexplored, where data under the value of a certain attribute exhibit underlying modes correlated with other attributes. To preserve mode information and achieve disentanglement, we jointly discover modes and enforce mode-based conditional independence. Yet, the interdependency between these two modules may lead to error amplification under naive iterations. We propose Coordinated Disentanglement with Iterative mode Discovery (CoDID), an end-to-end framework featuring a dynamic architecture that adapts to evolving number of modes, and a coordination mechanism that mitigates error amplification via meta-optimization. Empirical results demonstrate the state-of-the-art performance on diverse tasks.

cs.AI↗
arXiv2026

Moir\'e Strain Skyrmions in Sliding Twisted Bilayers

Strain defect is crucial to the physical properties of solid materials. Among them, strain glass induced by defect engineering provides an important paradigm for nanoscale domain manipulation. Here, we propose purely mechanical moir\'e strain Skyrmions, a topologically protected elastic textures whose motion can be controlled by interlayer sliding and the chirality of the moir\'e bilayer. Using an empirical continuum elastic model combined with symmetry analysis, we demonstrate the Skyrmion lattice structure as the elastic ground state. Under interlayer sliding, these moir\'e strain Skyrmions exhibit the Skyrmion Hall effect of transverse motion, with a Hall angle determined by bilayer chirality and inversely proportional to the moir\'e twist angle. Our work establishes interlayer sliding as an efficient, low-energy control knob for topological excitations, offering a new paradigm for designing chiral-material-based information transport devices.

cond-mat.mtrl-sci↗
arXiv2026

Annotation-free deep learning for detection and segmentation of fetal germinal matrix-intraventricular hemorrhage in brain MRI

Prenatal germinal matrix-intraventricular hemorrhage (GMH-IVH) is a leading cause of infant mortality and neurodevelopmental impairment, yet its manual diagnosis and lesion segmentation on fetal brain MRI are labor-intensive and error-prone. Although supervised deep learning offers potential for automation, it typically requires large amounts of annotated GMH-IVH data, which are challenging to obtain for such a rare condition (0.5-0.9 per 1000 pregnancies). To address these problems, an annotation-free deep learning framework, FreeHemoSeg, was developed for automated detection and segmentation of GMH-IVH without any real patient annotations. Instead of learning from expert labels, FreeHemoSeg was trained on pseudo GMH-IVH images synthesized from normal fetal data guided by medical priors. The framework was evaluated in a retrospective multicentre study of 1,674 stacks of 2D T2-weighted MRI from 558 pregnant women, using data from one hospital for internal training and validation and two hospitals for external validation. FreeHemoSeg achieved the highest diagnostic and segmentation performance in both internal validation (AUROC: 0.959; AUPR: 0.928; sensitivity: 0.914; specificity: 0.966; DSC: 0.559) and external validation (AUROC: 0.930; AUPR: 0.884; sensitivity: 0.824; specificity: 0.943; DSC: 0.512), outperforming a supervised model trained on limited empirical data and unsupervised anomaly detection methods. Moreover, FreeHemoSeg assistance improved radiologists' sensitivity (from 0.882 to 0.941-1.000) and diagnostic confidence, while reducing interpretation time by 16.0-52.7%. We anticipate its immediate utility in supporting earlier diagnosis, prognostic counselling, and perinatal planning for fetal GMH-IVH. Code: https://github.com/Arktis2022/FreeHemoSeg.

eess.IV↗
arXiv2025

Zero-Dimensional Stacking Domains Enable Strong-Ductile Synergy in Additive Manufactured Titanium

Alloying by addition of oxygen interstitials during additive manufacturing provides new routes to strengthen and toughen metals and alloys. The underlying mechanisms by which such interstitial atoms lead to enhanced properties remain, however, unclear, not least due a lack of quantitative atomic-scale models linking microstructure to properties. Here using quasi-3D imaging based on multi-slice electron ptychography, we reveal the importance of a new type of interstitial-character lattice defect, namely zero-dimensional stacking domains (ZDSDs), present in high density in AM-processed oxygen-modulated pure titanium. These ZDSDs promote slip diversity, and support intense work hardening, enabling a three-fold enhancement in both strength and ductility in Ti-0.45O compared to conventional pure Ti. The work demonstrates the potential for using interstitial solutes to enhance mechanical properties in a range of critical engineering alloys.

cond-mat.mtrl-sci↗
arXiv2025

Interface-Controlled Antiferromagnetic Tunnel Junctions based on a metallic van der Waals A-type Antiferromagnet

Magnetic tunnel junctions (MTJs) are crucial components in high-performance spintronic devices. Traditional MTJs rely on ferromagnetic (FM) materials but significant improvements in speed and packing density could be enabled by exploiting antiferromagnetic (AFM) compounds instead. Here, we report all-collinear AFM tunnel junctions (AFMTJs) fabricated with van der Waals A-type AFM metal (Fe0.6Co0.4)5GeTe2 (FCGT) electrodes and nonmagnetic semiconducting WSe2 tunnel barriers. The AFMTJ heterostructure device achieves a tunneling magnetoresistance (TMR) ratio of up to 75% in response to magnetic field switching. Our results demonstrate that the TMR exclusively emerges in the AFM state of FCGT, rather than during the AFM-to-FM transition. By engineering FCGT electrodes with either even- or odd-layer configurations, volatile or non-volatile TMR could be selected, consistent with an entirely interfacial effect. TMR in the even-layer devices arose by N\'eel vector switching. In the odd-layer devices, TMR stemmed from interfacial spin-flipping. Experimental and theoretical analyses reveal a new TMR mechanism associated with interface-driven spin-polarized transport, despite the spin-independent nature of bulk FCGT. Our work demonstrates that collinear AFMTJs can provide comparable performance to conventional MTJs and introduces a new paradigm for AFM spintronics, in which the spin-dependent properties of AFM interfaces are harnessed.

cond-mat.mes-hall↗
arXiv2025

Q-learning-based Hierarchical Cooperative Local Search for Steelmaking-continuous Casting Scheduling Problem

The steelmaking continuous casting scheduling problem (SCCSP) is a critical and complex challenge in modern steel production, requiring the coordinated assignment and sequencing of steel charges across multiple production stages. Efficient scheduling not only enhances productivity but also significantly reduces energy consumption. However, both traditional heuristics (e.g., two-stage local search) and recent metaheuristics often struggle to adapt to the dynamic characteristics of practical SCCSP instances. To address these limitations, this paper introduces a novel Q learning based hierarchical cooperative local search framework, termed HierC_Q, aimed at minimizing the weighted sum of the maximum completion time and the average waiting time in SCCSP. The core contributions of HierC_Q are twofold. First, considering the intrinsic coupling properties of the SCCSP, a dedicated reward function is proposed based on a novel coupling measure (CM), guiding the exploration process towards promising regions of the solution space. Second, a hierarchical architecture is devised, comprising two distinct tiers: the learn to improve (L2I) tier and the "disturb to renovate" (D2R) tier. The L2I tier performs deep exploitation within promising regions using two independent Q-learning-based local search frameworks (QLSFs) tailored for subproblems, along with a synergy QLSF designed for the main problem. To enhance the effectiveness of local search, a validity evaluation approach and a speed-up evaluation method are also intro-duced, grounded in a detailed study of the problem's structure. Meanwhile, the D2R tier incorporates a perturbation and construction based solution renewal strategy to mitigate the risk of premature convergence. The superiority and effectiveness of HierC_Q are demonstrated through extensive comparisons with eleven local search frameworks and nine state-of-the-art algorithms.

eess.SY↗
arXiv2025

Data-Driven Optimization of EV Charging Station Placement Using Causal Discovery

This paper addresses the critical challenge of optimizing electric vehicle charging station placement through a novel data-driven methodology employing causal discovery techniques. While traditional approaches prioritize economic factors or power grid constraints, they often neglect empirical charging patterns that ultimately determine station utilization. We analyze extensive charging data from Palo Alto and Boulder (337,344 events across 100 stations) to uncover latent relationships between station characteristics and utilization. Applying structural learning algorithms (NOTEARS and DAGMA) to this data reveals that charging demand is primarily determined by three factors: proximity to amenities, EV registration density, and adjacency to high-traffic routes. These findings, consistent across multiple algorithms and urban contexts, challenge conventional infrastructure distribution strategies. We develop an optimization framework that translates these insights into actionable placement recommendations, identifying locations likely to experience high utilization based on the discovered dependency structures. The resulting site selection model prioritizes strategic clustering in high-amenity areas with substantial EV populations rather than uniform spatial distribution. Our approach contributes a framework that integrates empirical charging behavior into infrastructure planning, potentially enhancing both station utilization and user convenience. By focusing on data-driven insights instead of theoretical distribution models, we provide a more effective strategy for expanding charging networks that can adjust to various stages of EV market development.

cs.LG↗
arXiv2025

The S-PLUS Ultra-Short Survey: Photometric Re-calibration with the BEst STar Database

We present an independent validation and comprehensive re-calibration of S-PLUS Ultra-Short Survey (USS) DR1 12-band photometry using about 30,000--70,000 standard stars from the BEst STar (BEST) database. We identify spatial variation of zero-point offsets, up to 30--40\,mmag for blue filters ($u$, $J0378$, $J0395$) and 10\,mmag for others, predominantly due to the higher uncertainties of the technique employed in the original USS calibration. Moreover, we detect large- and medium-scale CCD position-dependent systematic errors, up to 50\,mmag, primarily caused by different aperture and flat-field corrections. We then re-calibrate the USS DR1 photometry by correcting the systematic shifts for each tile using second-order two-dimensional polynomial fitting combined with a numerical stellar flat-field correction method. The re-calibrated results from the XPSP and the SCR standards are consistent within 6\,mmag in the USS zero-points, demonstrating both the typical precision of re-calibrated USS photometry and a sixfold improvement in USS zero-point precision. Further validation using SDSS and Pan-STARRS1, as well as LAMOST DR10 and Gaia photometry, also confirms this precision for the re-calibrated USS photometry. Our results clearly demonstrate the capability and the efficiency of the BEST database in improving calibration precision to the milli-magnitude level for wide-field photometric surveys. The re-calibrated USS DR1 photometry is publicly available: doi: 10.12149/101503 (https://nadc.china-vo.org/res/r101504/).

astro-ph.GA↗
arXiv2024

A General Mixed-Order Primal-Dual Dynamical System with Tikhonov Regularization

In a Hilbert space, we propose a class of general mixed-order primal-dual dynamical systems with Tikhonov regularization for a convex optimization problem with linear equality constraints. The proposed dynamical system is characterized by three time-dependent parameters, i.e., general viscous damping, time scaling, and Tikhonov regularization coefficients, which can incorporate as special cases some existing mixed-order primal-dual dynamical systems in the literature. With some appropriate conditions on the parameters, we analyze by constructing suitable Lyapunov functions the asymptotic convergence properties of the proposed dynamical system, where a convergence rate of O(1/(t^2\beta(t))) for the objective function error and a convergence rate of o(1/\beta(t)) for the primal-dual gap are established. Moreover, we further prove the strong convergence of the trajectory generated by the proposed dynamical system. Finally, we carry out some numerical experiments to illustrate the obtained theoretical results of the proposed dynamical system.

math.OC↗
arXiv2024

Boosting Cybersecurity Vulnerability Scanning based on LLM-supported Static Application Security Testing

The current cybersecurity landscape is increasingly complex, with traditional Static Application Security Testing (SAST) tools struggling to capture complex and emerging vulnerabilities due to their reliance on rule-based matching. Meanwhile, Large Language Models (LLMs) have demonstrated powerful code analysis capabilities, but their static training data and privacy risks limit their effectiveness. To overcome the limitations of both approaches, we propose LSAST, a novel approach that integrates LLMs with SAST scanners to enhance vulnerability detection. LSAST leverages a locally hostable LLM, combined with a state-of-the-art knowledge retrieval system, to provide up-to-date vulnerability insights without compromising data privacy. We set a new benchmark for static vulnerability analysis, offering a robust, privacy-conscious solution that bridges the gap between traditional scanners and advanced AI-driven analysis. Our evaluation demonstrates that incorporating SAST results into LLM analysis significantly improves detection accuracy, identifying vulnerabilities missed by conventional methods.

cs.CR↗
arXiv2024

Strong asymptotic convergence of a slowly damped inertial primal-dual dynamical system controlled by a Tikhonov regularization term

We propose a slowly damped inertial primal-dual dynamical system controlled by a Tikhonov regularization term, where the inertial term is introduced only for the primal variable, for the linearly constrained convex optimization problem in a Hilbert space. Under mild conditions on the underlying parameters, by a Lyapunov analysis approach, we prove the strong asymptotic convergence of the trajectory of the proposed dynamic to the minimal norm element of the primal-dual solution set of the problem, along with convergence rate results for the primal-dual gap, the objective residual and the feasibility violation. We perform some numerical experiments to illustrate the theoretical findings.

math.OC↗
arXiv2024

DEGAP: Dual Event-Guided Adaptive Prefixes for Templated-Based Event Argument Extraction with Slot Querying

Recent advancements in event argument extraction (EAE) involve incorporating useful auxiliary information into models during training and inference, such as retrieved instances and event templates. These methods face two challenges: (1) the retrieval results may be irrelevant and (2) templates are developed independently for each event without considering their possible relationship. In this work, we propose DEGAP to address these challenges through a simple yet effective components: dual prefixes, i.e. learnable prompt vectors, where the instance-oriented prefix and template-oriented prefix are trained to learn information from different event instances and templates. Additionally, we propose an event-guided adaptive gating mechanism, which can adaptively leverage possible connections between different events and thus capture relevant information from the prefix. Finally, these event-guided prefixes provide relevant information as cues to EAE model without retrieval. Extensive experiments demonstrate that our method achieves new state-of-the-art performance on four datasets (ACE05, RAMS, WIKIEVENTS, and MLEE). Further analysis shows the impact of different components.

cs.CL↗
arXiv2024

Fast convergence rates and trajectory convergence of a Tikhonov regularized inertial primal\mbox{-}dual dynamical system with time scaling and vanishing damping

A Tikhonov regularized inertial primal\mbox{-}dual dynamical system with time scaling and vanishing damping is proposed for solving a linearly constrained convex optimization problem in Hilbert spaces. The system under consideration consists of two coupled second order differential equations and its convergence properties depend upon the decaying speed of the product of the time scaling parameter and the Tikhonov regularization parameter (named the rescaled regularization parameter) to zero. When the rescaled regularization parameter converges rapidly to zero, the system enjoys fast convergence rates of the primal-dual gap, the feasibility violation, the objective residual, and the gradient norm of the objective function along the trajectory, and the weak convergence of the trajectory to a primal-dual solution of the linearly constrained convex optimization problem. When the rescaled regularization parameter converges slowly to zero, the generated primal trajectory converges strongly to the minimal norm solution of the problem under suitable conditions. Finally, numerical experiments are performed to illustrate the theoretical findings.

math.OC↗
arXiv2023

A second order dynamical system method for solving a maximal comonotone inclusion problem

In this paper a second order dynamical system model is proposed for computing a zero of a maximal comonotone operator in Hilbert spaces. Under mild conditions, we prove existence and uniqueness of a strong global solution of the proposed dynamical system. A proper tuning of the parameters can allow us to establish fast convergence properties of the trajectories generated by the dynamical system. The weak convergence of the trajectory to a zero of the maximal comonotone operator is also proved. Furthermore, a discrete version of the dynamical system is considered and convergence properties matching to that of the dynamical system are established under a same framework. Finally, the validity of the proposed dynamical system and its discrete version is demonstrated by two numerical examples.

math.OC↗
arXiv2023

Tikhonov regularized second-order plus first-order primal-dual dynamical systems with asymptotically vanishing damping for linear equality constrained convex optimization problems

In this paper, in the setting of Hilbert spaces, we consider a Tikhonov regularized second-order plus first-order primal-dual dynamical system with asymptotically vanishing damping for a linear equality constrained convex optimization problem. The convergence properties of the proposed dynamical system depend heavily upon the choice of the Tikhonov regularization parameter. When the Tikhonov regularization parameter decreases rapidly to zero, we establish the fast convergence rates of the primal-dual gap, the objective function error, the feasibility measure, and the gradient norm of the objective function along the trajectory generated by the system. When the Tikhonov regularization parameter tends slowly to zero, we prove that the primal trajectory of the Tikhonov regularized dynamical system converges strongly to the minimal norm solution of the linear equality constrained convex optimization problem. Numerical experiments are performed to illustrate the efficiency of our approach.

math.OC↗
arXiv2022

SWL-Adapt: An Unsupervised Domain Adaptation Model with Sample Weight Learning for Cross-User Wearable Human Activity Recognition

In practice, Wearable Human Activity Recognition (WHAR) models usually face performance degradation on the new user due to user variance. Unsupervised domain adaptation (UDA) becomes the natural solution to cross-user WHAR under annotation scarcity. Existing UDA models usually align samples across domains without differentiation, which ignores the difference among samples. In this paper, we propose an unsupervised domain adaptation model with sample weight learning (SWL-Adapt) for cross-user WHAR. SWL-Adapt calculates sample weights according to the classification loss and domain discrimination loss of each sample with a parameterized network. We introduce the meta-optimization based update rule to learn this network end-to-end, which is guided by meta-classification loss on the selected pseudo-labeled target samples. Therefore, this network can fit a weighting function according to the cross-user WHAR task at hand, which is superior to existing sample differentiation rules fixed for special scenarios. Extensive experiments on three public WHAR datasets demonstrate that SWL-Adapt achieves the state-of-the-art performance on the cross-user WHAR task, outperforming the best baseline by an average of 3.1% and 5.3% in accuracy and macro F1 score, respectively.

eess.SP↗