Searcharxiv⌕ Search

arXiv subjects

Zheng Chen

Publications and source records attributed to Zheng Chen.

At least 217 records · Page 12Linked to original sources

Cancer Subtyping by Improved Transcriptomic Features Using Vector Quantized Variational Autoencoder

Defining and separating cancer subtypes is essential for facilitating personalized therapy modality and prognosis of patients. The definition of subtypes has been constantly recalibrated as a result of our deepened understanding. During this recalibration, researchers often rely on clustering of cancer data to provide an intuitive visual reference that could reveal the intrinsic characteristics of subtypes. The data being clustered are often omics data such as transcriptomics that have strong correlations to the underlying biological mechanism. However, while existing studies have shown promising results, they suffer from issues associated with omics data: sample scarcity and high dimensionality. As such, existing methods often impose unrealistic assumptions to extract useful features from the data while avoiding overfitting to spurious correlations. In this paper, we propose to leverage a recent strong generative model, Vector Quantized Variational AutoEncoder (VQ-VAE), to tackle the data issues and extract informative latent features that are crucial to the quality of subsequent clustering by retaining only information relevant to reconstructing the input. VQ-VAE does not impose strict assumptions and hence its latent features are better representations of the input, capable of yielding superior clustering performance with any mainstream clustering method. Extensive experiments and medical analysis on multiple datasets comprising 10 distinct cancers demonstrate the VQ-VAE clustering results can significantly and robustly improve prognosis over prevalent subtyping systems.

cs.LG↗

A phase transition driven by subtle distortion without broken symmetry on spin, charge and lattice in Layered LnCu4-δP2(Ln=Eu, Sr)

In the scenario of Landau phase transition theory in condensed matter physics, any thermal dynamic phase transition must be subject to some kind of broken symmetries, that are relative to its spin, charge, orbital and lattice. Here we report a rare phase transition at Tp ~120 K or 140 K in layered materials LnCu4-δP2 (Ln=Eu, Sr) driven by a subtle structural-distortion without any broken symmetry on charge, spin and lattice. The variations of the lattice parameters, (ΔLc/Lc) ~ 0.013% or 0.062%, verified by thermal expansion, is much less than that for a typical crystalline phase transition (~0.5-1%), but the significant anomaly in heat capacity provides clear evidence of its intrinsic nature of thermodynamic transition.

cond-mat.str-el↗

Robust Beamforming Design for IRS-Aided URLLC in D2D Networks

Intelligent reflecting surface (IRS) and device-to-device (D2D) communication are two promising technologies for improving transmission reliability between transceivers in communication systems. In this paper, we consider the design of reliable communication between the access point (AP) and actuators for a downlink multiuser multiple-input single-output (MISO) system in the industrial IoT (IIoT) scenario. We propose a two-stage protocol combining IRS with D2D communication so that all actuators can successfully receive the message from AP within a given delay. The superiority of the protocol is that the communication reliability between AP and actuators is doubly augmented by the IRS-aided first-stage transmission and the second-stage D2D transmission. A joint optimization problem of active and passive beamforming is formulated, which aims to maximize the number of actuators with successful decoding. We study the joint beamforming problem for cases where the channel state information (CSI) is perfect and imperfect. For each case, we develop efficient algorithms that include convergence and complexity analysis. Simulation results demonstrate the necessity and role of IRS with a well-optimized reflection matrix, and the D2D network in promoting reliable communication. Moreover, the proposed protocol can enable reliable communication even in the presence of stringent latency requirements and CSI estimation errors.

cs.IT↗

Restricted mean survival time regression model with time-dependent covariates

In clinical or epidemiological follow-up studies, methods based on time scale indicators such as the restricted mean survival time (RMST) have been developed to some extent. Compared with traditional hazard rate indicator system methods, the RMST is easier to interpret and does not require the proportional hazard assumption. To date, regression models based on the RMST are indirect or direct models of the RMST and baseline covariates. However, time-dependent covariates are becoming increasingly common in follow-up studies. Based on the inverse probability of censoring weighting (IPCW) method, we developed a regression model of the RMST and time-dependent covariates. Through Monte Carlo simulation, we verified the estimation performance of the regression parameters of the proposed model. Compared with the time-dependent Cox model and the fixed (baseline) covariate RMST model, the time-dependent RMST model has a better prediction ability. Finally, an example of heart transplantation was used to verify the above conclusions.

stat.ME↗

Optimal MIMO Combining for Blind Federated Edge Learning with Gradient Sparsification

We provide the optimal receive combining strategy for federated learning in multiple-input multiple-output (MIMO) systems. Our proposed algorithm allows the clients to perform individual gradient sparsification which greatly improves performance in scenarios with heterogeneous (non i.i.d.) training data. The proposed method beats the benchmark by a wide margin.

cs.IT↗

$q$-Munchausen Reinforcement Learning

The recently successful Munchausen Reinforcement Learning (M-RL) features implicit Kullback-Leibler (KL) regularization by augmenting the reward function with logarithm of the current stochastic policy. Though significant improvement has been shown with the Boltzmann softmax policy, when the Tsallis sparsemax policy is considered, the augmentation leads to a flat learning curve for almost every problem considered. We show that it is due to the mismatch between the conventional logarithm and the non-logarithmic (generalized) nature of Tsallis entropy. Drawing inspiration from the Tsallis statistics literature, we propose to correct the mismatch of M-RL with the help of $q$-logarithm/exponential functions. The proposed formulation leads to implicit Tsallis KL regularization under the maximum Tsallis entropy framework. We show such formulation of M-RL again achieves superior performance on benchmark problems and sheds light on more general M-RL with various entropic indices $q$.

cs.LG↗

Enforcing KL Regularization in General Tsallis Entropy Reinforcement Learning via Advantage Learning

Maximum Tsallis entropy (MTE) framework in reinforcement learning has gained popularity recently by virtue of its flexible modeling choices including the widely used Shannon entropy and sparse entropy. However, non-Shannon entropies suffer from approximation error and subsequent underperformance either due to its sensitivity or the lack of closed-form policy expression. To improve the tradeoff between flexibility and empirical performance, we propose to strengthen their error-robustness by enforcing implicit Kullback-Leibler (KL) regularization in MTE motivated by Munchausen DQN (MDQN). We do so by drawing connection between MDQN and advantage learning, by which MDQN is shown to fail on generalizing to the MTE framework. The proposed method Tsallis Advantage Learning (TAL) is verified on extensive experiments to not only significantly improve upon Tsallis-DQN for various non-closed-form Tsallis entropies, but also exhibits comparable performance to state-of-the-art maximum Shannon entropy algorithms.

cs.LG↗

Multi-Target Active Object Tracking with Monte Carlo Tree Search and Target Motion Modeling

In this work, we are dedicated to multi-target active object tracking (AOT), where there are multiple targets as well as multiple cameras in the environment. The goal is maximize the overall target coverage of all cameras. Previous work makes a strong assumption that each camera is fixed in a location and only allowed to rotate, which limits its application. In this work, we relax the setting by allowing all cameras to both move along the boundary lines and rotate. In our setting, the action space becomes much larger, which leads to much higher computational complexity to identify the optimal action. To this end, we propose to leverage the action selection from multi-agent reinforcement learning (MARL) network to prune the search tree of Monte Carlo Tree Search (MCTS) method, so as to find the optimal action more efficiently. Besides, we model the motion of the targets to predict the future position of the targets, which makes a better estimation of the future environment state in the MCTS process. We establish a multi-target 2D environment to simulate the sports games, and experimental results demonstrate that our method can effectively improve the target coverage.

cs.CV↗

Multi-Tier Platform for Cognizing Massive Electroencephalogram

An end-to-end platform assembling multiple tiers is built for precisely cognizing brain activities. Being fed massive electroencephalogram (EEG) data, the time-frequency spectrograms are conventionally projected into the episode-wise feature matrices (seen as tier-1). A spiking neural network (SNN) based tier is designed to distill the principle information in terms of spike-streams from the rare features, which maintains the temporal implication in the nature of EEGs. The proposed tier-3 transposes time- and space-domain of spike patterns from the SNN; and feeds the transposed pattern-matrices into an artificial neural network (ANN, Transformer specifically) known as tier-4, where a special spanning topology is proposed to match the two-dimensional input form. In this manner, cognition such as classification is conducted with high accuracy. For proof-of-concept, the sleep stage scoring problem is demonstrated by introducing multiple EEG datasets with the largest comprising 42,560 hours recorded from 5,793 subjects. From experiment results, our platform achieves the general cognition overall accuracy of 87% by leveraging sole EEG, which is 2% superior to the state-of-the-art. Moreover, our developed multi-tier methodology offers visible and graphical interpretations of the temporal characteristics of EEG by identifying the critical episodes, which is demanded in neurodynamics but hardly appears in conventional cognition scenarios.

eess.SP↗

CALI: Coarse-to-Fine ALIgnments Based Unsupervised Domain Adaptation of Traversability Prediction for Deployable Autonomous Navigation

Traversability prediction is a fundamental perception capability for autonomous navigation. The diversity of data in different domains imposes significant gaps to the prediction performance of the perception model. In this work, we make efforts to reduce the gaps by proposing a novel coarse-to-fine unsupervised domain adaptation (UDA) model - CALI. Our aim is to transfer the perception model with high data efficiency, eliminate the prohibitively expensive data labeling, and improve the generalization capability during the adaptation from easy-to-obtain source domains to various challenging target domains. We prove that a combination of a coarse alignment and a fine alignment can be beneficial to each other and further design a first-coarse-then-fine alignment process. This proposed work bridges theoretical analyses and algorithm designs, leading to an efficient UDA model with easy and stable training. We show the advantages of our proposed model over multiple baselines in several challenging domain adaptation setups. To further validate the effectiveness of our model, we then combine our perception model with a visual planner to build a navigation system and show the high reliability of our model in complex natural environments where no labeled data is available.

cs.RO↗

Cancer Subtyping via Embedded Unsupervised Learning on Transcriptomics Data

Cancer is one of the deadliest diseases worldwide. Accurate diagnosis and classification of cancer subtypes are indispensable for effective clinical treatment. Promising results on automatic cancer subtyping systems have been published recently with the emergence of various deep learning methods. However, such automatic systems often overfit the data due to the high dimensionality and scarcity. In this paper, we propose to investigate automatic subtyping from an unsupervised learning perspective by directly constructing the underlying data distribution itself, hence sufficient data can be generated to alleviate the issue of overfitting. Specifically, we bypass the strong Gaussianity assumption that typically exists but fails in the unsupervised learning subtyping literature due to small-sized samples by vector quantization. Our proposed method better captures the latent space features and models the cancer subtype manifestation on a molecular basis, as demonstrated by the extensive experimental results.

cs.LG↗

Adaptive Spike-Like Representation of EEG Signals for Sleep Stages Scoring

Recently there has seen promising results on automatic stage scoring by extracting spatio-temporal features from electroencephalogram (EEG). Such methods entail laborious manual feature engineering and domain knowledge. In this study, we propose an adaptive scheme to probabilistically encode, filter and accumulate the input signals and weight the resultant features by the half-Gaussian probabilities of signal intensities. The adaptive representations are subsequently fed into a transformer model to automatically mine the relevance between features and corresponding stages. Extensive experiments on the largest public dataset against state-of-the-art methods validate the effectiveness of our proposed method and reveal promising future directions.

eess.SP↗

Electrically controlled superconductor-insulator transition and giant anomalous Hall effect in kagome metal CsV3Sb5 nanoflakes

The electronic correlations (e.g. unconventional superconductivity (SC), chiral charge order and nematic order) and giant anomalous Hall effect (AHE) in topological kagome metals AV3Sb5 (A= K, Rb, and Cs) have attracted great interest. Electrical control of those correlated electronic states and AHE allows us to resolve their own nature and origin and to discover new quantum phenomena. Here, we show that a protonic gate can largely modulate the effective disorders and carrier density in CsV3Sb5 nanoflakes, leading to significant modifications of SC, unusual charge density wave (CDW) and giant AHE. Notably, we observed a direct superconductor-insulator transition (SIT) driven by superconducting phase fluctuation due to the doping-enhanced disorders, in addition to a large suppression of CDW. Meanwhile, the carrier density modulation shifts the Fermi level across the CDW gap and gives rise to a nontrivial evolution of AHE, in line with the asymmetric density of states of CDW sub-bands near the saddle point. With the first-principles calculations, we suggest the extrinsic skew scattering of holes in the nearly flat bands with finite Berry curvature by multiple impurities accounts for the giant AHE. Our work uncovers a disorder-driven bosonic SIT, outlines a global picture of the giant AHE and reveals its correlation with the unconventional CDW in the AV3Sb5 family.

cond-mat.mtrl-sci↗

Treating Interference as Noise in Cell-Free Massive MIMO Networks

How to manage the interference introduced by the enormous wireless devices is a crucial issue to address in the prospective sixth-generation (6G) communications. The treating interference as noise (TIN) optimality conditions are commonly used for interference management and thus attract significant interest in existing wireless systems. Cell-free massive multiple-input multiple-output (CF mMIMO) is a promising technology in 6G that exhibits high system throughput and excellent interference management by exploiting a large number of access points (APs) to serve the users collaboratively. In this paper, we take the first step on studying TIN in CF mMIMO systems from a stochastic geometry perspective by investigating the probability that the TIN conditions hold with spatially distributed network nodes. We propose a novel analytical framework for TIN in a CF mMIMO system with both Binomial Point Process (BPP) and Poisson Point Process (PPP) approximations. We derive the probability that the TIN conditions hold in close form using the PPP approximation. Numerical results validate our derived expressions and illustrate the impact of various system parameters on the probability that the TIN conditions hold.

cs.IT↗

On-Demand AoI Minimization in Resource-Constrained Cache-Enabled IoT Networks with Energy Harvesting Sensors

We consider a resource-constrained IoT network, where multiple users make on-demand requests to a cache-enabled edge node to send status updates about various random processes, each monitored by an energy harvesting sensor. The edge node serves users' requests by deciding whether to command the corresponding sensor to send a fresh status update or retrieve the most recently received measurement from the cache. Our objective is to find the best actions of the edge node to minimize the average age of information (AoI) of the received measurements upon request, i.e., average on-demand AoI, subject to per-slot transmission and energy constraints. First, we derive a Markov decision process model and propose an iterative algorithm that obtains an optimal policy. Then, we develop an asymptotically optimal low-complexity algorithm -- termed relax-then-truncate -- and prove that it is optimal as the number of sensors goes to infinity. Simulation results illustrate that the proposed relax-then-truncate approach significantly reduces the average on-demand AoI compared to a request-aware greedy (myopic) policy and also depict that it performs close to the optimal solution even for moderate numbers of sensors.

eess.SP↗

Nonlinear Optimal Guidance for Fixed-Time Impact on a Stationary Target

This paper is concerned with devising the nonlinear optimal guidance for intercepting a stationary target with a fixed impact time. According to Pontryagin's Maximum Principle (PMP), some optimality conditions for the solutions of the nonlinear optimal interception problem are established, and the structure of the corresponding optimal control is presented. By employing the optimality conditions, we formulate a parameterized system so that its solution space is the same as that of the nonlinear optimal interception problem. As a consequence, a simple propagation of the parameterized system, without using any optimization method, is sufficient to generate enough sampled data for the mapping from current state and time-to-go to the optimal guidance command. By virtue of the universal approximation theorem, a feedforward neural network, trained by the generated data, is able to represent the mapping from current state and time-to-go to the optimal guidance command. Therefore, the trained network eventually can generate fixed-impact-time nonlinear optimal guidance within a constant time. Finally, the developed nonlinear optimal guidance is exemplified and studied through simulations, showing that the nonlinear optimal guidance law performs better than existing interception guidance laws.

math.OC↗

A Nonparametric Statistical Method for Two Crossing Survival Curves

In comparative research on time-to-event data for two groups, when two survival curves cross each other, it may be difficult to use the log-rank test and hazard ratio (HR) to properly assess the treatment benefit. Our aim was to identify a method for evaluating the treatment benefits for two groups in the above situation. We quantified treatment benefits based on an intuitive measure called the area between two survival curves (ABS), which is a robust measure of treatment benefits in clinical trials regardless of whether the proportional hazards assumption is violated or two survival curves cross each other. Additionally, we propose a permutation test based on the ABS, and we evaluate the effectiveness and reliability of this test with simulated data. The ABS permutation test is a robust statistical inference method with an acceptable type I error rate and superior power to detect differences in treatment effects, especially when the proportional hazards assumption is violated. The ABS can be used to intuitively quantify treatment differences over time and provide reliable conclusions in complicated situations, such as crossing survival curves. The R Package "ComparisonSurv" contains the proposed methods and is available from https://CRAN.R-project.org/package=ComparisonSurv. Keywords: Survival analysis; Area between two survival curves; Crossing survival curves; Treatment benefit

stat.ME↗

Implementation of an alternative method for assessing competing risks: restricted mean time lost

In clinical and epidemiological studies, hazard ratios are often applied to compare treatment effects between two groups for survival data. For competing risks data, the corresponding quantities of interest are cause-specific hazard ratios (cHRs) and subdistribution hazard ratios (sHRs). However, they both have some limitations related to model assumptions and clinical interpretation. Therefore, we recommend restricted mean time lost (RMTL) as an alternative that is easy to interpret in a competing risks framework. Based on the difference in restricted mean time lost (RMTLd), we propose a new estimator, hypothetical test and sample size formula. The simulation results show that the estimation of the RMTLd is accurate and that the RMTLd test has robust statistical performance (both type I error and power). The results of three example analyses also verify the performance of the RMTLd test. From the perspectives of clinical interpretation, application conditions and statistical performance, we recommend that the RMTLd be reported with the HR in the analysis of competing risks data and that the RMTLd even be regarded as the primary outcome when the proportional hazard assumption fails. The R code (crRMTL) is publicly available from Github (https://github.com/chenzgz/crRMTL.1). Keywords: survival analysis, competing risks, hazard ratio, restricted mean time lost, sample size, hypothesis test

stat.AP↗