arXiv subjects

Ming Yang

Publications and source records attributed to Ming Yang.

At least 91 records · Page 5Linked to original sources

arXiv2026

Cabello's nonlocality argument for multisetting high-dimensional systems and its experimental test

Recent advancements have expanded Hardy's nonlocality arguments into multisetting and multidimensional systems to enhance quantum correlations. In comparison with Hardy's nonlocal argument, Cabello's nonlocal argument (CNA) emerges as a superior choice for illustrating nonlocal features. An open question persists regarding the potential extension of CNA to arbitrary (k, d) scenarios. Here, we answer this question both in theory and experiment. Theoretically, by utilizing compatibility graphs, we construct a new logical framework for multisetting and multidimensional CNA, demonstrating an increase in the maximum successful probability with setting k and dimension d. Experimentally, by employing controllable photonic orbital angular momentum entanglement, we exhibit nonlocality with an experimentally recorded probability of 20.29% in the (2, 4) scenario and 28.72% in the (6, 2) scenario. Our work showcases a sharper contradiction between quantum mechanics and classical theory, surpassing the bound limited by the original version.

quant-ph↗

arXiv2026

RadarXFormer: Robust Object Detection via Cross-Dimension Fusion of 4D Radar Spectra and Images for Autonomous Driving

Reliable perception is essential for autonomous driving systems to operate safely under diverse real-world traffic conditions. However, camera- and LiDAR-based perception systems suffer from performance degradation under adverse weather and lighting conditions, limiting their robustness and large-scale deployment in intelligent transportation systems. Radar-vision fusion provides a promising alternative by combining the environmental robustness and cost efficiency of millimeter-wave (mmWave) radar with the rich semantic information captured by cameras. Nevertheless, conventional 3D radar measurements lack height resolution and remain highly sparse, while emerging 4D mmWave radar introduces elevation information but also brings challenges such as signal noise and large data volume. To address these issues, this paper proposes RadarXFormer, a 3D object detection framework that enables efficient cross-modal fusion between 4D radar spectra and RGB images. Instead of relying on sparse radar point clouds, RadarXFormer directly leverages raw radar spectra and constructs an efficient 3D representation that reduces data volume while preserving complete 3D spatial information. The "X" highlights the proposed cross-dimension (3D-2D) fusion mechanism, in which multi-scale 3D spherical radar feature cubes are fused with complementary 2D image feature maps. Experiments on the K-Radar dataset demonstrate improved detection accuracy and robustness under challenging conditions while maintaining real-time inference capability.

cs.CV↗

arXiv2026

Theory of Cell Body Lensing and Phototaxis Sign Reversal in "Eyeless" Mutants of $Chlamydomonas$

Phototaxis of many species of green algae relies upon directional sensitivity of their membrane-bound photoreceptors, which arises from the presence of a pigmented "eyespot" behind them that blocks light passing through the cell body from reaching the photoreceptor. A decade ago it was discovered that the spherical cell body of the alga $Chlamydomonas~reinhardtii$ acts as a lens to concentrate incoming light, and that in "eyeless" mutants of $Chlamydomonas$ the consequence of that focused light reaching the photoreceptor from behind is a reversal in the sign of phototaxis relative to the wild type behavior. We present a quantitative theory of this sign reversal by completing a recent simplified analysis of lensing [Yang, et al., Phys. Rev. E 113, 022401 (2026)] and incorporating it into an adaptive model for $Chlamydomonas$ phototaxis. This model shows that phototactic dynamics in the presence of lensing is subtle because of the existence of internal light caustics when the cellular index of refraction exceeds that of water. During each period of cellular rotation about its body-fixed axis, the photoreceptor receives two competing signals: a relatively long, slowly-varying signal from the direct illumination, and a stronger, shorter, rapidly-varying lensed signal. The reversal of the sign of phototaxis is then a consequence of the dominance of the flagellar photoresponse to the signal with the higher time derivative. These features lead to a quantitative understanding of phototaxis sign reversal, including bistability in the direction choice, a prediction that can be tested in single-cell tracking studies of mutant phototaxis.

cond-mat.soft↗

arXiv2026

Identifying Red Supergiants in the Local Group Using JWST Photometry. I. NGC 6822, Sextans A, NGC 300, WLM, and IC 1613

Red supergiants (RSGs) are crucial for studying the properties and evolution of massive stars. It is representative to conduct a census of RSGs across the Local Group, which spans a broad metallicity range. However, identifying RSGs in distant and metal-poor galaxies remains challenging mainly due to contamination of foreground dwarfs and observational limitations. In this work, we perform PSF photometry on publicly released JWST/NIRCam images of five Local Group galaxies: NGC 6822, Sextans~A, NGC 300, WLM, and IC 1613 using the DOLPHOT NIRCam module. We find an optimal color-color diagram (CCD) for metal-poor environments, that is F115W $-$ F200W versus F356W $-$ F444W, which clearly separates RSGs from foreground dwarfs. By using the CCD, we identify 208, 135, and 22 RSG candidates in NGC 6822, Sextans A, and NGC 300, respectively, free from contamination by foreground dwarfs and oxygen-rich asymptotic giant branch stars (O-AGBs). In addition, 40 and 14 RSG candidates are directly selected on the CMD in WLM and IC 1613, respectively. Compared with previous works, the number of RSG candidates within the same luminosity range and sky region increases significantly, demonstrating the advantages of JWST in constructing a more complete RSG sample in the Local Group thanks to its high spatial resolution and photometric quality. In addition, catalogs of O-AGBs and carbon-rich AGBs (C-AGBs) are provided as by-products.

astro-ph.GA↗

arXiv2026

Distributional Priors Guided Diffusion for Generating 3D Molecules in Low Data Regimes

Can we train a 3D molecule generator using data from dense regions to generate samples in sparse regions? This challenge can be framed as an out-of-distribution (OOD) generation problem. While prior research on OOD generation predominantly targets property shifts, structural shifts -- such as differences in molecular scaffolds or functional groups -- represent an equally critical source of distributional shifts. This work introduces the Geometric OOD Diffusion Model (GODD), a novel diffusion-based framework that enables training on data-abundant molecular distributions while generalizing to data-scarce distributions under distributional structural shifts. Central to our approach is a designated equivariant asymmetric autoencoder to capture distributional structural priors. The asymmetric design allows the model to generalize to unseen structural variations by capturing distributional priors representing distinct distributions. The encoded structural-grained priors guide generation toward sparse regions without requiring explicit training on such data. Evaluated across standard benchmarks encompassing OOD structural shifts (e.g., scaffolds, rings), GODD achieves an improvement of 12.6% in success rate, defined based on molecular validity, uniqueness, and novelty. Furthermore, the framework demonstrates promising performance and generalization on canonical fragment-based drug design tasks, highlighting its utility in learning-based molecular discovery.

cs.LG↗

arXiv2026

Toward Quantum-Aware Machine Learning: Improved Prediction of Quantum Dissipative Dynamics via Complex Valued Neural Networks

Accurately modeling quantum dissipative dynamics remains challenging due to environmental complexity and non-Markovian memory effects. Although machine learning provides a promising alternative to conventional simulation techniques, most existing models employ real-valued neural networks (RVNNs) that inherently mismatch the complex-valued nature of quantum mechanics. By decoupling the real and imaginary parts of the density matrix, RVNNs can obscure essential amplitude-phase correlations, compromising physical consistency. Here, we introduce complex-valued neural networks (CVNNs) as a physics-consistent framework for learning quantum dissipative dynamics. CVNNs operate directly on complex-valued inputs, preserve the algebraic structure of quantum states, and naturally encode quantum coherences. Through numerical benchmarks on the spin-boson model and several variants of the Fenna-Matthews-Olson complex, we demonstrate that CVNNs outperform RVNNs in convergence speed, training stability, and physical fidelity -- including significantly improved trace conservation and Hermiticity. These advantages increase with system size and coherence complexity, establishing CVNNs as a robust, scalable, quantum-aware classical approach for simulating open quantum systems in the pre-fault-tolerant quantum era.

physics.chem-ph↗

arXiv2026

Zero-Shot UAV Navigation in Forests via Relightable 3D Gaussian Splatting

UAV navigation in unstructured outdoor environments using passive monocular vision is hindered by the substantial visual domain gap between simulation and reality. While 3D Gaussian Splatting enables photorealistic scene reconstruction from real-world data, existing methods inherently couple static lighting with geometry, severely limiting policy generalization to dynamic real-world illumination. In this paper, we propose a novel end-to-end reinforcement learning framework designed for effective zero-shot transfer to unstructured outdoors. Within a high-fidelity simulation grounded in real-world data, our policy is trained to map raw monocular RGB observations directly to continuous control commands. To overcome photometric limitations, we introduce Relightable 3D Gaussian Splatting, which decomposes scene components to enable explicit, physically grounded editing of environmental lighting within the neural representation. By augmenting training with diverse synthesized lighting conditions ranging from strong directional sunlight to diffuse overcast skies, we compel the policy to learn robust, illumination-invariant visual features. Extensive real-world experiments demonstrate that a lightweight quadrotor achieves robust, collision-free navigation in complex forest environments at speeds up to 10 m/s, exhibiting significant resilience to drastic lighting variations without fine-tuning.

cs.CV↗

arXiv2026

General Humanoid Whole-Body Control via Pretraining and Fast Adaptation

Learning a general whole-body controller for humanoid robots remains challenging due to the diversity of motion distributions, the difficulty of fast adaptation, and the need for robust balance in high-dynamic scenarios. Existing approaches often require task-specific training or suffer from performance degradation when adapting to new motions. In this paper, we present FAST, a general humanoid whole-body control framework that enables Fast Adaptation and Stable Motion Tracking. FAST introduces Parseval-Guided Residual Policy Adaptation, which learns a lightweight delta action policy under orthogonality and KL constraints, enabling efficient adaptation to out-of-distribution motions while mitigating catastrophic forgetting. To further improve physical robustness, we propose Center-of-Mass-Aware Control, which incorporates CoM-related observations and objectives to enhance balance when tracking challenging reference motions. Extensive experiments in simulation and real-world deployment demonstrate that FAST consistently outperforms state-of-the-art baselines in robustness, adaptation efficiency, and generalization.

cs.RO↗

arXiv2026

FlattenGPT: Depth Compression for Transformer with Layer Flattening

Recent works have indicated redundancy across transformer blocks, prompting the research of depth compression to prune less crucial blocks. However, current ways of entire-block pruning suffer from risks of discarding meaningful cues learned in those blocks, leading to substantial performance degradation. As another line of model compression, channel pruning can better preserve performance, while it cannot reduce model depth and is challenged by inconsistent pruning ratios for individual layers. To pursue better model compression and acceleration, this paper proposes \textbf{FlattenGPT}, a novel way to detect and reduce depth-wise redundancies. By flatting two adjacent blocks into one, it compresses the network depth, meanwhile enables more effective parameter redundancy detection and removal. FlattenGPT allows to preserve the knowledge learned in all blocks, and remains consistent with the original transformer architecture. Extensive experiments demonstrate that FlattenGPT enhances model efficiency with a decent trade-off to performance. It outperforms existing pruning methods in both zero-shot accuracies and WikiText-2 perplexity across various model types and parameter sizes. On LLaMA-2/3 and Qwen-1.5 models, FlattenGPT retains 90-96\% of zero-shot performance with a compression ratio of 20\%. It also outperforms other pruning methods in accelerating LLM inference, making it promising for enhancing the efficiency of transformers.

cs.CV↗

arXiv2026

Looping Back to Move Forward: Recursive Transformers for Efficient and Flexible Large Multimodal Models

Large Multimodal Models (LMMs) have achieved remarkable success in vision-language tasks, yet their vast parameter counts are often underutilized during both training and inference. In this work, we embrace the idea of looping back to move forward: reusing model parameters through recursive refinement to extract stronger multimodal representations without increasing model size. We propose RecursiveVLM, a recursive Transformer architecture tailored for LMMs. Two key innovations enable effective looping: (i) a Recursive Connector that aligns features across recursion steps by fusing intermediate-layer hidden states and applying modality-specific projections, respecting the distinct statistical structures of vision and language tokens; (ii) a Monotonic Recursion Loss that supervises every step and guarantees performance improves monotonically with recursion depth. This design transforms recursion into an on-demand refinement mechanism: delivering strong results with few loops on resource-constrained devices and progressively improving outputs when more computation resources are available. Experiments show consistent gains of +3% over standard Transformers and +7% over vanilla recursive baselines, demonstrating that strategic looping is a powerful path toward efficient, deployment-adaptive LMMs.

cs.LG↗

arXiv2026

Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints

Constrained optimization with multiple functional inequality constraints has significant applications in machine learning. This paper examines a crucial subset of such problems where both the objective and constraint functions are weakly convex. Existing methods often face limitations, including slow convergence rates or reliance on double-loop algorithmic designs. To overcome these challenges, we introduce a novel single-loop penalty-based stochastic algorithm. Following the classical exact penalty method, our approach employs a {\bf hinge-based penalty}, which permits the use of a constant penalty parameter, enabling us to achieve a {\bf state-of-the-art complexity} for finding an approximate Karush-Kuhn-Tucker (KKT) solution. We further extend our algorithm to address finite-sum coupled compositional objectives, which are prevalent in artificial intelligence applications, establishing improved complexity over existing approaches. Finally, we validate our method through experiments on fair learning with receiver operating characteristic (ROC) fairness constraints and continual learning with non-forgetting constraints.

cs.LG↗

arXiv2026

An item is worth one token in Multimodal Large Language Models-based Sequential Recommendation

Sequential recommendations (SR) predict users' future interactions based on their historical behavior. The rise of Large Language Models (LLMs) has brought powerful generative and reasoning capabilities, significantly enhancing SR performance, while Multimodal LLMs (MLLMs) further extend this by introducing data like images and interactive relationships. However, critical issues remain, i.e., (a) Suboptimal item representations caused by lengthy and redundant descriptions, leading to inefficiencies in both training and inference; (b) Modality-related cognitive bias, as LLMs are predominantly pretrained on textual data, limiting their ability to effectively integrate and utilize non-textual modalities; (c) Weakening sequential perception in long interaction sequences, where attention mechanisms struggle to capture earlier interactions, hindering the modeling of long-range dependencies. To address these issues, we propose Speeder, an efficient MLLM-based paradigm for SR featuring three key innovations: 1) Multimodal Representation Compression (MRC), which condenses item attributes into concise yet informative tokens, reducing redundancy and computational cost; 2) Modality-aware Progressive Optimization (MPO), enabling gradual learning of multimodal representations; 3) Sequential Position Awareness Enhancement (SPAE), improving the LLM's capability to capture both relative and absolute sequential dependencies in long interaction sequences. Extensive experiments on real-world datasets demonstrate the effectiveness and efficiency of Speeder. Speeder increases training speed to 250% of the original while reducing inference time to 25% on the Amazon dataset.

cs.IR↗

arXiv2026

Unexpected type-II multiferroic phase in GdMnO3 under high magnetic fields

Perovskite manganites with small A-site ions, as the first and canonical branch of type-II multiferroics, are ideal systems to exhibit magnetism-induced ferroelectricity. Despite their established magnetoelectric phase diagrams under low magnetic fields, here an unidentified phase with a large magnetism-induced polarization (up to 1500 μC/m2) is revealed in GdMnO3 under high magnetic fields up to 60 T. Based on multiprobe experiments, a complete phase diagram is constructed with successive polar-nonpolar-polar-nonpolar transitions. Such a nonmonotonic evolution is well mimicked by model simulation, while the spin-lattice coupling is the key ingredient for the reentrant ferroelectric phase.

cond-mat.mtrl-sci↗

arXiv2026

Explainable Molecular Property Prediction: Aligning Chemical Concepts with Predictions via Language Models

Providing explainable molecular property predictions is critical for many scientific domains, such as drug discovery and material science. Though transformer-based language models have shown great potential in accurate molecular property prediction, they neither provide chemically meaningful explanations nor faithfully reveal the molecular structure-property relationships. In this work, we develop a framework for explainable molecular property prediction based on language models, dubbed as Lamole, which can provide chemical concepts-aligned explanations. We take a string-based molecular representation -- Group SELFIES -- as input tokens to pretrain and fine-tune our Lamole, as it provides chemically meaningful semantics. By disentangling the information flows of Lamole, we propose combining self-attention weights and gradients for better quantification of each chemically meaningful substructure's impact on the model's output. To make the explanations more faithfully respect the structure-property relationship, we then carefully craft a marginal loss to explicitly optimize the explanations to be able to align with the chemists' annotations. We bridge the manifold hypothesis with the elaborated marginal loss to prove that the loss can align the explanations with the tangent space of the data manifold, leading to concept-aligned explanations. Experimental results over six mutagenicity datasets and one hepatotoxicity dataset demonstrate Lamole can achieve comparable classification accuracy and boost the explanation accuracy by up to 14.3%, being the state-of-the-art in explainable molecular property prediction.

cs.LG↗

arXiv2026

Crystalline Material Discovery in the Era of Artificial Intelligence

Crystalline materials, with symmetrical and periodic structures, exhibit a wide spectrum of properties and have been widely used in numerous applications across electronics, energy, and beyond. For crystalline materials discovery, traditional experimental and computational approaches are time-consuming and expensive. In these years, thanks to the explosive amount of crystalline materials data, great interest has been given to data-driven materials discovery. Particularly, recent advancements have exploited the expressive representation ability of deep learning to model the highly complex atomic systems within crystalline materials, opening up new avenues for fast and accurate materials discovery. These works typically focus on four types of tasks, including physicochemical property prediction, crystalline material synthesis, aiding characterization, and accelerating theoretical computations. Despite the remarkable progress, there is still a lack of systematic investigation to summarize their distinctions and limitations. To fill this gap, we systematically investigated the progress made in recent years. We first introduce several data representations of the crystalline materials. Based on the representations, we summarize various fundamental deep learning models and their tailored usages in various material discovery tasks. Finally, we highlight the remaining challenges and propose future directions.

cs.CE↗

arXiv2026

Performance Bounds of Joint Detection with Kalman Filtering and Channel Decoding for Wireless Networked Control Systems

The joint detection uses Kalman filtering (KF) to estimate the prior probability of control outputs to assist channel decoding. In this paper, we regard the joint detection as maximum a posteriori (MAP) decoding and derive the lower and upper bounds based on the pairwise error probability considering system interference, quantization interval, and weight distribution. We first derive the limiting bounds as the signal-to-noise ratio (SNR) goes to infinity and the system interference goes to zero. Then, we construct an infinite-state Markov chain to describe the consecutive packet losses of the control systems to derive the MAP bounds. Finally, the MAP bounds are approximated as the bounds of the transition probability from the state with no packet loss to the state with consecutive single packet loss. The simulation results show that the MAP performance of $\left(64,16\right)$ polar code and 16-bit CRC coincides with the limiting upper bound as the SNR increases and has $3.0$dB performance gain compared with the normal approximation of the finite block rate at block error rate $10^{-3}$.

cs.IT↗

arXiv2026

Learning Diffusion Policy from Primitive Skills for Robot Manipulation

Diffusion policies (DP) have recently shown great promise for generating actions in robotic manipulation. However, existing approaches often rely on global instructions to produce short-term control signals, which can result in misalignment in action generation. We conjecture that the primitive skills, referred to as fine-grained, short-horizon manipulations, such as ``move up'' and ``open the gripper'', provide a more intuitive and effective interface for robot learning. To bridge this gap, we propose SDP, a skill-conditioned DP that integrates interpretable skill learning with conditional action planning. SDP abstracts eight reusable primitive skills across tasks and employs a vision-language model to extract discrete representations from visual observations and language instructions. Based on them, a lightweight router network is designed to assign a desired primitive skill for each state, which helps construct a single-skill policy to generate skill-aligned actions. By decomposing complex tasks into a sequence of primitive skills and selecting a single-skill policy, SDP ensures skill-consistent behavior across diverse tasks. Extensive experiments on two challenging simulation benchmarks and real-world robot deployments demonstrate that SDP consistently outperforms SOTA methods, providing a new paradigm for skill-based robot learning with diffusion policies.

cs.RO↗

arXiv2025

Interfacial Polarons Driven by Charge Transfer In WSe2/Cuprate Superconductor Systems

Understanding the electronic properties of doped copper-oxygen planes remains a significant challenge in condensed matter physics and is crucial to unraveling the mechanisms behind high-temperature superconductivity in cuprates. Recently, the observation of charge transfer and interfacial polarons in superconducting interface has aroused extensive research interest. However, experimental data to investigate charge transfer on the CuO2 plane and the presence of polarons are still missing. Here we conduct extensive research on the optical and electronic properties of two-dimensional material supported on copper-based superconductors. Unlike monolayer-WSe2 on other substrates, monolayer-WSe2 on La1.85Sr0.15CuO4 (WSe2/LSCO) produces a special band structure. Using high-resolution spectroscopic ellipsometry and density functional theory calculation methods, the special electronic structure can be attributed to the formation of the interfacial small polaron at the WSe2/LSCO interface which is driven by charge transfer between the CuO2 plane of the cuprate superconductor and WSe2. In addition, the structural phase transition of the LSCO substrate was observed to reduce the electron-hole (e-h) interaction of WSe2. These findings may spur future investigations on the effect of the interfacial polaron on the superconductivity of cuprates, and highlight the significant influence of interface effects on the electronic structure of WSe2 films. It provides an effective method to further explore the intrinsic relationship between interfacial polarons and superconductivity.

cond-mat.supr-con↗