arXiv subjects

Yang Yang

Publications and source records attributed to Yang Yang.

At least 343 records · Page 19Linked to original sources

arXiv2025

Expectation-Maximization as the Engine of Scalable Medical Intelligence

Large, high-quality, annotated datasets are the foundation of medical AI research, but constructing even a small, moderate-quality, annotated dataset can take years of effort from multidisciplinary teams. Although active learning can prioritize what to annotate, scaling up still requires extensive manual efforts to revise the noisy annotations. We formulate this as a missing-data problem and develop ScaleMAI, a framework that unifies data annotation and model development co-evolution through an Expectation-Maximization (EM) process. In this iterative process, the AI model automatically identifies and corrects the mistakes in annotations (Expectation), while the refined annotated data retrain the model to improve accuracy (Maximization). In addition to the classical EM algorithm, ScaleMAI brings human experts into the loop to review annotations that cannot be adequately addressed by either Expectation or Maximization step (<5%). As a result, ScaleMAI progressively creates an annotated dataset of 47,315 CT scans (4.8x larger than the largest public dataset, PanTS) including 4,163,720 per-voxel annotations for benign/malignant tumors and 88 anatomical structures. ScaleMAI iteratively trains a model that exceeds human expert performance in tumor diagnosis (+7%), and outperforms models developed from smaller, moderate-quality datasets, with statistically significant gains in tumor detection (+10%) and segmentation (+14%) on two prestigious benchmarks.

cs.CV↗

arXiv2025

See More, Change Less: Anatomy-Aware Diffusion for Contrast Enhancement

Image enhancement improves visual quality and helps reveal details that are hard to see in the original image. In medical imaging, it can support clinical decision-making, but current models often over-edit. This can distort organs, create false findings, and miss small tumors because these models do not understand anatomy or contrast dynamics. We propose SMILE, an anatomy-aware diffusion model that learns how organs are shaped and how they take up contrast. It enhances only clinically relevant regions while leaving all other areas unchanged. SMILE introduces three key ideas: (1) structure-aware supervision that follows true organ boundaries and contrast patterns; (2) registration-free learning that works directly with unaligned multi-phase CT scans; (3) unified inference that provides fast and consistent enhancement across all contrast phases. Across six external datasets, SMILE outperforms existing methods in image quality (14.2% higher SSIM, 20.6% higher PSNR, 50% better FID) and in clinical usefulness by producing anatomically accurate and diagnostically meaningful images. SMILE also improves cancer detection from non-contrast CT, raising the F1 score by up to 10 percent.

cs.CV↗

arXiv2025

Anomalous coarsening and nonlinear diffusion of kinks in an one-dimensional quasi-classical Holstein model

We study the phase-ordering dynamics of a quasi-classical Holstein model. At half-filling, the zero-temperature ground state is a commensurate charge-density-wave (CDW) with alternating occupied and empty sites. This quasi-classical formulation enables us to isolate the role of electrons in coarsening dynamics. Following a thermal quench, CDW domains grow through the diffusion and annihilation of kinks -- topological defects separating the two symmetry-related CDW orders. While standard diffusive dynamics predicts domain sizes scaling as the square root of time, our large-scale simulations reveal a slower power-law growth with a temperature-dependent exponent. We trace this anomalous behavior to a cooperative kink hopping arising from Fermi-Dirac statistics of electrons and quasi-conservation of electron numbers. The correlated-hopping of kinks in turn gives rise to an effective diffusion coefficient that depends on the kink density. These results uncover a new mechanism for slow coarsening and carry implications for phase-ordering in the full Holstein model and related electron-phonon systems.

cond-mat.stat-mech↗

arXiv2025

Anisotropic linear magnetoresistance in nanoflakes of Dirac semimetal NiTe2

This work investigates the magneto-transport properties of exfoliated NiTe2 nano-flakes with varying thicknesses and disorder levels, unveiling two distinct physical mechanisms governing the observed anisotropic linear magnetoresistance (MR). For the perpendicular magnetic field configuration, the well-defined linear MR in high fields is unambiguously attributed to a classical origin. This conclusion is supported by the proportionality between the MR slope and the carrier mobility, and between the crossover field and the inverse of mobility. In stark contrast, the linear MR under parallel magnetic fields exhibits a non-classical character. It shows a pronounced enhancement with decreasing flake thickness, which correlates with an increasing hole-to-electron concentration ratio. This distinctive thickness dependence suggests an origin in the nonlinear band effects near the Dirac point, likely driven by the shift of the Fermi level. Furthermore, the strengthening of MR anisotropic with enhanced inter-layer transport contradicts the prediction of the guiding-center diffusion model for three-dimensional systems. Our findings highlight the critical roles of band topology and structural dimensional in the anomalous magneto-transport of Dirac semi-metals.

cond-mat.mes-hall↗

arXiv2025

Robust low-rank tensor regression via clipping and Huber loss

In this paper, we construct a parameter estimation framework for robust low-rank tensor regression based on a truncation method and Huber loss, specifically focusing on models with random noise having only finite second-order moments. Through a robust gradient descent method, our proposed Huber-type estimator is theoretically optimal in two aspects: (1) its statistical error rate matches the optimal upper bound established for the traditional least squares method under sub-Gaussian error; and (2) the sample complexity for recovering the tensor parameter is also optimal. Extensive numerical experiments demonstrate the robustness of our estimator, indicating that the utilization of truncation and Huber loss significantly enhances stability and statistical effectiveness, outperforming the traditional least squares method. Additionally, the phenomenon of phase transition in the convergence rate of the proposed estimator is confirmed through simulation. Furthermore, applications to image recovery and the Beijing air-quality dataset demonstrate the practical effectiveness of our method.

math.ST↗

arXiv2025

Universal Sensitivity Bound for Thermal Quantum Dynamic Sensing

This work unifies the equilibrium and non-equilibrium frameworks of quantum metrology within the context of many-body systems. We investigate dynamic sensing schemes to derive an upper bound on the quantum Fisher information for probe states in thermal equilibrium with their environment. We establish that the dynamic quantum Fisher information for a thermal probe state is upper bounded by the degree of non-commutation between the transformed local generator and the Hamiltonian for the thermal state. Furthermore, we show that this upper bound scales as the square of the product of the inverse temperature and the evolution time. In the low-temperature limit, we establish an additional upper bound expressed as the seminorm of the commutator divided by the energy gap. We apply this thermal dynamic sensing scheme to various models, demonstrating that the dynamic quantum Fisher information satisfies the established upper bounds.

quant-ph↗

arXiv2025

Hyperion: Hierarchical Scheduling for Parallel LLM Acceleration in Multi-tier Networks

LLMs are increasingly executed in edge where limited GPU memory and heterogeneous computation jointly constrain deployment which motivates model partitioning and request scheduling. In this setting, minimizing latency requires addressing the tight coupling between model placement and request scheduling across heterogeneous nodes, as suboptimal decisions in one domain can negate benefits in the other. In this paper, we propose Hyperion, a hierarchical two-stage framework that jointly optimizes partitioning and scheduling for pipelined LLM inference. Hyperion minimizes latency by balancing resources across tiers without requiring model retraining or incurring significant runtime overhead. Leveraging the timescale difference between partitioning and request arrivals, Stage 1 performs offline, inter-tier partitioning via a Hyperion Split with Dynamic Programming (HypSplit-DP) procedure to produce balanced stage times under tier capacity and memory constraints; to adapt to time-varying load, Stage 2 performs online, intra-tier scheduling with a lightweight Hyperion Scheduling for Real-Time (HypSched-RT) that maps each request to the best available node using real-time estimates of queue length and effective capacity. Experiments with Phi-3-medium demonstrate that Hyperion reduces latency by up to 52.1% (vs. GPipe) and 31.2% (vs. HEFT). Furthermore, Hyperion exhibits superior scalability for long-sequence generation, maintaining 44.5% lower latency and higher GPU utilization.

cs.DC↗

arXiv2025

HarmoCLIP: Harmonizing Global and Regional Representations in Contrastive Vision-Language Models

Contrastive Language-Image Pre-training (CLIP) has demonstrated remarkable generalization ability and strong performance across a wide range of vision-language tasks. However, due to the lack of region-level supervision, CLIP exhibits limited fine-grained semantic understanding. Although several methods attempt to mitigate this issue, they unintentionally disrupt the global alignment, resulting in a persistent trade-off where improving local perception simultaneously degrades global coherence. In this paper, we propose HarmoCLIP, a novel framework designed to harmonize global and region representations within CLIP. We first identify that the absence of direct alignment between local textual and visual semantics is the fundamental cause of the trade-off. To address this, HarmoCLIP introduces an explicit fine-grained semantic supervision term that directly aligns textual segments with their corresponding visual regions, effectively bridging the image region space and the textual space. To further strengthen the representation capability at the local level, our method introduces a novel Region-Language Alignment supervision strategy that promotes fine-grained semantic learning without compromising global semantic consistency. Extensive experiments demonstrate that HarmoCLIP achieves state-of-the-art (improvement up to 69.78%) performance on the global task of retrieval and yields a substantial 3.2% improvement in Top-1 accuracy on the region task of bounding-box classification, consistently outperforming prior approaches while providing a balanced, efficient, and plug-and-play solution to the global-local trade-off in CLIP. Code is available at https://github.com/Erosist/HarmoCLIP.

cs.CV↗

arXiv2025

CameraMaster: Unified Camera Semantic-Parameter Control for Photography Retouching

Text-guided diffusion models have greatly advanced image editing and generation. However, achieving physically consistent image retouching with precise parameter control (e.g., exposure, white balance, zoom) remains challenging. Existing methods either rely solely on ambiguous and entangled text prompts, which hinders precise camera control, or train separate heads/weights for parameter adjustment, which compromises scalability, multi-parameter composition, and sensitivity to subtle variations. To address these limitations, we propose CameraMaster, a unified camera-aware framework for image retouching. The key idea is to explicitly decouple the camera directive and then coherently integrate two critical information streams: a directive representation that captures the photographer's intent, and a parameter embedding that encodes precise camera settings. CameraMaster first uses the camera parameter embedding to modulate both the camera directive and the content semantics. The modulated directive is then injected into the content features via cross-attention, yielding a strongly camera-sensitive semantic context. In addition, the directive and camera embeddings are injected as conditioning and gating signals into the time embedding, enabling unified, layer-wise modulation throughout the denoising process and enforcing tight semantic-parameter alignment. To train and evaluate CameraMaster, we construct a large-scale dataset of 78K image-prompt pairs annotated with camera parameters. Extensive experiments show that CameraMaster produces monotonic and near-linear responses to parameter variations, supports seamless multi-parameter composition, and significantly outperforms existing methods.

cs.CV↗

arXiv2025

Elasto-plastic cell-based smoothed finite element method solving geotechnical problems

This work develops an elasto-plastic cell-based smoothed finite element method (CSFEM) for geotechnical analysis. The formulation incorporates a smoothed strain field into the standard elasto-plastic framework based on the Mohr-Coulomb criterion and is implemented in ABAQUS through a user-defined element (UEL). A UEL-UMAT data-transfer strategy is introduced to enable post-processing of stress and strain in ABAQUS. The method is assessed using several benchmark problems, including three classical examples, a tunnel excavation, and a slope stability analysis. The results show that the CSFEM achieves accuracy comparable to or slightly better than the conventional FEM and matches analytical or reference solutions for the examined cases. These findings indicate that the proposed CSFEM provides a practical and robust alternative for routine elasto-plastic analyses in geotechnical engineering.

math.NA↗

arXiv2025

Efficient thermal simulation in metal additive manufacturing via semi-analytical isogeometric analysis

Thermal modeling of Laser Powder Bed Fusion (LPBF) is challenging due to steep, rapidly moving thermal gradients induced by the laser, which are difficult to resolve accurately with conventional Finite Element Methods. Highly refined, dynamically adaptive spatial discretization is typically required, leading to prohibitive computational costs. Semi-analytical approaches mitigate this by decomposing the temperature field into an analytical point-source solution and a complementary numerical field that enforces boundary conditions. However, state-of-the-art implementations either necessitate extensive mesh refinement near boundaries or rely on restrictive image source techniques, limiting their efficiency and applicability to complex geometries. This study presents a novel reformulation of the semi-analytical framework using Isogeometric Analysis. The laser heat input is captured by the analytical point-source solution, while the complementary correction field, which imposes boundary conditions, is solved using a spline-based IGA discretization. The governing heat equation for the correction field is cast in a weak form, discretized with NURBS basis functions, and advanced in time using an implicit $θ$-scheme. This approach leverages IGA's key advantages: exact geometry representation, higher-order continuity, and superior accuracy per degree of freedom. These features unlock efficient thermal modeling of realistic parts with complex contours. Our strategy eliminates the need for scan-wise remeshing and robustly handles intricate geometric features like sharp corners and varying cross-sections. Numerical examples demonstrate that the proposed semi-analytical IGA method delivers accurate temperature predictions and achieves substantial computational efficiency gains compared to standard FEM, establishing it as a powerful new tool for high-fidelity thermal simulation in LPBF.

math.NA↗

arXiv2025

SA-Person: Text-Based Person Retrieval with Scene-aware Re-ranking

Text-based person retrieval aims to identify a target individual from an image gallery using a natural language description. Existing methods primarily focus on appearance-driven cross-modal retrieval, yet face significant challenges due to the visual complexity of scenes and the inherent ambiguity of textual descriptions. The contextual information, such as landmarks and relational cues, provides complementary cues that can offer valuable complementary insights for retrieval, but remains underexploited in current approaches. Motivated by this limitation, we propose a novel paradigm: scene-aware text-based person retrieval, which explicitly integrates both individual appearance and global scene context to improve retrieval accuracy. To support this, we first introduce ScenePerson-13W, a large-scale benchmark dataset comprising over 100,000 real-world scenes with rich annotations encompassing both pedestrian attributes and scene context. Based on this dataset, we further present SA-Person, a two-stage retrieval framework. In the first stage, SA-Person performs discriminative appearance grounding by aligning textual descriptions with pedestrian-specific regions. In the second stage, it introduces SceneRanker, a training-free, scene-aware re-ranking module that refines retrieval results by jointly reasoning over pedestrian appearance and the global scene context. Extensive experiments on ScenePerson-13W and existing benchmarks demonstrate the effectiveness of our proposed SA-Person. Both the dataset and code will be publicly released to facilitate future research.

cs.CV↗

arXiv2025

RELEAP: Reinforcement-Enhanced Label-Efficient Active Phenotyping for Electronic Health Records

Objective: Electronic health record (EHR) phenotyping often relies on noisy proxy labels, which undermine the reliability of downstream risk prediction. Active learning can reduce annotation costs, but most rely on fixed heuristics and do not ensure that phenotype refinement improves prediction performance. Our goal was to develop a framework that directly uses downstream prediction performance as feedback to guide phenotype correction and sample selection under constrained labeling budgets. Materials and Methods: We propose Reinforcement-Enhanced Label-Efficient Active Phenotyping (RELEAP), a reinforcement learning-based active learning framework. RELEAP adaptively integrates multiple querying strategies and, unlike prior methods, updates its policy based on feedback from downstream models. We evaluated RELEAP on a de-identified Duke University Health System (DUHS) cohort (2014-2024) for incident lung cancer risk prediction, using logistic regression and penalized Cox survival models. Performance was benchmarked against noisy-label baselines and single-strategy active learning. Results: RELEAP consistently outperformed all baselines. Logistic AUC increased from 0.774 to 0.805 and survival C-index from 0.718 to 0.752. Using downstream performance as feedback, RELEAP produced smoother and more stable gains than heuristic methods under the same labeling budget. Discussion: By linking phenotype refinement to prediction outcomes, RELEAP learns which samples most improve downstream discrimination and calibration, offering a more principled alternative to fixed active learning rules. Conclusion: RELEAP optimizes phenotype correction through downstream feedback, offering a scalable, label-efficient paradigm that reduces manual chart review and enhances the reliability of EHR-based risk prediction.

cs.LG↗

arXiv2025

RTMol: Rethinking Molecule-text Alignment in a Round-trip View

Aligning molecular sequence representations (e.g., SMILES notations) with textual descriptions is critical for applications spanning drug discovery, materials design, and automated chemical literature analysis. Existing methodologies typically treat molecular captioning (molecule-to-text) and text-based molecular design (text-to-molecule) as separate tasks, relying on supervised fine-tuning or contrastive learning pipelines. These approaches face three key limitations: (i) conventional metrics like BLEU prioritize linguistic fluency over chemical accuracy, (ii) training datasets frequently contain chemically ambiguous narratives with incomplete specifications, and (iii) independent optimization of generation directions leads to bidirectional inconsistency. To address these issues, we propose RTMol, a bidirectional alignment framework that unifies molecular captioning and text-to-SMILES generation through self-supervised round-trip learning. The framework introduces novel round-trip evaluation metrics and enables unsupervised training for molecular captioning without requiring paired molecule-text corpora. Experiments demonstrate that RTMol enhances bidirectional alignment performance by up to 47% across various LLMs, establishing an effective paradigm for joint molecule-text understanding and generation.

cs.AI↗

arXiv2025

Self-Supervised Discriminative Feature Learning for Deep Multi-View Clustering

Multi-view clustering is an important research topic due to its capability to utilize complementary information from multiple views. However, there are few methods to consider the negative impact caused by certain views with unclear clustering structures, resulting in poor multi-view clustering performance. To address this drawback, we propose self-supervised discriminative feature learning for deep multi-view clustering (SDMVC). Concretely, deep autoencoders are applied to learn embedded features for each view independently. To leverage the multi-view complementary information, we concatenate all views' embedded features to form the global features, which can overcome the negative impact of some views' unclear clustering structures. In a self-supervised manner, pseudo-labels are obtained to build a unified target distribution to perform multi-view discriminative feature learning. During this process, global discriminative information can be mined to supervise all views to learn more discriminative features, which in turn are used to update the target distribution. Besides, this unified target distribution can make SDMVC learn consistent cluster assignments, which accomplishes the clustering consistency of multiple views while preserving their features' diversity. Experiments on various types of multi-view datasets show that SDMVC outperforms 14 competitors including classic and state-of-the-art methods. The code is available at https://github.com/SubmissionsIn/SDMVC.

cs.LG↗

arXiv2025

DINO-Detect: A Simple yet Effective Framework for Blur-Robust AI-Generated Image Detection

With growing concerns over image authenticity and digital safety, the field of AI-generated image (AIGI) detection has progressed rapidly. Yet, most AIGI detectors still struggle under real-world degradations, particularly motion blur, which frequently occurs in handheld photography, fast motion, and compressed video. Such blur distorts fine textures and suppresses high-frequency artifacts, causing severe performance drops in real-world settings. We address this limitation with a blur-robust AIGI detection framework based on teacher-student knowledge distillation. A high-capacity teacher (DINOv3), trained on clean (i.e., sharp) images, provides stable and semantically rich representations that serve as a reference for learning. By freezing the teacher to maintain its generalization ability, we distill its feature and logit responses from sharp images to a student trained on blurred counterparts, enabling the student to produce consistent representations under motion degradation. Extensive experiments benchmarks show that our method achieves state-of-the-art performance under both motion-blurred and clean conditions, demonstrating improved generalization and real-world applicability. Source codes will be released at: https://github.com/JiaLiangShen/Dino-Detect-for-blur-robust-AIGC-Detection.

cs.CV↗

arXiv2025

Fine-Grained Representation for Lane Topology Reasoning

Precise modeling of lane topology is essential for autonomous driving, as it directly impacts navigation and control decisions. Existing methods typically represent each lane with a single query and infer topological connectivity based on the similarity between lane queries. However, this kind of design struggles to accurately model complex lane structures, leading to unreliable topology prediction. In this view, we propose a Fine-Grained lane topology reasoning framework (TopoFG). It divides the procedure from bird's-eye-view (BEV) features to topology prediction via fine-grained queries into three phases, i.e., Hierarchical Prior Extractor (HPE), Region-Focused Decoder (RFD), and Robust Boundary-Point Topology Reasoning (RBTR). Specifically, HPE extracts global spatial priors from the BEV mask and local sequential priors from in-lane keypoint sequences to guide subsequent fine-grained query modeling. RFD constructs fine-grained queries by integrating the spatial and sequential priors. It then samples reference points in RoI regions of the mask and applies cross-attention with BEV features to refine the query representations of each lane. RBTR models lane connectivity based on boundary-point query features and further employs a topological denoising strategy to reduce matching ambiguity. By integrating spatial and sequential priors into fine-grained queries and applying a denoising strategy to boundary-point topology reasoning, our method precisely models complex lane structures and delivers trustworthy topology predictions. Extensive experiments on the OpenLane-V2 benchmark demonstrate that TopoFG achieves new state-of-the-art performance, with an OLS of 48.0 on subsetA and 45.4 on subsetB.

cs.CV↗

arXiv2025

BSO: Binary Spiking Online Optimization Algorithm

Binary Spiking Neural Networks (BSNNs) offer promising efficiency advantages for resource-constrained computing. However, their training algorithms often require substantial memory overhead due to latent weights storage and temporal processing requirements. To address this issue, we propose Binary Spiking Online (BSO) optimization algorithm, a novel online training algorithm that significantly reduces training memory. BSO directly updates weights through flip signals under the online training framework. These signals are triggered when the product of gradient momentum and weights exceeds a threshold, eliminating the need for latent weights during training. To enhance performance, we propose T-BSO, a temporal-aware variant that leverages the inherent temporal dynamics of BSNNs by capturing gradient information across time steps for adaptive threshold adjustment. Theoretical analysis establishes convergence guarantees for both BSO and T-BSO, with formal regret bounds characterizing their convergence rates. Extensive experiments demonstrate that both BSO and T-BSO achieve superior optimization performance compared to existing training methods for BSNNs. The codes are available at https://github.com/hamings1/BSO.

cs.LG↗