arXiv subjects

Wei Jiang

Publications and source records attributed to Wei Jiang.

At least 307 records · Page 17Linked to original sources

arXiv2022

An Unsupervised Machine Learning Method for Electron--Proton Discrimination of the DAMPE Experiment

Galactic cosmic rays are mostly made up of energetic nuclei, with less than $1\%$ of electrons (and positrons). Precise measurement of the electron and positron component requires a very efficient method to reject the nuclei background, mainly protons. In this work, we develop an unsupervised machine learning method to identify electrons and positrons from cosmic ray protons for the Dark Matter Particle Explorer (DAMPE) experiment. Compared with the supervised learning method used in the DAMPE experiment, this unsupervised method relies solely on real data except for the background estimation process. As a result, it could effectively reduce the uncertainties from simulations. For three energy ranges of electrons and positrons, 80--128 GeV, 350--700 GeV, and 2--5 TeV, the residual background fractions in the electron sample are found to be about (0.45 $\pm$ 0.02)$\%$, (0.52 $\pm$ 0.04)$\%$, and (10.55 $\pm$ 1.80)$\%$, and the background rejection power is about (6.21 $\pm$ 0.03) $\times$ $10^4$, (9.03 $\pm$ 0.05) $\times$ $10^4$, and (3.06 $\pm$ 0.32) $\times$ $10^4$, respectively. This method gives a higher background rejection power in all energy ranges than the traditional morphological parameterization method and reaches comparable background rejection performance compared with supervised machine learning~methods.

astro-ph.IM↗

arXiv2022

Data-driven simultaneous vertex and energy reconstruction for large liquid scintillator detectors

High precision vertex and energy reconstruction is crucial for large liquid scintillator detectors such as JUNO, especially for the determination of the neutrino mass ordering by analyzing the energy spectrum of reactor neutrinos. This paper presents a data-driven method to obtain more realistic and more accurate expected PMT response of positron events in JUNO, and develops a simultaneous vertex and energy reconstruction method that combines the charge and time information of PMTs. For the JUNO detector, the impact of vertex inaccuracy on the energy resolution is about 0.6\%.

physics.ins-det↗

arXiv2022

A symmetrized parametric finite element method for anisotropic surface diffusion of closed curves

We deal with a long-standing problem about how to design an energy-stable numerical scheme for solving the motion of a closed curve under {\sl anisotropic surface diffusion} with a general anisotropic surface energy $γ(\boldsymbol{n})$ in two dimensions, where $\boldsymbol{n}$ is the outward unit normal vector. By introducing a novel symmetric positive definite surface energy matrix $Z_k(\boldsymbol{n})$ depending on the Cahn-Hoffman $\boldsymbolξ$-vector and a stabilizing function $k(\boldsymbol{n})$, we first reformulate the anisotropic surface diffusion into a conservative form and then derive a new symmetrized variational formulation for the anisotropic surface diffusion with weakly or strongly anisotropic surface energies. A semi-discretization in space for the symmetrized variational formulation is proposed and its area (or mass) conservation and energy dissipation are proved. The semi-discretization is then discretized in time by either an implicit structural-preserving scheme (SP-PFEM) which preserves the area in the discretized level or a semi-implicit energy-stable method (ES-PFEM) which needs only solve a linear system at each time step. Under a relatively simple and mild condition on $γ(\boldsymbol{n})$, we show that both SP-PFEM and ES-PFEM are unconditionally energy-stable for almost all anisotropic surface energies $γ(\boldsymbol{n})$ arising in practical applications. Specifically, for several commonly-used anisotropic surface energies, we construct $Z_k(\boldsymbol{n})$ explicitly. Finally, extensive numerical results are reported to demonstrate the high performance of the proposed numerical schemes.

math.NA↗

arXiv2022

Optimal Algorithms for Stochastic Multi-Level Compositional Optimization

In this paper, we investigate the problem of stochastic multi-level compositional optimization, where the objective function is a composition of multiple smooth but possibly non-convex functions. Existing methods for solving this problem either suffer from sub-optimal sample complexities or need a huge batch size. To address these limitations, we propose a Stochastic Multi-level Variance Reduction method (SMVR), which achieves the optimal sample complexity of $\mathcal{O}\left(1 / ε^{3}\right)$ to find an $ε$-stationary point for non-convex objectives. Furthermore, when the objective function satisfies the convexity or Polyak-Łojasiewicz (PL) condition, we propose a stage-wise variant of SMVR and improve the sample complexity to $\mathcal{O}\left(1 / ε^{2}\right)$ for convex functions or $\mathcal{O}\left(1 /\left(με\right)\right)$ for non-convex functions satisfying the $μ$-PL condition. The latter result implies the same complexity for $μ$-strongly convex functions. To make use of adaptive learning rates, we also develop Adaptive SMVR, which achieves the same complexities but converges faster in practice. All our complexities match the lower bounds not only in terms of $ε$ but also in terms of $μ$ (for PL or strongly convex functions), without using a large batch size in each iteration.

cs.LG↗

arXiv2022

Deep Learning-Aided Delay-Tolerant Zero-Forcing Precoding in Cell-Free Massive MIMO

In the context of cell-free massive multi-input multi-output (CFmMIMO), zero-forcing precoding (ZFP) is superior in terms of spectral efficiency. However, it suffers from channel aging owing to fronthaul and processing delays. In this paper, we propose a robust scheme coined delay-tolerant zero-forcing precoding (DT-ZFP), which exploits deep learning-aided channel prediction to alleviate the effect of outdated channel state information (CSI). A predictor consisting of a bank of user-specific predictive modules is specifically designed for such a multi-user scenario. Leveraging the degree of freedom brought by the prediction horizon, the delivery of CSI and precoded data through a fronthaul network and the transmission of user data and pilots over an air interface can be parallelized. Therefore, DT-ZFP not only effectively combats channel aging but also avoids the inefficient Stop-and-Wait mechanism of the canonical ZFP in CFmMIMO.

cs.IT↗

arXiv2022

NeuMan: Neural Human Radiance Field from a Single Video

Photorealistic rendering and reposing of humans is important for enabling augmented reality experiences. We propose a novel framework to reconstruct the human and the scene that can be rendered with novel human poses and views from just a single in-the-wild video. Given a video captured by a moving camera, we train two NeRF models: a human NeRF model and a scene NeRF model. To train these models, we rely on existing methods to estimate the rough geometry of the human and the scene. Those rough geometry estimates allow us to create a warping field from the observation space to the canonical pose-independent space, where we train the human model in. Our method is able to learn subject specific details, including cloth wrinkles and accessories, from just a 10 seconds video clip, and to provide high quality renderings of the human under novel poses, from novel views, together with the background.

cs.CV↗

arXiv2022

Performance Impact of Channel Aging and Phase Noise on Intelligent Reflecting Surface

This letter aims to clarify the impact of channel aging and phase noise on the performance of intelligent reflecting surface-aided wireless systems. We first model mathematically the outdated channel state information (CSI) due to Doppler shifts and phase noise stemming from hardware impairment. Then, a closed-form expression of achievable spectral efficiency under noisy and aged CSI is theoretically derived. Some typical simulation results to numerically demonstrate the performance impact are illustrated.

cs.IT↗

arXiv2022

DTAC-ADMM: Delay-Tolerant Augmented Consensus ADMM-based Algorithm for Distributed Resource Allocation

Latency is inherent in almost all real-world networked applications. In this paper, we propose a distributed allocation strategy over multi-agent networks with delayed communications. The state of each agent (or node) represents its share of assigned resources out of a fixed amount (equal to overall demand). Every node locally updates its state toward optimizing a global allocation cost function via received information of its neighbouring nodes even when the data exchange over the network is heterogeneously delayed at different links. The update is based on the alternating direction method of multipliers (ADMM) formulation subject to both sum-preserving coupling-constraint and local box-constraints. The solution is derivative-free and holds for general (not necessarily differentiable) convex cost models. We use the notion of augmented consensus over undirected networks to model delayed information exchange and for convergence analysis. We simulate our \textit{delay-tolerant} algorithm for

eess.SY↗

arXiv2022

In-plane anomalous Hall effect in PT-symmetric antiferromagnetic materials

Anomalous Hall effect (AHE), a protocol of various low-power dissipation quantum phenomena and a fundamental precursor of intriguing topological phases of matter, is usually observed in ferromagnetic materials with orthogonal configuration between the electric field, magnetization and the Hall current. Here, based on the symmetry analysis, we find an unconventional AHE induced by the in-plane magnetic field (IPAHE) via spin-canting effect in $\mathcal{PT}$ symmetric antiferromagnetic (AFM) systems, featuring a linear dependence of magnetic field and 2$π$ angle periodicity with a comparable magnitude as conventional AHE. We demonstrate the key findings in the known AFM Dirac semimetal CuMnAs and a new kind of AFM heterodimensional VS$_2$-VS superlattice with a nodal-line Fermi surface and also briefly discuss the experimental detection. Our work provides an efficient pathway to search and/or design realistic materials for novel IPAHE that could greatly facilitate their application in AFM spintronic devices.

cond-mat.mes-hall↗

arXiv2022

KDD CUP 2022 Wind Power Forecasting Team 88VIP Solution

KDD CUP 2022 proposes a time-series forecasting task on spatial dynamic wind power dataset, in which the participants are required to predict the future generation given the historical context factors. The evaluation metrics contain RMSE and MAE. This paper describes the solution of Team 88VIP, which mainly comprises two types of models: a gradient boosting decision tree to memorize the basic data patterns and a recurrent neural network to capture the deep and latent probabilistic transitions. Ensembling these models contributes to tackle the fluctuation of wind power, and training submodels targets on the distinguished properties in heterogeneous timescales of forecasting, from minutes to days. In addition, feature engineering, imputation techniques and the design of offline evaluation are also described in details. The proposed solution achieves an overall online score of -45.213 in Phase 3.

cs.LG↗

arXiv2022

A regularized model for wetting/dewetting problems: asymptotic analysis and $Γ$-convergence

By introducing height dependency in the surface energy density, we propose a novel regularized variational model to simulate wetting/dewetting problems. The regularized model leads to the appearance of a precursor layer which covers the bare substrate, with the precursor height depending on the regularization parameter $\varepsilon$. The new model enjoys lots of advantages in analysis and imulations. With the help of the precursor layer, the regularized model is naturally extended to a larger domain than that of the classical sharp-interface model, and thus can be solved in a fixed domain. There is no need to explicitly track the contact line motion, and difficulties arising from free boundary problems can be avoided. In addition, topological change events can be automatically captured. Under some mild and physically meaningful conditions, we show the positivity-preserving property of the minimizers of the new model. By using asymptotic analysis and $Γ$-convergence, we investigate the convergence relations between the new regularized model and the classical sharp-interface model. Finally, numerical results are provided to validate our theoretical analysis, as well as the accuracy and efficiency of the new regularized model.

math.AP↗

arXiv2022

Room temperature spin-orbit torque efficiency in sputtered low-temperature superconductor delta-TaN

In the course of searching for promising topological materials for applications in future topological electronics, we evaluated spin-orbit torques (SOTs) in high-quality sputtered $δ-$TaN/Co20Fe60B20 devices through spin-torque ferromagnetic resonance ST-FMR and spin pumping measurements. From the ST-FMR characterization we observed a significant linewidth modulation in the magnetic Co20Fe60B20 layer attributed to the charge-to-spin conversion generated from the $δ-$TaN layer. Remarkably, the spin-torque efficiency determined from ST-FMR and spin pumping measurements is as large as $Θ =$ 0.034 and 0.031, respectively. These values are over two times larger than for $α-$Ta, but almost five times lower than for $β-$Ta, which can be attributed to the low room temperature electrical resistivity $\sim 74μΩ$ cm in $δ-$TaN. A large spin diffusion length of at least $\sim8$ nm is estimated, which is comparable to the spin diffusion length in pure Ta. Comprehensive experimental analysis, together with density functional theory calculations, indicates that the origin of the pronounced SOT effect in $δ-$TaN can be mostly related to a significant contribution from the Berry curvature associated with the presence of a topically nontrivial electronic band structure in the vicinity of the Fermi level (EF). Through additional detailed theoretical analysis, we also found that an isostructural allotrope of the superconducting $δ-$TaN phase, the simple hexagonal structure, $θ-$TaN, has larger Berry curvature, and that, together with expected reasonable charge conductivity, it can also be a promising candidate for exploring a generation of spin-orbit torque magnetic random access memory as cheap, temperature stable, and highly efficient spin current sources.

cond-mat.mes-hall↗

arXiv2022

Dynamic Gradient Reactivation for Backward Compatible Person Re-identification

We study the backward compatible problem for person re-identification (Re-ID), which aims to constrain the features of an updated new model to be comparable with the existing features from the old model in galleries. Most of the existing works adopt distillation-based methods, which focus on pushing new features to imitate the distribution of the old ones. However, the distillation-based methods are intrinsically sub-optimal since it forces the new feature space to imitate the inferior old feature space. To address this issue, we propose the Ranking-based Backward Compatible Learning (RBCL), which directly optimizes the ranking metric between new features and old features. Different from previous methods, RBCL only pushes the new features to find best-ranking positions in the old feature space instead of strictly alignment, and is in line with the ultimate goal of backward retrieval. However, the sharp sigmoid function used to make the ranking metric differentiable also incurs the gradient vanish issue, therefore stems the ranking refinement during the later period of training. To address this issue, we propose the Dynamic Gradient Reactivation (DGR), which can reactivate the suppressed gradients by adding dynamic computed constant during forward step. To further help targeting the best-ranking positions, we include the Neighbor Context Agents (NCAs) to approximate the entire old feature space during training. Unlike previous works which only test on the in-domain settings, we make the first attempt to introduce the cross-domain settings (including both supervised and unsupervised), which are more meaningful and difficult. The experimental results on all five settings show that the proposed RBCL outperforms previous state-of-the-art methods by large margins under all settings.

cs.CV↗

arXiv2022

FAIVConf: Face enhancement for AI-based Video Conference with Low Bit-rate

Recently, high-quality video conferencing with fewer transmission bits has become a very hot and challenging problem. We propose FAIVConf, a specially designed video compression framework for video conferencing, based on the effective neural human face generation techniques. FAIVConf brings together several designs to improve the system robustness in real video conference scenarios: face-swapping to avoid artifacts in background animation; facial blurring to decrease transmission bit-rate and maintain the quality of extracted facial landmarks; and dynamic source update for face view interpolation to accommodate a large range of head poses. Our method achieves a significant bit-rate reduction in the video conference and gives much better visual quality under the same bit-rate compared with H.264 and H.265 coding schemes.

eess.IV↗

arXiv2022

Facke: a Survey on Generative Models for Face Swapping

In this work, we investigate into the performance of mainstream neural generative models on the very task of swapping faces. We have experimented on CVAE, CGAN, CVAE-GAN, and conditioned diffusion models. Existing finely trained models have already managed to produce fake faces (Facke) indistinguishable to the naked eye as well as achieve high objective metrics. We perform a comparison among them and analyze their pros and cons. Furthermore, we proposed some promising tricks though they do not apply to this task.

cs.CV↗

arXiv2022

Coarse-to-fine Deep Video Coding with Hyperprior-guided Mode Prediction

The previous deep video compression approaches only use the single scale motion compensation strategy and rarely adopt the mode prediction technique from the traditional standards like H.264/H.265 for both motion and residual compression. In this work, we first propose a coarse-to-fine (C2F) deep video compression framework for better motion compensation, in which we perform motion estimation, compression and compensation twice in a coarse to fine manner. Our C2F framework can achieve better motion compensation results without significantly increasing bit costs. Observing hyperprior information (i.e., the mean and variance values) from the hyperprior networks contains discriminant statistical information of different patches, we also propose two efficient hyperprior-guided mode prediction methods. Specifically, using hyperprior information as the input, we propose two mode prediction networks to respectively predict the optimal block resolutions for better motion coding and decide whether to skip residual information from each block for better residual coding without introducing additional bit cost while bringing negligible extra computation cost. Comprehensive experimental results demonstrate our proposed C2F video compression framework equipped with the new hyperprior-guided mode prediction methods achieves the state-of-the-art performance on HEVC, UVG and MCL-JCV datasets.

cs.CV↗

arXiv2022

Toward Ambient Intelligence: Federated Edge Learning with Task-Oriented Sensing, Computation, and Communication Integration

In this paper, we address the problem of joint sensing, computation, and communication (SC$^{2}$) resource allocation for federated edge learning (FEEL) via a concrete case study of human motion recognition based on wireless sensing in ambient intelligence. First, by analyzing the wireless sensing process in human motion recognition, we find that there exists a thresholding value for the sensing transmit power, exceeding which yields sensing data samples with approximately the same satisfactory quality. Then, the joint SC$^{2}$ resource allocation problem is cast to maximize the convergence speed of FEEL, under the constraints on training time, energy supply, and sensing quality of each edge device. Solving this problem entails solving two subproblems in order: the first one reduces to determine the joint sensing and communication resource allocation that maximizes the total number of samples that can be sensed during the entire training process; the second one concerns the partition of the attained total number of sensed samples over all the communication rounds to determine the batch size at each round for convergence speed maximization. The first subproblem on joint sensing and communication resource allocation is converted to a single-variable optimization problem by exploiting the derived relation between different control variables (resources), which thus allows an efficient solution via one-dimensional grid search. For the second subproblem, it is found that the number of samples to be sensed (or batch size) at each round is a decreasing function of the loss function value attained at the round. Based on this relationship, the approximate optimal batch size at each communication round is derived in closed-form as a function of the round index. Finally, extensive simulation results are provided to validate the superiority of the proposed joint SC$^{2}$ resource allocation scheme.

cs.IT↗

arXiv2022

Vertical Federated Edge Learning with Distributed Integrated Sensing and Communication

This letter studies a vertical federated edge learning (FEEL) system for collaborative objects/human motion recognition by exploiting the distributed integrated sensing and communication (ISAC). In this system, distributed edge devices first send wireless signals to sense targeted objects/human, and then exchange intermediate computed vectors (instead of raw sensing data) for collaborative recognition while preserving data privacy. To boost the spectrum and hardware utilization efficiency for FEEL, we exploit ISAC for both target sensing and data exchange, by employing dedicated frequency-modulated continuous-wave (FMCW) signals at each edge device. Under this setup, we propose a vertical FEEL framework for realizing the recognition based on the collected multi-view wireless sensing data. In this framework, each edge device owns an individual local L-model to transform its sensing data into an intermediate vector with relatively low dimensions, which is then transmitted to a coordinating edge device for final output via a common downstream S-model. By considering a human motion recognition task, experimental results show that our vertical FEEL based approach achieves recognition accuracy up to 98\% with an improvement up to 8\% compared to the benchmarks, including on-device training and horizontal FEEL.

eess.SP↗