Search arXiv⌕ Search

arXiv subjects

Yuan Liang

Publications and source records attributed to Yuan Liang.

At least 19 recordsLinked to original sources

Complementary Roles of Radiomics and Foundation Representations in Renal Cell Carcinoma Classification: A Comparative Study of 2D and 3D CT Encodings

Accurate preoperative subtype classification of renal cell carcinoma (RCC) from contrast-enhanced computed tomography remains clinically challenging. Radiomics provides structured tumour descriptors, whereas foundation representations offer transferable image features. However, it remains unclear whether radiomics still adds value beyond pretrained representations, and how 2D and 3D MedVAE encoders compare in this setting. We compared handcrafted radiomics, 2D MedVAE, 3D MedVAE, and their fusion for binary clear-cell RCC versus non-clear-cell RCC classification on KiTS23 under a unified preprocessing pipeline. Concatenation, cross-attention, and gated fusion were evaluated as representative integration strategies, and radiomics feature importance was analysed to support decision-centric interpretability. Fusion consistently improved discrimination over image-only MedVAE branches. The best overall performance was achieved by 3D gated fusion, with an AUC of 82.7\%, outperforming the best 2D fusion model (79.6%), the radiomics baseline (74.4%), and the single-modality MedVAE branches. Ablation analysis further showed clear gains of the full fusion model over both image-only and radiomics-only variants, indicating complementary contributions from radiomics and image representations. These findings suggest that radiomics remains relevant for RCC CT classification in the presence of foundation representations, and that its integration with MedVAE is more effective in the 3D setting. More broadly, the study supports a complementary role for radiomics and foundation representations in clinically meaningful imaging decision support.

cs.CV↗

Radiomics-Conditioned Modulation of RenalCLIP Features for Clear Cell Renal Cell Carcinoma Classification

Radiomics provides quantitative descriptions of tumour appearance that may complement disease-specific foundation models in small labelled cohorts. We investigate this complementarity for computed tomography-based classification of clear cell renal cell carcinoma. Our framework uses radiomics to modulate RenalCLIP features through feature-wise linear modulation (FiLM), while retaining a direct radiomics contribution. Internal testing and external validation compare it with conventional fusion strategies and reference classifiers. The FiLM model achieves an area under the receiver operating characteristic curve (AUC) of 0.804 internally and 0.854 externally, with the highest mean AUC among the evaluated RenalCLIP fusion strategies in both cohorts. Pathway ablations examine the contributions of conditional modulation and the direct radiomics residual, while feature permutation highlights the role of tumour texture. These findings support radiomics as a useful complement to RenalCLIP in a small labelled cohort and identify FiLM as an effective approach to integrating their representations for robust renal tumour classification.

cs.CV↗

Radiomics--Foundation Fusion for Interpretable RCC Classification: Internal Benchmarking and Exploratory External Transfer

Accurate preoperative subtype classification of renal cell carcinoma (RCC) from contrast-enhanced CT remains clinically challenging because clear cell RCC (ccRCC) and non-clear cell RCC often show overlapping imaging appearances. This study evaluates whether foundation representations reduce reliance on handcrafted radiomics, or whether radiomics remains complementary for interpretable tumour characterisation. We compared radiomics, conventional CNN features, MedicalNet-pretrained features, MedVAE representations, and fusion variants for binary ccRCC classification on KiTS23, reporting area under the receiver operating characteristic curve (AUC) with bootstrap confidence intervals and average precision (AP) as a complementary class-imbalance-sensitive metric. We further assessed branch-removal ablation, TCGA/AIMI external transfer, and interpretability using radiomics permutation importance and gate-level analysis. Internally, 3D MedVAE gated fusion achieved the best performance, with an AUC of 82.7% and AP of 92.2%. On the external TCGA cohort, the same model achieved an AUC of 79.5% and AP of 98.9%, although specificity remains uncertain because only two external non-ccRCC cases were available. Gate analysis showed a radiomics-dominant fusion regime, suggesting that foundation representations acted as case-dependent refinement signals rather than replacements for structured tumour descriptors. These findings support radiomics as a complementary and clinically interpretable component of CT-based RCC characterisation in the foundation-model era.

cs.CV↗

Age and Mass Signatures in the Multiband Second-order Image Structure of Young Star Clusters in M31

The ages and masses of star clusters may leave systematic signatures in the second-order spatial structure of semi-resolved photometric images. To test this hypothesis, we analyze the images using the Hessian matrix and identify basic luminous structures, termed peak cores. Applying this analysis to six-band PHAT/AP images of 1249 M31 clusters with CMD-based ages of 10--300 Myr and masses of $10^{2.2}$--$10^{4.5}\,M_{\odot}$, we examine the correlations of age and mass with the peak-core structural parameters, $C_S$ and $Q$. Younger clusters show larger $C_S$ values in the ultraviolet bands, with the strongest age--$C_S$ anti-correlation in F336W ($ρ=-0.61$), whereas more massive clusters show smaller $Q$ values, most clearly in F336W ($ρ=-0.44$). These correlations suggest that the contrast of UV-bright peak cores decreases with age, whereas increasing mass alters the abundance and spatial organization of detectable structures across different bands.

astro-ph.GA↗

Hessian-based photometric substructure as an evolutionary tracer of OB cluster candidates in M31

Using \textit{Hubble Space Telescope} images from the PHAT and PHAST surveys, we construct an updated catalogue of 747 OB cluster (OBC) candidates. We introduce a dimensionless structural metric, the trace coefficient of variation ($CV_{\rm tr}$), derived from the Hessian matrix in four \textit{HST} bands, to quantify the internal photometric substructure of partially resolved OBC candidates. Cross-matching with the subset of M31 clusters that have independent colour--magnitude diagram (CMD) age estimates yields 247 objects in common. We find statistically significant anti-correlations between $CV_{\rm tr}$ and age in the UV and blue bands, suggesting a progressive smoothing of the light distribution as clusters evolve. Bootstrap resampling confirms the robustness of these trends. Forward modelling of synthetic clusters analysed with the same pipeline recovers a monotonic $CV_{\rm tr}$--age relation under simplified but physically motivated assumptions. These results show that second-order photometric structure contains measurable evolutionary information within the CMD-calibrated regime ($\sim10$--300~Myr).

astro-ph.GA↗

SkillNet: Create, Evaluate, and Connect AI Skills

Current AI agents can flexibly invoke tools and execute complex tasks, yet their long-term advancement is hindered by the lack of systematic accumulation and transfer of skills. Without a unified mechanism for skill consolidation, agents frequently ``reinvent the wheel'', rediscovering solutions in isolated contexts without leveraging prior strategies. To address this challenge, we introduce SkillNet, an open infrastructure for creating, evaluating, and organizing AI skills at scale. SkillNet structures skills within a unified ontology that supports creating skills from heterogeneous sources, establishing rich relational connections, and performing multi-dimensional evaluation across Safety, Completeness, Executability, Maintainability, and Cost-awareness. Our infrastructure integrates a repository of over 600,000 skills, an interactive platform, and a versatile Python toolkit. Experiments on ALFWorld, WebShop, and ScienceWorld show 40% higher average rewards and 30% fewer execution steps across multiple backbone models. Furthermore, SkillNet-Gym benchmarks skill retrieval, utilization, and composition, while SkillNet-Fabric enables task-specific skill routing through lightweight Wikis. By formalizing skills as evolving, composable assets, SkillNet provides a robust foundation for agents to move from transient experience to durable mastery.

cs.AI↗

Topology Matters: Measuring Memory Leakage in Multi-Agent LLMs

Graph topology is a fundamental determinant of memory leakage in multi-agent LLM systems, yet its effects remain poorly quantified. We introduce MAMA (Multi-Agent Memory Attack), a controlled evaluation framework for comparing topology-conditioned memory leakage in multi-agent LLM systems. MAMA operates on synthetic documents containing labeled Personally Identifiable Information (PII) entities, from which we generate sanitized task instructions. We execute a two-phase protocol: Engram (seeding private information into a target agent's memory) and Resonance (multi-round interaction where an attacker attempts extraction). Over 10 rounds, we measure leakage using a two-stage recovery criterion that combines exact-match extraction with LLM-based inference over the attacker's final output. We evaluate six canonical topologies (complete, circle, chain, tree, star, star-ring) across $n\in\{4,5,6\}$, attacker-target placements, and base models. Results are consistent: denser connectivity, shorter attacker-target distance, and higher target centrality increase leakage; most leakage occurs in early rounds and then plateaus; model choice shifts absolute rates but preserves broad structural trends; spatiotemporal/location attributes leak more readily than identity credentials or regulated identifiers. We distill practical guidance for system design: favor sparse or hierarchical connectivity, maximize attacker-target separation, and restrict hub/shortcut pathways via topology-aware access control. Our code is available at https://github.com/llll121/mama-eval.

cs.CR↗

Cast3: Translating numerical weather prediction principles into data-driven forecasting

Data-driven weather models have made rapid advances in recent years, reaching and in some metrics surpassing the large-scale forecast skill of operational numerical weather prediction. This progress, however, has been built almost entirely on the reanalysis data that NWP produced, while the methodological knowledge that the NWP community distilled over decades of multi-scale atmospheric modelling remains largely unused. Here we present Cast3, a generative forecasting framework that systematically absorbs NWP meta-knowledge to close this gap. Cast3 operates on variable-resolution cubed-sphere grids for scale-aware representation and constructs structurally diverse super-ensembles that sample the complementary biases of different grid discretizations, delivering state-of-the-art ensemble prediction. It further introduces generative nudging, a posterior-sampling strategy that distils the collective information of the full ensemble into a single forecast possessing both the large-scale accuracy of the ensemble mean and the mesoscale realism of a high-resolution member. Evaluated across synoptic-scale skill, spectral fidelity, station-level surface verification, and tropical cyclone prediction, Cast3 outperforms established deterministic and generative baselines across various dimensions. More broadly, these results demonstrate that the design principles embedded in computational atmospheric science offer a rich and largely untapped foundation for the next generation of data-driven Earth system modelling.

physics.ao-ph↗

A Python/CuPy Software Correlator for QUEST: Real-Time Performance and Initial Imaging

We present a Python/CuPy FX software correlator for small radio interferometer arrays and evaluate it on QUEST (Qilu University Explorer Survey Telescope). The system combines multi-threaded data ingest, pinned-memory host-device transfers, GPU-accelerated correlation, Polyphase Filter Bank channelization, MAD-based RFI flagging, and delay/phase calibration in a single workflow aimed at array commissioning. On a single NVIDIA RTX 4090D GPU, the implementation reaches a peak throughput of 1.51 GB/s, which is sufficient for real-time operation in the four-antenna mode tested here. After calibration, the visibility phase across a clean 1.32-1.38 GHz band is flattened to a residual scatter of a few degrees. Using the calibrated visibilities, we form a four-antenna synthesis image of Cassiopeia A; the CLEANed image recovers a compact source at the phase center and reduces image-domain background fluctuations from order 0.1 to a few 0.01 Jy/beam. These results indicate that the software is suitable for small-array commissioning and initial synthesis imaging on QUEST. A GNSS-based beam measurement is included as a supporting commissioning check.

astro-ph.IM↗

Memp: Exploring Agent Procedural Memory

Large Language Models (LLMs) based agents excel at diverse tasks, yet they suffer from brittle procedural memory that is manually engineered or entangled in static parameters. In this work, we investigate strategies to endow agents with a learnable, updatable, and lifelong procedural memory. We propose Memp that distills past agent trajectories into both fine-grained, step-by-step instructions and higher-level, script-like abstractions, and explore the impact of different strategies for Build, Retrieval, and Update of procedural memory. Coupled with a dynamic regimen that continuously updates, corrects, and deprecates its contents, this repository evolves in lockstep with new experience. Empirical evaluation on TravelPlanner and ALFWorld shows that as the memory repository is refined, agents achieve steadily higher success rates and greater efficiency on analogous tasks. Moreover, procedural memory built from a stronger model retains its value: migrating the procedural memory to a weaker model can also yield substantial performance gains. Code is available at https://github.com/zjunlp/MemP.

cs.CL↗

Towards Personalized Deep Research: Benchmarks and Evaluations

Deep Research Agents (DRAs) can autonomously conduct complex investigations and generate comprehensive reports, demonstrating strong real-world potential. However, existing evaluations mostly rely on close-ended benchmarks, while open-ended deep research benchmarks remain scarce and typically neglect personalized scenarios. To bridge this gap, we introduce Personalized Deep Research Bench (PDR-Bench), the first benchmark for evaluating personalization in DRAs. It pairs 50 diverse research tasks across 10 domains with 25 authentic user profiles that combine structured persona attributes with dynamic real-world contexts, yielding 250 realistic user-task queries. To assess system performance, we propose the PQR Evaluation Framework, which jointly measures Personalization Alignment, Content Quality, and Factual Reliability. Our experiments on a range of systems highlight current capabilities and limitations in handling personalized deep research. This work establishes a rigorous foundation for developing and evaluating the next generation of truly personalized AI research assistants.

cs.CL↗

O-Mem: Omni Memory System for Personalized, Long Horizon, Self-Evolving Agents

Recent advancements in LLM-powered agents have demonstrated significant potential in generating human-like responses; however, they continue to face challenges in maintaining long-term interactions within complex environments, primarily due to limitations in contextual consistency and dynamic personalization. Existing memory systems often depend on semantic grouping prior to retrieval, which can overlook semantically irrelevant yet critical user information and introduce retrieval noise. In this report, we propose the initial design of O-Mem, a novel memory framework based on active user profiling that dynamically extracts and updates user characteristics and event records from their proactive interactions with agents. O-Mem supports hierarchical retrieval of persona attributes and topic-related context, enabling more adaptive and coherent personalized responses. O-Mem achieves 51.67% on the public LoCoMo benchmark, a nearly 3% improvement upon LangMem,the previous state-of-the-art, and it achieves 62.99% on PERSONAMEM, a 3.5% improvement upon A-Mem,the previous state-of-the-art. O-Mem also boosts token and interaction response time efficiency compared to previous memory frameworks. Our work opens up promising directions for developing efficient and human-like personalized AI assistants in the future.

cs.CL↗

ASTROFLOW: A Real-Time End-to-End Pipeline for Radio Single-Pulse Searches

Fast radio bursts (FRBs) are extremely bright, millisecond duration cosmic transients of unknown origin. The growing number of wide-field and high-time-resolution radio surveys, particularly with next-generation facilities such as the SKA and MeerKAT, will dramatically increase FRB discovery rates, but also produce data volumes that overwhelm conventional search pipelines. Real-time detection thus demands software that is both algorithmically robust and computationally efficient. We present Astroflow, an end-to-end, GPU-accelerated pipeline for single-pulse detection in radio time-frequency data. Built on a unified C++/CUDA core with a Python interface, Astroflow integrates RFI excision, incoherent dedispersion, dynamic-spectrum tiling, and a YOLO-based deep detector. Through vectorized memory access, shared-memory tiling, and OpenMP parallelism, it achieves 10x faster-than-real-time processing on consumer GPUs for a typical 150 s, 2048-channel observation, while preserving high sensitivity across a wide range of pulse widths and dispersion measures. These results establish the feasibility of a fully integrated, GPU-accelerated single-pulse search stack, capable of scaling to the data volumes expected from upcoming large-scale surveys. Astroflow offers a reusable and deployable solution for real-time transient discovery, and provides a framework that can be continuously refined with new data and models.

astro-ph.IM↗

Improving LLMs' Learning for Coreference Resolution

Coreference Resolution (CR) is crucial for many NLP tasks, but existing LLMs struggle with hallucination and under-performance. In this paper, we investigate the limitations of existing LLM-based approaches to CR-specifically the Question-Answering (QA) Template and Document Template methods and propose two novel techniques: Reversed Training with Joint Inference and Iterative Document Generation. Our experiments show that Reversed Training improves the QA Template method, while Iterative Document Generation eliminates hallucinations in the generated source text and boosts coreference resolution. Integrating these methods and techniques offers an effective and robust solution to LLM-based coreference resolution.

cs.CL↗

A comprehensive catalogue of OB cluster candidates in M31 and their association with giant molecular clouds

We present a new catalogue of 578 OB cluster (OBC) candidates in the Andromeda galaxy (M31), identified using a MeanShift-based algorithm on HST's F275W-band imaging from the PHAT (Dalcanton et al. 2012) and PHAST (Chen et al. 2025) Hubble surveys. These clusters exhibit typical half-light radii of 1-2 pc and strong ultraviolet luminosities indicative of recent massive star formation. Spatial analysis reveals a pronounced north-south asymmetry: clusters in the northern disc show tight associations with giant molecular clouds (GMCs), while southern clusters appear more compact and luminous but less correlated with molecular gas. Two-point correlation functions demonstrate significant clustering of OBC candidates on scales 100 pc and a strong spatial association with GMCs, consistent with hierarchical star formation in dense gas-rich environments. These findings offer new constraints on the early evolution and feedback-driven dispersal of young stellar clusters across galactic discs.

astro-ph.GA↗

NeuroDx-LM: A Clinical Large-Scale Model for EEG-based Neurological Disorder Detection

Large-scale models pre-trained on Electroencephalography (EEG) have shown promise in clinical applications such as neurological disorder detection. However, the practical deployment of EEG-based large-scale models faces critical challenges such as limited labeled EEG data and suboptimal performance in clinical scenarios. To address these issues, we propose NeuroDx-LM, a novel large-scale model specifically designed for detecting EEG-based neurological disorders. Our key contributions include (i) a Selective Temporal-Frequency Embedding mechanism that adaptively captures complex temporal and spectral patterns in EEG signals; and (ii) a Progressive Feature-Aware Training strategy that refines feature representation in a two-stage process. In the first stage, our model learns the fundamental discriminative features of EEG activities; in the second stage, the model further extracts more specialized fine-grained features for accurate diagnostic performance. We evaluated NeuroDx-LM on the CHB-MIT and Schizophrenia datasets, achieving state-of-the-art performance in EEG-based seizure and schizophrenia detection, respectively. These results demonstrate the great potential of EEG-based large-scale models to advance clinical applicability. Our code is available at https://github.com/LetItBe12345/NeuroDx-LM.

cs.LG↗

FRAM: Frobenius-Regularized Assignment Matching with Mixed-Precision Computing

Graph matching, typically formulated as a Quadratic Assignment Problem (QAP), seeks to establish node correspondences between two graphs. To address the NP-hardness of QAP, some existing methods adopt projection-based relaxations that embed the problem into the convex hull of the discrete domain. However, these relaxations inevitably enlarge the feasible set, introducing two sources of error: numerical scale sensitivity and geometric misalignment between the relaxed and original domains. To alleviate these errors, we propose a novel relaxation framework by reformulating the projection step as a Frobenius-regularized Linear Assignment (FRA) problem, where a tunable regularization term mitigates feasible region inflation. This formulation enables normalization-based operations to preserve numerical scale invariance without compromising accuracy. To efficiently solve FRA, we propose the Scaling Doubly Stochastic Normalization (SDSN) algorithm. Building on its favorable computational properties, we develop a theoretically grounded mixed-precision architecture to achieve substantial acceleration. Comprehensive CPU-based benchmarks demonstrate that FRAM consistently outperforms all baseline methods under identical precision settings. When combined with a GPU-based mixed-precision architecture, FRAM achieves up to 370X speedup over its CPU-FP64 counterpart, with negligible loss in solution accuracy.

cs.LG↗

Fusing Radiomic Features with Deep Representations for Gestational Age Estimation in Fetal Ultrasound Images

Accurate gestational age (GA) estimation, ideally through fetal ultrasound measurement, is a crucial aspect of providing excellent antenatal care. However, deriving GA from manual fetal biometric measurements depends on the operator and is time-consuming. Hence, automatic computer-assisted methods are demanded in clinical practice. In this paper, we present a novel feature fusion framework to estimate GA using fetal ultrasound images without any measurement information. We adopt a deep learning model to extract deep representations from ultrasound images. We extract radiomic features to reveal patterns and characteristics of fetal brain growth. To harness the interpretability of radiomics in medical imaging analysis, we estimate GA by fusing radiomic features and deep representations. Our framework estimates GA with a mean absolute error of 8.0 days across three trimesters, outperforming current machine learning-based methods at these gestational ages. Experimental results demonstrate the robustness of our framework across different populations in diverse geographical regions. Our code is publicly available on \href{https://github.com/13204942/RadiomicsImageFusion_FetalUS}.

eess.IV↗