Search arXiv⌕ Search

arXiv subjects

Cheng Zhang

Publications and source records attributed to Cheng Zhang.

At least 127 records · Page 7Linked to original sources

Decouple, Reorganize, and Fuse: A Multimodal Framework for Cancer Survival Prediction

Cancer survival analysis commonly integrates information across diverse medical modalities to make survival-time predictions. Existing methods primarily focus on extracting different decoupled features of modalities and performing fusion operations such as concatenation, attention, and \revm{Mixture-of-Experts (MoE)-based fusion. However, these methods still face two key challenges: i) Fixed fusion schemes (concatenation and attention) can lead to model over-reliance on predefined feature combinations, limiting the dynamic fusion of decoupled features; ii) in MoE-based fusion methods, each expert network handles separate decoupled features, which limits information interaction among the decoupled features. To address these challenges, we propose a novel Decoupling-Reorganization-Fusion framework (DeReF), which devises a random feature reorganization strategy between modalities decoupling and dynamic MoE fusion modules.Its advantages are: i) it increases the diversity of feature combinations and granularity, enhancing the generalization ability of the subsequent expert networks; ii) it overcomes the problem of information closure and helps expert networks better capture information among decoupled features. Additionally, we incorporate a regional cross-attention network within the modality decoupling module to improve the representation quality of decoupled features. Extensive experimental results on our in-house Liver Cancer (LC) and three widely used TCGA public datasets confirm the effectiveness of our proposed method. Codes are available at https://github.com/ZJUMAI/DeReF.

cs.CV↗

μTouch: Enabling Accurate, Lightweight Self-Touch Sensing with Passive Magnets

Self-touch gestures (e.g., nuanced facial touches and subtle finger scratches) provide rich insights into human behaviors, from hygiene practices to health monitoring. However, existing approaches fall short in detecting such micro gestures due to their diverse movement patterns. This paper presents μTouch, a novel magnetic sensing platform for self-touch gesture recognition. μTouch features (1) a compact hardware design with low-power magnetometers and magnetic silicon, (2) a lightweight semi-supervised framework requiring minimal user data, and (3) an ambient field detection module to mitigate environmental interference. We evaluated μTouch in two representative applications in user studies with 11 and 12 participants. μTouch only requires three-second fine-tuning data for each gesture, and new users need less than one minute before starting to use the system. μTouch can distinguish eight different face-touching behaviors with an average accuracy of 93.41%, and reliably detect body-scratch behaviors with an average accuracy of 94.63%. μTouch demonstrates accurate and robust sensing performance even after a month, showcasing its potential as a practical tool for hygiene monitoring and dermatological health applications. Code is available at https://wangmerlyn.github.io/muTouch/.

cs.HC↗

Linearly Polarized Photon Fusion as a Precision Probe of the Tau Lepton Dipole Moments at Lepton Colliders

We present a comprehensive investigation into the anomalous magnetic dipole moment ($a_τ$) and electric dipole moment ($d_τ$) of the $τ$ lepton using the $γγ\to τ^+τ^-$ process at future lepton colliders, with the Super Tau-Charm Facility serving as a benchmark. By employing transverse-momentum-dependent factorization, we introduce novel observables derived from $\cos2ϕ$, $\sin2ϕ$, and $\cos4ϕ$ azimuthal asymmetries to precisely probe the $τ$ lepton's electromagnetic structure. Our analysis significantly enhances the precision of $a_τ$ constraints within the photon-photon fusion process, yielding $\mathrm{Re}(a_τ) \in [-4.6, 7.0] \times 10^{-3}$ at the $2σ$ confidence level, which approaches the precision of the Standard Model prediction. These findings highlight the considerable potential of azimuthal asymmetry measurements for high-precision determinations of fundamental particle properties at future lepton colliders.

hep-ph↗

Low-SWaP Magneto-optical Trap using both Planar Optical and Magnetic Components

Compact, lightweight, and energy-efficient cold atom systems are crucial for advancing quantum technologies, yet their realization remains constrained by the bulky optical and magnetic components required in current atom trapping architectures. Here, we demonstrate a low-SWaP magneto-optical trap that seamlessly integrates planar optical and magnetic components into a unified platform. A monolithic dual-functional metasurface simultaneously polarized and shapes the cooling beam, replacing traditional lens-waveplate assemblies and converting a linearly polarized Gaussian beam into a circularly polarized flat-top beam. In parallel, a planar coil chip substitutes bulky anti-Helmholtz cols and generated the required quadrupole magnetic field with drastically reduced power consumption. Under D2 line cooling of 87Rb atoms, the fully planar system delivers nearly an order-of-magnitude improvement in trapping performance while operating at a fraction of the size, weight, and power of traditional systems. This compact, bulky-component-free approach offers a scalable, energy-efficient pathway toward chip-scale cold atom platforms.

physics.atom-ph↗

Joint Optimization of Latency and Accuracy for Split Federated Learning in User-Centric Cell-Free MIMO Networks

This paper proposes a user-centric split federated learning (UCSFL) framework for user-centric cell-free multiple-input multiple-output (CF-MIMO) networks to support split federated learning (SFL). In the proposed UCSFL framework, users deploy split sub-models locally, while complete models are maintained and updated at access point (AP)-side distributed processing units (DPUs), followed by a two-level aggregation procedure across DPUs and the central processing unit (CPU). Under standard machine learning (ML) assumptions, we provide a theoretical convergence analysis for UCSFL, which reveals that the AP-cluster size is a key factor influencing model training accuracy. Motivated by this result, we introduce a new performance metric, termed the latency-to-accuracy ratio, defined as the ratio of a user's per-iteration training latency to the weighted size of its AP cluster. Based on this metric, we formulate a joint optimization problem to minimize the maximum latency-to-accuracy ratio by jointly optimizing uplink power control, downlink beamforming, model splitting, and AP clustering. The resulting problem is decomposed into two sub-problems operating on different time scales, for which dedicated algorithms are developed to handle the short-term and long-term optimizations, respectively. Simulation results verify the convergence of the proposed algorithms and demonstrate that UCSFL effectively reduces the latency-to-accuracy ratio of the VGG16 model compared with baseline schemes. Moreover, the proposed framework adaptively adjusts splitting and clustering strategies in response to varying communication and computation resources. An MNIST-based handwritten digit classification example further shows that UCSFL significantly accelerates the convergence of the VGG16 model.

eess.SP↗

From Blurry to Believable: Enhancing Low-quality Talking Heads with 3D Generative Priors

Creating high-fidelity, animatable 3D talking heads is crucial for immersive applications, yet often hindered by the prevalence of low-quality image or video sources, which yield poor 3D reconstructions. In this paper, we introduce SuperHead, a novel framework for enhancing low-resolution, animatable 3D head avatars. The core challenge lies in synthesizing high-quality geometry and textures, while ensuring both 3D and temporal consistency during animation and preserving subject identity. Despite recent progress in image, video and 3D-based super-resolution (SR), existing SR techniques are ill-equipped to handle dynamic 3D inputs. To address this, SuperHead leverages the rich priors from pre-trained 3D generative models via a novel dynamics-aware 3D inversion scheme. This process optimizes the latent representation of the generative model to produce a super-resolved 3D Gaussian Splatting (3DGS) head model, which is subsequently rigged to an underlying parametric head model (e.g., FLAME) for animation. The inversion is jointly supervised using a sparse collection of upscaled 2D face renderings and corresponding depth maps, captured from diverse facial expressions and camera viewpoints, to ensure realism under dynamic facial motions. Experiments demonstrate that SuperHead generates avatars with fine-grained facial details under dynamic motions, significantly outperforming baseline methods in visual quality.

cs.CV↗

CL-bench: A Benchmark for Context Learning

Current language models (LMs) excel at reasoning over prompts using pre-trained knowledge. However, real-world tasks are far more complex and context-dependent: models must learn from task-specific context and leverage new knowledge beyond what is learned during pre-training to reason and resolve tasks. We term this capability context learning, a crucial ability that humans naturally possess but has been largely overlooked. To this end, we introduce CL-bench, a real-world benchmark consisting of 500 complex contexts, 1,899 tasks, and 31,607 verification rubrics, all crafted by experienced domain experts. Each task is designed such that the new content required to resolve it is contained within the corresponding context. Resolving tasks in CL-bench requires models to learn from the context, ranging from new domain-specific knowledge, rule systems, and complex procedures to laws derived from empirical data, all of which are absent from pre-training. This goes far beyond long-context tasks that primarily test retrieval or reading comprehension, and in-context learning tasks, where models learn simple task patterns via instructions and demonstrations. Our evaluations of ten frontier LMs find that models solve only 17.2% of tasks on average. Even the best-performing model, GPT-5.1, solves only 23.7%, revealing that LMs have yet to achieve effective context learning, which poses a critical bottleneck for tackling real-world, complex context-dependent tasks. CL-bench represents a step towards building LMs with this fundamental capability, making them more intelligent and advancing their deployment in real-world scenarios.

cs.CL↗

Adaptive Dual-Weighting Framework for Federated Learning via Out-of-Distribution Detection

Federated Learning (FL) enables collaborative model training across large-scale distributed service nodes while preserving data privacy, making it a cornerstone of intelligent service systems in edge-cloud environments. However, in real-world service-oriented deployments, data generated by heterogeneous users, devices, and application scenarios are inherently non-IID. This severe data heterogeneity critically undermines the convergence stability, generalization ability, and ultimately the quality of service delivered by the global model. To address this challenge, we propose FLood, a novel FL framework inspired by out-of-distribution (OOD) detection. FLood dynamically counteracts the adverse effects of heterogeneity through a dual-weighting mechanism that jointly governs local training and global aggregation. At the client level, it adaptively reweights the supervised loss by upweighting pseudo-OOD samples, thereby encouraging more robust learning from distributionally misaligned or challenging data. At the server level, it refines model aggregation by weighting client contributions according to their OOD confidence scores, prioritizing updates from clients with higher in-distribution consistency and enhancing the global model's robustness and convergence stability. Extensive experiments across multiple benchmarks under diverse non-IID settings demonstrate that FLood consistently outperforms state-of-the-art FL methods in both accuracy and generalization. Furthermore, FLood functions as an orthogonal plug-in module: it seamlessly integrates with existing FL algorithms to boost their performance under heterogeneity without modifying their core optimization logic. These properties make FLood a practical and scalable solution for deploying reliable intelligent services in real-world federated environments.

cs.LG↗

Acoustoelectric Probing of Fractal Energy Spectra in Graphene/hBN Moiré Superlattices

Moiré superlattices with long-range periodicity exhibit Hofstadter energy spectra under accessible magnetic fields, enabling the exploration of emergent quantum phenomena through a hierarchy of fractal states. However, higher-order features, located at elevated energies with narrow bandwidths, typically require high carrier densities and remain difficult to resolve using conventional electrical transport due to limited sensitivity and strong background conductivity. Here, we utilize acoustoelectric (AE) transport to probe high-order fractal states and the Hofstadter spectrum in graphene/hBN moiré superlattices. Surface acoustic waves on a ferroelectric LiNbO$_3$ substrate generate an AE voltage proportional to the derivative of electrical conductivity, significantly enhancing sensitivity to weak spectral features. Combined with substrate-induced high electron doping, this technique resolves fractal Brown-Zak oscillations up to the fifth-order and provides the first AE observation of the Hofstadter butterfly, revealing high-order fractal magnetic Bloch states and symmetry-broken Landau levels over a wide carrier density range. Our results establish AE transport as a powerful derivative-sensitive probe for emergent fractal quantum states in moiré-engineered 2D systems.

cond-mat.mes-hall↗

Towards the Distributed Large-scale k-NN Graph Construction by Graph Merge

In order to support the real-time interaction with LLMs and the instant search or the instant recommendation on social media, it becomes an imminent problem to build a k-NN graph or an indexing graph for the massive number of vectorized multimedia data. In such scenarios, the scale of the data or the scale of the graph may exceed the processing capacity of a single machine. This paper aims to address the graph construction problem of such scale via efficient graph merge. For the graph construction on a single node, two generic and highly parallelizable algorithms, namely Two-way Merge and Multi-way Merge are proposed to merge subgraphs into one. For the graph construction across multiple nodes, a multi-node procedure based on Two-way Merge is presented. The procedure makes it feasible to construct a large-scale k-NN graph/indexing graph on either a single node or multiple nodes when the data size exceeds the memory capacity of one node. Extensive experiments are conducted on both large-scale k-NN graph and indexing graph construction. For the k-NN graph construction, the large-scale and high-quality k-NN graphs are constructed by graph merge in parallel. Typically, a billion-scale k-NN graph can be built in approximately 17h when only three nodes are employed. For the indexing graph construction, similar NN search performance as the original indexing graph is achieved with the merged indexing graphs while requiring much less time of construction.

cs.DC↗

A Kernel Approach for Semi-implicit Variational Inference

Semi-implicit variational inference (SIVI) enhances the expressiveness of variational families through hierarchical semi-implicit distributions, but the intractability of their densities makes standard ELBO-based optimization biased. Recent score-matching approaches to SIVI (SIVI-SM) address this issue via a minimax formulation, at the expense of an additional lower-level optimization problem. In this paper, we propose kernel semi-implicit variational inference (KSIVI), a principled and tractable alternative that eliminates the lower-level optimization by leveraging kernel methods. We show that when optimizing over a reproducing kernel Hilbert space, the lower-level problem admits an explicit solution, reducing the objective to the kernel Stein discrepancy (KSD). Exploiting the hierarchical structure of semi-implicit distributions, the resulting KSD objective can be efficiently optimized using stochastic gradient methods. We establish optimization guarantees via variance bounds on Monte Carlo gradient estimators and derive statistical generalization bounds of order $\tilde{\mathcal{O}}(1/\sqrt{n})$. We further introduce a multi-layer hierarchical extension that improves expressiveness while preserving tractability. Empirical results on synthetic and real-world Bayesian inference tasks demonstrate the effectiveness of KSIVI.

stat.ML↗

High-capacity dual degrees of freedom quantum secret sharing protocol beyond the linear rate-distance bound

Quantum secret sharing (QSS) is the multipartite cryptographic primitive. Most of existing QSS protocols are limited by the linear rate-distance bound, and cannot realize the long-distance and high-capacity multipartite key distribution. This paper proposes a polarization (Pol) and phase (Ph) dual degrees of freedom (dual-DOF) QSS protocol based on the weak coherent pulse (WCP) sources. Our protocol combines the single-photon interference, two-photon interference and non-interference principles, and can resist the internal attack from the dishonest player. We develop simulation method to estimate its performance under the beam splitting attack. The simulation results show that our protocol can surpass the linear bound. Comparing with the differential-phase-shift twin-field QSS and WCP-Ph-QSS protocols, our protocol has stronger resistance against the beam splitting attack, and thus has longer maximal communication distance and higher key rate. By using the WCPs with high average photon number ($μ$ = 1.5), our protocol achieves a key rate about 5.4 times of that in WCP-Ph-QSS protocol. Its maximal communication distance (441.7 km) is about 7.9% longer than that of the WCP-Ph-QSS. Our protocol is highly feasible with current experimental technology and offers a promising approach for long-distance and high-capacity quantum networks.

quant-ph↗

On consistency around a $3 \times 3\times 3$ cube and Q3 analogue of the lattice Boussinesq equation

In this paper, we present two new aspects of lattice Boussinesq (BSQ) equations. First, we show that the lattice potential BSQ (lpBSQ) equation defined on a nine-point square lattice admits a natural extension of three-dimensional consistency to a $3\times 3\times 3$ cube\textemdash a cubic sublattice consisting of $27$ vertices. This extends the standard notion of three-dimensional consistency (defined on an elementary $2\times 2\times 2$ vertex cube for quadrilateral equations) to the non-quadrilateral, nine-point setting. Second, we construct a new three-component system which is referred to as the {\em lattice BSQ-Q3 system}, serving as the BSQ analogue of the Q3($δ$) equation in the Adler-Bobenko-Suris (ABS) classification. The construction relies on a gauge transformation between Lax pairs of lpBSQ with the parameter $δ$ arising from a $GL_3$ action. In a degeneration form, the system yields a $PGL_3$-invariant integrable lattice equation that generalises the $PGL_2$-invariant Schwarzian BSQ equation.

nlin.SI↗

HY-Motion 1.0: Scaling Flow Matching Models for Text-To-Motion Generation

We present HY-Motion 1.0, a series of state-of-the-art, large-scale, motion generation models capable of generating 3D human motions from textual descriptions. HY-Motion 1.0 represents the first successful attempt to scale up Diffusion Transformer (DiT)-based flow matching models to the billion-parameter scale within the motion generation domain, delivering instruction-following capabilities that significantly outperform current open-source benchmarks. Uniquely, we introduce a comprehensive, full-stage training paradigm -- including large-scale pretraining on over 3,000 hours of motion data, high-quality fine-tuning on 400 hours of curated data, and reinforcement learning from both human feedback and reward models -- to ensure precise alignment with the text instruction and high motion quality. This framework is supported by our meticulous data processing pipeline, which performs rigorous motion cleaning and captioning. Consequently, our model achieves the most extensive coverage, spanning over 200 motion categories across 6 major classes. We release HY-Motion 1.0 to the open-source community to foster future research and accelerate the transition of 3D human motion generation models towards commercial maturity.

cs.CV↗

Defect Engineering for Stabilizing Magnetic and Topological Properties in Mn(Bi1-xSbx)2Te4

MnBi2Te4 is a versatile platform for exploring diverse topological quantum states, yet its potential is hampered by intrinsic antisite defects. While Sb substitution has been employed to tune the Fermi level towards the charge neutral point, it exacerbates the formation of Mn-Sb antisite defects. Here, we address this challenge by combining first-principles calculations with strategic synthesis to systematically investigate and control antisite defects in Mn(Bi1-xSbx)2Te4. Our calculations reveal that increasing antisite defect density progressively destroys the field-forced magnetic Weyl state, eventually driving the system into a trivial magnetic insulator. Motivated by these findings, we develop an optimized chemical vapor transport method, yielding high-quality Mn(Bi1-xSbx)2Te4 crystals with significantly reduced antisite defect density. The emergence of strong Shubnikov-de Haas oscillations in the forced ferromagnetic state and a pronounced anomalous Hall effect near charge neutrality, with opposite signs for n- and p-type samples, confirms the type-II Weyl semimetal nature. These findings underscore the critical role of antisite defects in determining the magnetic and topological properties of Mn(Bi1-xSbx)2Te4 and establish defect engineering via optimized synthesis as a crucial strategy for realizing its exotic magnetic topological states.

cond-mat.mtrl-sci↗

On the formulation of the NQC variable

The Nijhoff-Quispel-Capel (NQC) equation is a general lattice quadrilateral equation presented in terms of a function $S(a,b)$ where $a$ and $b$ serve as extra parameters. It can be viewed as the counterpart of Q3 equation which is the second top equation in the Adler-Bobenko-Suris list. In this paper, we review some known formulations of the NQC variable $S(a,b)$, such as the Cauchy matrix approach, the eigenfunction approach and via a spectral Wronskian. We also present a new perspective to formulate $S(a,b)$ from the eigenfunctions of a Lax pair of the lattice (non-potential) modified Korteweg de Vries equation. A new Dbar problem is introduced and employed in the derivation.

nlin.SI↗

OpenView: Empowering MLLMs with Out-of-view VQA

Recent multimodal large language models (MLLMs) show great potential in natural image understanding. Yet, they perform well, mainly on reasoning in-view contents within the image frame. This paper presents the first study on out-of-view (OOV) understanding, i.e., the ability to reason objects, activities, and scenes beyond the visible frame of a perspective view. Our technical contributions are threefold. First, we design OpenView, a four-stage pipeline to massively generate multi-choice VQA by leveraging panoramic imagery to enable context-rich and spatial-grounded VQA synthesis with free-view framing. Second, we curate OpenView-Dataset, a high-quality synthetic dataset from diverse real-world panoramas to empower MLLMs upon supervised fine-tuning. Third, we build OpenView-Bench, a benchmark that jointly measures choice and rationale accuracy for interpretable and diagnosable evaluation. Experimental results show that despite having a large gap from human performance in OOV VQA answer selection, upon empowered by OpenView, multiple MLLMs can consistently boost their performance, uplifted from 48.6% to 64.1% on average. Code, benchmark, and data will be available at https://github.com/q1xiangchen/OpenView.

cs.CV↗

ASAP-Textured Gaussians: Enhancing Textured Gaussians with Adaptive Sampling and Anisotropic Parameterization

Recent advances have equipped 3D Gaussian Splatting with texture parameterizations to capture spatially varying attributes, improving the performance of both appearance modeling and downstream tasks. However, the added texture parameters introduce significant memory efficiency challenges. Rather than proposing new texture formulations, we take a step back to examine the characteristics of existing textured Gaussian methods and identify two key limitations in common: (1) Textures are typically defined in canonical space, leading to inefficient sampling that wastes textures' capacity on low-contribution regions; and (2) texture parameterization is uniformly assigned across all Gaussians, regardless of their visual complexity, resulting in over-parameterization. In this work, we address these issues through two simple yet effective strategies: adaptive sampling based on the Gaussian density distribution and error-driven anisotropic parameterization that allocates texture resources according to rendering error. Our proposed ASAP Textured Gaussians, short for Adaptive Sampling and Anisotropic Parameterization, significantly improve the quality efficiency tradeoff, achieving high-fidelity rendering with far fewer texture parameters.

cs.CV↗