arXiv subjects

Xu Chen

Publications and source records attributed to Xu Chen.

At least 343 records · Page 19Linked to original sources

arXiv2022

InstantAvatar: Learning Avatars from Monocular Video in 60 Seconds

In this paper, we take a significant step towards real-world applicability of monocular neural avatar reconstruction by contributing InstantAvatar, a system that can reconstruct human avatars from a monocular video within seconds, and these avatars can be animated and rendered at an interactive rate. To achieve this efficiency we propose a carefully designed and engineered system, that leverages emerging acceleration structures for neural fields, in combination with an efficient empty space-skipping strategy for dynamic scenes. We also contribute an efficient implementation that we will make available for research purposes. Compared to existing methods, InstantAvatar converges 130x faster and can be trained in minutes instead of hours. It achieves comparable or even better reconstruction quality and novel pose synthesis results. When given the same time budget, our method significantly outperforms SoTA methods. InstantAvatar can yield acceptable visual quality in as little as 10 seconds training time.

cs.CV↗

arXiv2022

Sequential Recommendation with Causal Behavior Discovery

The key of sequential recommendation lies in the accurate item correlation modeling. Previous models infer such information based on item co-occurrences, which may fail to capture the real causal relations, and impact the recommendation performance and explainability. In this paper, we equip sequential recommendation with a novel causal discovery module to capture causalities among user behaviors. Our general idea is firstly assuming a causal graph underlying item correlations, and then we learn the causal graph jointly with the sequential recommender model by fitting the real user behavior data. More specifically, in order to satisfy the causality requirement, the causal graph is regularized by a differentiable directed acyclic constraint. Considering that the number of items in recommender systems can be very large, we represent different items with a unified set of latent clusters, and the causal graph is defined on the cluster level, which enhances the model scalability and robustness. In addition, we provide theoretical analysis on the identifiability of the learned causal graph. To the best of our knowledge, this paper makes a first step towards combining sequential recommendation with causal discovery. For evaluating the recommendation performance, we implement our framework with different neural sequential architectures, and compare them with many state-of-the-art methods based on real-world datasets. Empirical studies manifest that our model can on average improve the performance by about 7% and 11% on f1 and NDCG, respectively. To evaluate the model explainability, we build a new dataset with human labeled explanations for both quantitative and qualitative analysis.

cs.IR↗

arXiv2022

Coarse-to-Fine Contrastive Learning on Graphs

Inspired by the impressive success of contrastive learning (CL), a variety of graph augmentation strategies have been employed to learn node representations in a self-supervised manner. Existing methods construct the contrastive samples by adding perturbations to the graph structure or node attributes. Although impressive results are achieved, it is rather blind to the wealth of prior information assumed: with the increase of the perturbation degree applied on the original graph, 1) the similarity between the original graph and the generated augmented graph gradually decreases; 2) the discrimination between all nodes within each augmented view gradually increases. In this paper, we argue that both such prior information can be incorporated (differently) into the contrastive learning paradigm following our general ranking framework. In particular, we first interpret CL as a special case of learning to rank (L2R), which inspires us to leverage the ranking order among positive augmented views. Meanwhile, we introduce a self-ranking paradigm to ensure that the discriminative information among different nodes can be maintained and also be less altered to the perturbations of different degrees. Experiment results on various benchmark datasets verify the effectiveness of our algorithm compared with the supervised and unsupervised models.

cs.LG↗

arXiv2022

Proximal Gradient-Based Unfolding for Massive Random Access in IoT Networks

Grant-free random access is an effective technology for enabling low-overhead and low-latency massive access, where joint activity detection and channel estimation (JADCE) is a critical issue. Although existing compressive sensing algorithms can be applied for JADCE, they usually fail to simultaneously harvest the following properties: effective sparsity inducing, fast convergence, robust to different pilot sequences, and adaptive to time-varying networks. To this end, we propose an unfolding framework for JADCE based on the proximal gradient method. Specifically, we formulate the JADCE problem as a group-row-sparse matrix recovery problem and leverage a minimax concave penalty rather than the widely-used $\ell_1$-norm to induce sparsity. We then develop a proximal gradient-based unfolding neural network that parameterizes the algorithmic iterations. To improve convergence rate, we incorporate momentum into the unfolding neural network, and prove the accelerated convergence theoretically. Based on the convergence analysis, we further develop an adaptive-tuning algorithm, which adjusts its parameters to different signal-to-noise ratio settings. Simulations show that the proposed unfolding neural network achieves better recovery performance, convergence rate, and adaptivity than current baselines.

eess.SP↗

arXiv2022

Olive Branch Learning: A Topology-Aware Federated Learning Framework for Space-Air-Ground Integrated Network

The space-air-ground integrated network (SAGIN), one of the key technologies for next-generation mobile communication systems, can facilitate data transmission for users all over the world, especially in some remote areas where vast amounts of informative data are collected by Internet of remote things (IoRT) devices to support various data-driven artificial intelligence (AI) services. However, training AI models centrally with the assistance of SAGIN faces the challenges of highly constrained network topology, inefficient data transmission, and privacy issues. To tackle these challenges, we first propose a novel topology-aware federated learning framework for the SAGIN, namely Olive Branch Learning (OBL). Specifically, the IoRT devices in the ground layer leverage their private data to perform model training locally, while the air nodes in the air layer and the ring-structured low earth orbit (LEO) satellite constellation in the space layer are in charge of model aggregation (synchronization) at different scales.To further enhance communication efficiency and inference performance of OBL, an efficient Communication and Non-IID-aware Air node-Satellite Assignment (CNASA) algorithm is designed by taking the data class distribution of the air nodes as well as their geographic locations into account. Furthermore, we extend our OBL framework and CNASA algorithm to adapt to more complex multi-orbit satellite networks. We analyze the convergence of our OBL framework and conclude that the CNASA algorithm contributes to the fast convergence of the global model. Extensive experiments based on realistic datasets corroborate the superior performance of our algorithm over the benchmark policies.

cs.NI↗

arXiv2022

Fast-SNARF: A Fast Deformer for Articulated Neural Fields

Neural fields have revolutionized the area of 3D reconstruction and novel view synthesis of rigid scenes. A key challenge in making such methods applicable to articulated objects, such as the human body, is to model the deformation of 3D locations between the rest pose (a canonical space) and the deformed space. We propose a new articulation module for neural fields, Fast-SNARF, which finds accurate correspondences between canonical space and posed space via iterative root finding. Fast-SNARF is a drop-in replacement in functionality to our previous work, SNARF, while significantly improving its computational efficiency. We contribute several algorithmic and implementation improvements over SNARF, yielding a speed-up of $150\times$. These improvements include voxel-based correspondence search, pre-computing the linear blend skinning function, and an efficient software implementation with CUDA kernels. Fast-SNARF enables efficient and simultaneous optimization of shape and skinning weights given deformed observations without correspondences (e.g. 3D meshes). Because learning of deformation maps is a crucial component in many 3D human avatar methods and since Fast-SNARF provides a computationally efficient solution, we believe that this work represents a significant step towards the practical creation of 3D virtual humans.

cs.CV↗

arXiv2022

Recent Advances in RecBole: Extensions with more Practical Considerations

RecBole has recently attracted increasing attention from the research community. As the increase of the number of users, we have received a number of suggestions and update requests. This motivates us to make some significant improvements on our library, so as to meet the user requirements and contribute to the research community. In order to show the recent update in RecBole, we write this technical report to introduce our latest improvements on RecBole. In general, we focus on the flexibility and efficiency of RecBole in the past few months. More specifically, we have four development targets: (1) more flexible data processing, (2) more efficient model training, (3) more reproducible configurations, and (4) more comprehensive user documentation. Readers can download the above updates at: https://github.com/RUCAIBox/RecBole.

cs.IR↗

arXiv2022

Concurrent Downlink and Uplink Joint Communication and Sensing for 6G Networks

Joint communication and sensing (JCAS) is a promising technology for 6th Generation (6G) mobile networks, such as intelligent vehicular networks, intelligent manufacturing, and so on. Equipped with two spatially separated antenna arrays, the base station (BS) can perform downlink active JCAS in a mono-static setup. This paper proposes a Concurrent Downlink and Uplink (CDU) JCAS system where the BS can use the echo of transmitted dedicated signals for sensing in the uplink timeslot, while performing reliable uplink communication. A novel successive interference cancellation-based CDU JCAS processing method is proposed to enable the estimation of uplink communication symbols and downlink sensing parameters. Extensive simulation results verify the feasibility of the CDU JCAS system, showing a performance improvement of more than 10 dB compared to traditional JCAS methods while maintaining reliable uplink communication.

cs.IT↗

arXiv2022

Sensing-aided Uplink Channel Estimation for Joint Communication and Sensing

The joint communication and sensing (JCAS) technique has drawn great attention due to its high spectrum efficiency by using the same transmit signal for both communication and sensing. Exploiting the correlation between the uplink (UL) channel and the sensing results, we propose a sensing-aided Kalman filter (SAKF)-based channel state information (CSI) estimation method for UL JCAS, which exploits the angle-of-arrival (AoA) estimation to improve the CSI estimation accuracy. A Kalman filter (KF)-based CSI enhancement method is proposed to refine the least-square CSI estimation by exploiting the estimated AoA as the prior information. Simulation results show that the bit error rates (BER) of UL communication using the proposed SAKF-based CSI estimation method approach those using the minimum mean square error (MMSE) method, while at significantly reduced complexity.

cs.IT↗

arXiv2022

Multiple Signal Classification Based Joint Communication and Sensing System

Joint communication and sensing (JCS) has become a promising technology for mobile networks because of its higher spectrum and energy efficiency. Up to now, the prevalent fast Fourier transform (FFT)-based sensing method for mobile JCS networks is on-grid based, and the grid interval determines the resolution. Because the mobile network usually has limited consecutive OFDM symbols in a downlink (DL) time slot, the sensing accuracy is restricted by the limited resolution, especially for velocity estimation. In this paper, we propose a multiple signal classification (MUSIC)-based JCS system that can achieve higher sensing accuracy for the angle of arrival, range, and velocity estimation, compared with the traditional FFT-based JCS method. We further propose a JCS channel state information (CSI) enhancement method by leveraging the JCS sensing results. Finally, we derive a theoretical lower bound for sensing mean square error (MSE) by using perturbation analysis. Simulation results show that in terms of the sensing MSE performance, the proposed MUSIC-based JCS outperforms the FFT-based one by more than 20 dB. Moreover, the bit error rate (BER) of communication demodulation using the proposed JCS CSI enhancement method is significantly reduced compared with communication using the originally estimated CSI.

cs.IT↗

arXiv2022

I M Avatar: Implicit Morphable Head Avatars from Videos

Traditional 3D morphable face models (3DMMs) provide fine-grained control over expression but cannot easily capture geometric and appearance details. Neural volumetric representations approach photorealism but are hard to animate and do not generalize well to unseen expressions. To tackle this problem, we propose IMavatar (Implicit Morphable avatar), a novel method for learning implicit head avatars from monocular videos. Inspired by the fine-grained control mechanisms afforded by conventional 3DMMs, we represent the expression- and pose- related deformations via learned blendshapes and skinning fields. These attributes are pose-independent and can be used to morph the canonical geometry and texture fields given novel expression and pose parameters. We employ ray marching and iterative root-finding to locate the canonical surface intersection for each pixel. A key contribution is our novel analytical gradient formulation that enables end-to-end training of IMavatars from videos. We show quantitatively and qualitatively that our method improves geometry and covers a more complete expression space compared to state-of-the-art methods.

cs.CV↗

arXiv2022

Performance of Cooperative Detection in Joint Communication-Sensing Vehicular Network: A Data Analytic and Stochastic Geometry Approach

The increasing complexity of urban environments introduces additional uncertainty to the deployment of the autonomous vehicular network. A novel road infrastructure cooperative detection model using Joint Communication and Sensing (JCS) technology is proposed in this article to simultaneously achieve high-efficient communication and obstacle detection for urban autonomous vehicles. To suppress the performance fluctuation caused by shadowing and obstruction to the JCS signals, we first derive the statistic of road obstacles from the Geographic Information System (GIS). Then, the analysis of JCS channel characteristics and shadowing factors are presented using Line-of-Sight and Non-Line-of-Sight (LoS and NLoS) channel models under the complex urban scenario. A stochastic geometry approach is applied to analyze the interference factors and the probability distribution of successful JCS detection and communication. Simulations have been made to verify the cooperative detection model by probability analysis based on LoS and NLoS channels, and the numerical results demonstrate several different optimization methods for the deployment of JCS road infrastructures. Finally, we simulated and analyzed a deployment optimization method for JCS road infrastructures that complied with the standard of urban traffic-spot structure placement.

eess.SP↗

arXiv2022

Neuron with Steady Response Leads to Better Generalization

Regularization can mitigate the generalization gap between training and inference by introducing inductive bias. Existing works have already proposed various inductive biases from diverse perspectives. However, none of them explores inductive bias from the perspective of class-dependent response distribution of individual neurons. In this paper, we conduct a substantial analysis of the characteristics of such distribution. Based on the analysis results, we articulate the Neuron Steadiness Hypothesis: the neuron with similar responses to instances of the same class leads to better generalization. Accordingly, we propose a new regularization method called Neuron Steadiness Regularization (NSR) to reduce neuron intra-class response variance. Based on the Complexity Measure, we theoretically guarantee the effectiveness of NSR for improving generalization. We conduct extensive experiments on Multilayer Perceptron, Convolutional Neural Networks, and Graph Neural Networks with popular benchmark datasets of diverse domains, which show that our Neuron Steadiness Regularization consistently outperforms the vanilla version of models with significant gain and low additional computational overhead.

cs.LG↗

arXiv2022

GNN at the Edge: Cost-Efficient Graph Neural Network Processing over Distributed Edge Servers

Edge intelligence has arisen as a promising computing paradigm for supporting miscellaneous smart applications that rely on machine learning techniques. While the community has extensively investigated multi-tier edge deployment for traditional deep learning models (e.g. CNNs, RNNs), the emerging Graph Neural Networks (GNNs) are still under exploration, presenting a stark disparity to its broad edge adoptions such as traffic flow forecasting and location-based social recommendation. To bridge this gap, this paper formally studies the cost optimization for distributed GNN processing over a multi-tier heterogeneous edge network. We build a comprehensive modeling framework that can capture a variety of different cost factors, based on which we formulate a cost-efficient graph layout optimization problem that is proved to be NP-hard. Instead of trivially applying traditional data placement wisdom, we theoretically reveal the structural property of quadratic submodularity implicated in GNN's unique computing pattern, which motivates our design of an efficient iterative solution exploiting graph cuts. Rigorous analysis shows that it provides parameterized constant approximation ratio, guaranteed convergence, and exact feasibility. To tackle potential graph topological evolution in GNN processing, we further devise an incremental update strategy and an adaptive scheduling algorithm for lightweight dynamic layout optimization. Evaluations with real-world datasets and various GNN benchmarks demonstrate that our approach achieves superior performance over de facto baselines with more than 95.8% cost eduction in a fast convergence speed.

cs.DC↗

arXiv2022

Recommendation with User Active Disclosing Willingness

Recommender system has been deployed in a large amount of real-world applications, profoundly influencing people's daily life and production.Traditional recommender models mostly collect as comprehensive as possible user behaviors for accurate preference estimation. However, considering the privacy, preference shaping and other issues, the users may not want to disclose all their behaviors for training the model. In this paper, we study a novel recommendation paradigm, where the users are allowed to indicate their "willingness" on disclosing different behaviors, and the models are optimized by trading-off the recommendation quality as well as the violation of the user "willingness". More specifically, we formulate the recommendation problem as a multiplayer game, where the action is a selection vector representing whether the items are involved into the model training. For efficiently solving this game, we design a tailored algorithm based on influence function to lower the time cost for recommendation quality exploration, and also extend it with multiple anchor selection vectors.We conduct extensive experiments to demonstrate the effectiveness of our model on balancing the recommendation quality and user disclosing willingness.

cs.IR↗

arXiv2022

A Poincaré-Hopf Type Formula for A Pair of Vector Fields

For two complex vector bundles admitting a homomorphism between them, a Poincaré-Hopf formula for the difference of the Chern character numbers of these two vector bundles with isolated singularities is established by Huitao Feng, Weiping Li and Weiping Zhang. This article extend their reslut about Poincaré-Hopf type formula for the difference of the Chern character numbers to the non-isolated singularities. A special connection $\widetilde{\nabla}_{1}^{E}$ be constructed, the Chern character ${\rm ch}(E,\widetilde{\nabla}_{1}^{E})$ is the key role for the non-isolated singularities. As a consequence, a Poincaré-Hopf type formula for a pair of vector field with the function $h^{T_{\mathbb{C}}M}(\cdot,\cdot)$ has non-isolated zero points over a closed, oriented smooth manifold of dimension $2n$ is established.

math.DG↗

arXiv2022

Interweaving Polar Charge Orders in a Layered Metallic Super-atomic Crystal

Electronic properties of super-atomic crystals have not been sufficiently explored due to the versatility of their building units; moreover, their inter-unit couplings are even poorly understood. Here, we present a joint experiment-theory investigation of a rational-designed layered super-atomic crystal of Au6Te12Se8 cubes, stacked by non-covalent inter-cube quasi-bonds. We found a sequential-emerged anisotropic triple-cube charge-density-wave (tc-CDW) and polarized metallic states below 120 K, as revealed via scanning tunneling microscopy/spectroscopy, angle-resolved photoemission spectroscopy, transport measurement, Raman spectra, and density functional theory. The polarized states are locked in an anti-parallel configuration, which is required for maintaining the inversion symmetry of the center-cube in the tc-CDW. The anti-polar metallic states are thus interweaved by the charge-density-wave and the polarized metallic states, and primarily ascribed to electronic effects via theoretical calculations. This work not only demonstrates a microscopic picture of the interweaved CDW and polarized charge orders in the super-atomic crystal of ATS, but also sheds light on expanding the existing category of quantum materials to non-covalent solids.

cond-mat.mtrl-sci↗

arXiv2022

The First Photometric and Orbital Period Investigation of an Extremely Low Mass Ratio Contact Binary with a Sudden Period Change, TYC 4002-2628-1

Photometric observations for the totally eclipsing binary system TYC 4002-2628-1, were obtained between November 2020 and November 2021. To determine the stellar atmospheric parameters, a spectral image was taken with the 2.16 m telescope at National Astronomical Observatory of China (NAOC). TYC 4002-2628-1 is a low-amplitude (about 0.15 mag for $V$ band), short-period (0.3670495 d), contact eclipsing binary with a total secondary eclipse. Intrinsic light curve variations and the reversal of the O'Connell effect are detected in the light curves, which may be due to spot activity. Based on the photometric solutions derived from the multi-band time series light curves, TYC 4002-2628-1 is an extremely low mass ratio contact binary with a mass ratio of $q\sim$ 0.0482 and a fill-out factor of $f\sim5\%$. By analyzing the $O-C$ variations, we find that its orbital period remains unchanged when BJD < 2458321 . Then the orbital period changed suddenly around BJD 2458743 and has an increasing rate of $dP/dt=1.62\times{10^{-5}}day\cdot yr^{-1}=140$ $second\cdot century^{-1}$ . If confirmed, TYC 4002-2628-1 would be the contact binary with the highest orbital period increasing rate so far. By investigating the ratio of orbital angular momentum to the spin angular momentum ( $J_{orb}$/$J_{spin}$ $<3$) , the instability mass ratio ($q_{inst}/q=1.84$) and the instability separation ($A_{inst}/A=1.35$), TYC 4002-2628-1 can be regarded as a merger candidate.

astro-ph.SR↗