Searcharxiv⌕ Search

arXiv subjects

Jie Xu

Publications and source records attributed to Jie Xu.

At least 379 records · Page 21Linked to original sources

GATE: Graph CCA for Temporal SElf-supervised Learning for Label-efficient fMRI Analysis

In this work, we focus on the challenging task, neuro-disease classification, using functional magnetic resonance imaging (fMRI). In population graph-based disease analysis, graph convolutional neural networks (GCNs) have achieved remarkable success. However, these achievements are inseparable from abundant labeled data and sensitive to spurious signals. To improve fMRI representation learning and classification under a label-efficient setting, we propose a novel and theory-driven self-supervised learning (SSL) framework on GCNs, namely Graph CCA for Temporal self-supervised learning on fMRI analysis GATE. Concretely, it is demanding to design a suitable and effective SSL strategy to extract formation and robust features for fMRI. To this end, we investigate several new graph augmentation strategies from fMRI dynamic functional connectives (FC) for SSL training. Further, we leverage canonical-correlation analysis (CCA) on different temporal embeddings and present the theoretical implications. Consequently, this yields a novel two-step GCN learning procedure comprised of (i) SSL on an unlabeled fMRI population graph and (ii) fine-tuning on a small labeled fMRI dataset for a classification task. Our method is tested on two independent fMRI datasets, demonstrating superior performance on autism and dementia diagnosis.

cs.LG↗

Affinity-Aware Resource Provisioning for Long-Running Applications in Shared Clusters

Resource provisioning plays a pivotal role in determining the right amount of infrastructure resource to run applications and target the global decarbonization goal. A significant portion of production clusters is now dedicated to long-running applications (LRAs), which are typically in the form of microservices and executed in the order of hours or even months. It is therefore practically important to plan ahead the placement of LRAs in a shared cluster so that the number of compute nodes required by them can be minimized to reduce carbon footprint and lower operational costs. Existing works on LRA scheduling are often application-agnostic, without particularly addressing the constraining requirements imposed by LRAs, such as co-location affinity constraints and time-varying resource requirements. In this paper, we present an affinity-aware resource provisioning approach for deploying large-scale LRAs in a shared cluster subject to multiple constraints, with the objective of minimizing the number of compute nodes in use. We investigate a broad range of solution algorithms which fall into three main categories: Application-Centric, Node-Centric, and Multi-Node approaches, and tune them for typical large-scale real-world scenarios. Experimental studies driven by the Alibaba Tianchi dataset show that our algorithms can achieve competitive scheduling effectiveness and running time, as compared with the heuristics used by the latest work including Medea and LraSched.

cs.DC↗

Prescribed Scalar Curvature Problem under Conformal Deformation of A Riemannian Metric with Dirichlet Boundary Condition

In this article, we first show that for all compact Riemannian manifolds with non-empty smooth boundary and dimension at least 3, there exists a metric, pointwise conformal to the original metric, with constant scalar curvature in the interior, and constant scalar curvature on the boundary by considering the boundary as a manifold of its own with dimension at least 2. We then show a series of prescribed scalar curvature results in the interior and on the boundary, with pointwise conformal deformation. These type of results is both an analogy and an extension of Kazdan and Warner's "Trichotomy Theorem" on a different type of manifolds. The key step of these problems is to obtain a positive, smooth solution of a Yamabe equation with Dirichlet boundary conditions.

math.DG↗

MIMO Integrated Sensing and Communication with Extended Target: CRB-Rate Tradeoff

This paper studies a multiple-input multiple-output (MIMO) integrated sensing and communication (ISAC) system, in which a multi-antenna base station (BS) sends unified wireless signals to estimate an extended target and communicate with a multi-antenna communication user (CU) at the same time. We investigate the fundamental tradeoff between the estimation Cramér-Rao bound (CRB) for sensing and the data rate for communication, by characterizing the Pareto boundary of the achievable CRB-rate (C-R) region. Towards this end, we formulate a new MIMO rate maximization problem by optimizing the transmit covariance matrix at the BS, subject to a new form of maximum CRB constraint together with a maximum transmit power constraint. We derive the optimal transmit covariance solution in a semi-closed form, by first implementing the singular-value decomposition (SVD) to diagonalize the communication channel and then properly allocating the transmit power over these subchannels for communication and other orthogonal subchannels (if any) for dedicated sensing. It is shown that the optimal transmit covariance is of full rank, which unifies the conventional rate maximization design with water-filling power allocation and the CRB minimization design with isotropic transmission. Numerical results are provided to validate the performance achieved by our proposed optimal design, in comparison with other benchmark schemes.

cs.IT↗

On the Convergence of Multi-Server Federated Learning with Overlapping Area

Multi-server Federated learning (FL) has been considered as a promising solution to address the limited communication resource problem of single-server FL. We consider a typical multi-server FL architecture, where the coverage areas of regional servers may overlap. The key point of this architecture is that the clients located in the overlapping areas update their local models based on the average model of all accessible regional models, which enables indirect model sharing among different regional servers. Due to the complicated network topology, the convergence analysis is much more challenging than single-server FL. In this paper, we firstly propose a novel MS-FedAvg algorithm for this multi-server FL architecture and analyze its convergence on non-iid datasets for general non-convex settings. Since the number of clients located in each regional server is much less than in single-server FL, the bandwidth of each client should be large enough to successfully communicate training models with the server, which indicates that full client participation can work in multi-server FL. Also, we provide the convergence analysis of the partial client participation scheme and develop a new biased partial participation strategy to further accelerate convergence. Our results indicate that the convergence results highly depend on the ratio of the number of clients in each area type to the total number of clients in all three strategies. The extensive experiments show remarkable performance and support our theoretical results.

cs.DC↗

An Overview on Over-the-Air Federated Edge Learning

Over-the-air federated edge learning (Air-FEEL) has emerged as a promising solution to support edge artificial intelligence (AI) in future beyond 5G (B5G) and 6G networks. In Air-FEEL, distributed edge devices use their local data to collaboratively train AI models while preserving data privacy, in which the over-the-air model/gradient aggregation is exploited for enhancing the learning efficiency. This article provides an overview on the state of the art of Air-FEEL. First, we present the basic principle of Air-FEEL, and introduce the technical challenges for Air-FEEL design due to the over-the-air aggregation errors, as well as the resource and data heterogeneities at edge devices. Next, we present the fundamental performance metrics for Air-FEEL, and review resource management solutions and design considerations for enhancing the Air-FEEL performance. Finally, several interesting research directions are pointed out to motivate future work.

cs.IT↗

Fundamental CRB-Rate Tradeoff in Multi-antenna Multicast Channel with ISAC

This paper studies the multi-antenna multicast channel with integrated sensing and communication (ISAC), in which a multi-antenna base station (BS) sends common messages to a set of single-antenna communication users (CUs) and simultaneously estimates the parameters of an extended target via radar sensing. We investigate the fundamental performance limits of this ISAC system, in terms of the achievable rate for communication and the estimation Cramér-Rao bound (CRB) for sensing. First, we derive the optimal transmit covariance in semi-closed form to balance the CRB-rate (C-R) tradeoff, and accordingly characterize the outer bound of a so-called C-R region. It is shown that the optimal transmit covariance should be of full rank, consisting of both information-carrying and dedicated sensing signals in general. Next, we consider a practical joint information and sensing beamforming design, and propose an efficient approach to optimize the joint beamforming for balancing the C-R tradeoff. Numerical results are presented to show the C-R region achieved by the optimal transmit covariance and the joint beamforming, as compared to other benchmark schemes.

cs.IT↗

Energy Efficiency Maximization of Massive MIMO Communications With Dynamic Metasurface Antennas

Future wireless communications are largely inclined to deploy massive numbers of antennas at the base stations (BSs) by leveraging cost- and energy-efficient as well as environmentally friendly antenna arrays. The emerging technology of dynamic metasurface antennas (DMAs) is promising to realize such massive antenna arrays with reduced physical size, hardware cost, and power consumption. The goal of this paper is the optimization of the energy efficiency (EE) performance of DMA-assisted massive multiple-input multiple-output (MIMO) wireless communications. Focusing on the uplink, we propose an algorithmic framework for designing the transmit precoding of each multi-antenna user and the DMA tuning strategy at the BS to maximize the EE performance, considering the availability of either instantaneous or statistical channel state information (CSI). Specifically, the proposed framework is shaped around Dinkelbach's transform, alternating optimization, and deterministic equivalent methods. In addition, we obtain a closed-form solution to the optimal transmit signal directions for the statistical CSI case, which simplifies the corresponding transmission design for the multiple-antenna case. Our numerical results verify the good convergence behavior of the proposed algorithms, and showcase the considerable EE performance gains of the DMA-assisted massive MIMO transmissions over the baseline schemes.

cs.IT↗

Robust Transmit Beamforming for Secure Integrated Sensing and Communication

This paper studies a downlink secure integrated sensing and communication (ISAC) system, in which a multi-antenna base station (BS) transmits confidential messages to a single-antenna communication user (CU) while performing sensing on targets that may act as suspicious eavesdroppers. To ensure the quality of target sensing while preventing their potential eavesdropping, the BS combines the transmit confidential information signals with additional dedicated sensing signals, which play a dual role of artificial noise (AN) for degrading the qualities of eavesdropping channels. Under this setup, we jointly design the transmit information and sensing beamforming, with the objective of minimizing the weighted sum of beampattern matching errors and cross-correlation patterns for sensing subject to secure communication constraints. The robust design takes into account the channel state information (CSI) imperfectness of the eavesdroppers in two practical CSI error scenarios. First, we consider the scenario with bounded CSI errors of eavesdroppers, in which the worst-case secrecy rate constraint is adopted to ensure secure communication performance. In this scenario, we present the optimal solution to the worst-case secrecy rate constrained sensing beampattern optimization problem, by adopting the techniques of S-procedure, semi-definite relaxation (SDR), and a one-dimensional (1D) search, for which the tightness of the SDR is rigorously proved. Next, we consider the scenario with Gaussian CSI errors of eavesdroppers, in which the secrecy outage probability constraint is adopted. In this scenario, we present an efficient algorithm to solve the more challenging secrecy outage-constrained sensing beampattern optimization problem, by exploiting the convex restriction technique based on the Bernstein-type inequality, together with the SDR and 1D search.

cs.IT↗

DiffCloth: Differentiable Cloth Simulation with Dry Frictional Contact

Cloth simulation has wide applications in computer animation, garment design, and robot-assisted dressing. This work presents a differentiable cloth simulator whose additional gradient information facilitates cloth-related applications. Our differentiable simulator extends a state-of-the-art cloth simulator based on Projective Dynamics (PD) and with dry frictional contact. We draw inspiration from previous work to propose a fast and novel method for deriving gradients in PD-based cloth simulation with dry frictional contact. Furthermore, we conduct a comprehensive analysis and evaluation of the usefulness of gradients in contact-rich cloth simulation. Finally, we demonstrate the efficacy of our simulator in a number of downstream applications, including system identification, trajectory optimization for assisted dressing, closed-loop control, inverse design, and real-to-sim transfer. We observe a substantial speedup obtained from using our gradient information in solving most of these applications.

cs.GR↗

Semi-Supervised Keypoint Detector and Descriptor for Retinal Image Matching

For retinal image matching (RIM), we propose SuperRetina, the first end-to-end method with jointly trainable keypoint detector and descriptor. SuperRetina is trained in a novel semi-supervised manner. A small set of (nearly 100) images are incompletely labeled and used to supervise the network to detect keypoints on the vascular tree. To attack the incompleteness of manual labeling, we propose Progressive Keypoint Expansion to enrich the keypoint labels at each training epoch. By utilizing a keypoint-based improved triplet loss as its description loss, SuperRetina produces highly discriminative descriptors at full input image size. Extensive experiments on multiple real-world datasets justify the viability of SuperRetina. Even with manual labeling replaced by auto labeling and thus making the training process fully manual-annotation free, SuperRetina compares favorably against a number of strong baselines for two RIM tasks, i.e. image registration and identity verification. SuperRetina will be open source.

cs.CV↗

Intelligent Reflecting Surface Enabled Sensing: Cramér-Rao Bound Optimization

This paper investigates intelligent reflecting surface (IRS) enabled non-line-of-sight (NLoS) wireless sensing, in which an IRS is dedicatedly deployed to assist an access point (AP) to sense a target at its NLoS region. It is assumed that the AP is equipped with multiple antennas and the IRS is equipped with a uniform linear array. We consider two types of target models, namely the point and extended targets, for which the AP aims to estimate the target's direction-of-arrival (DoA) and the target response matrix with respect to the IRS, respectively, based on the echo signals from the AP-IRS-target-IRS-AP link. Under this setup, we jointly design the transmit beamforming at the AP and the reflective beamforming at the IRS to minimize the Cramér-Rao bound (CRB) on the estimation error. Towards this end, we first obtain the CRB expressions for the two target models in closed form. It is shown that in the point target case, the CRB for estimating the DoA depends on both the transmit and reflective beamformers; while in the extended target case, the CRB for estimating the target response matrix only depends on the transmit beamformers. Next, for the point target case, we optimize the joint beamforming design to minimize the CRB, via alternating optimization, semi-definite relaxation, and successive convex approximation. For the extended target case, we obtain the optimal transmit beamforming solution to minimize the CRB in closed form. Finally, numerical results show that for both cases, the proposed designs based on CRB minimization achieve improved sensing performance in terms of mean squared error, as compared to other traditional schemes.

eess.SP↗

An Overview on IEEE 802.11bf: WLAN Sensing

With recent advancements, the wireless local area network (WLAN) or wireless fidelity (Wi-Fi) technology has been successfully utilized to realize sensing functionalities such as detection, localization, and recognition. However, the WLANs standards are developed mainly for the purpose of communication, and thus may not be able to meet the stringent sensing requirements in emerging applications. To resolve this issue, a new Task Group (TG), namely IEEE 802.11bf, has been established by the IEEE 802.11 working group, with the objective of creating a new amendment to the WLAN standard to provide advanced sensing requirements while minimizing the effect on communications. This paper provides a comprehensive overview on the up-to-date efforts in the IEEE 802.11bf TG. First, we introduce the definition of the 802.11bf amendment and its standardization timeline. Then, we discuss the WLAN sensing procedure and framework used for measurement acquisition, by considering both conventional sensing at sub-7 GHz and directional multi-gigabit (DMG) sensing at 60 GHz, respectively. Next, we present various candidate technical features for IEEE 802.11bf, including waveform/sequence design, feedback types, quantization, as well as security and privacy. Finally, we describe the methodologies used by the IEEE 802.11bf TG to evaluate the alternative performance. It is desired that this overview paper provide useful insights on IEEE 802.11 WLAN sensing to people with great interests and promote the IEEE 802.11bf standard to be widely deployed.

cs.NI↗

Energy-Efficient Transmit Beamforming and Antenna Selection with Non-Linear PA Efficiency

This letter studies the energy-efficient design in a downlink multi-antenna multi-user system consisting of a multi-antenna base station (BS) and multiple single-antenna users, by considering the practical non-linear power amplifier (PA) efficiency and the on-off power consumption of radio frequency (RF) chain at each transmit antenna. Under this setup, we jointly optimize the transmit beamforming and antenna on/off selection at the BS to minimize its total power consumption while ensuring the individual signal-to-interference-plus-noise ratio (SINR) constraints at the users. However, due to the non-linear PA efficiency and the on-off RF chain power consumption, the formulated SINR-constrained power minimization problem is highly non-convex and difficult to solve. To tackle this issue, we propose an efficient algorithm to obtain a high-quality solution based on the technique of sequential convex approximation (SCA). We provide numerical results to validate the performance of our proposed design. It is shown that at the optimized solution, the BS tends to activate fewer antennas and use higher power transmission at each antenna to exploit the non-linear PA efficiency.

cs.IT↗

Uniqueness of global weak solutions to the frame hydrodynamics for biaxial nematic phases in $\mathbb{R}^2$

We consider the hydrodynamics for biaxial nematic phases described by a field of orthonormal frame, which can be derived from a molecular-theory-based tensor model. We prove the uniqueness of global weak solutions to the Cauchy problem of the frame hydrodynamics in dimensional two. The proof is mainly based on the suitable weaker energy estimates within the Littlewood--Paley analysis. We take full advantage of the estimates of nonlinear terms with rotational derivatives on $SO(3)$, together with cancellation relations and dissipative structures of the biaxial frame system.

math.AP↗

Channel Knowledge Map (CKM)-Assisted Multi-UAV Wireless Network: CKM Construction and UAV Placement

Channel knowledge map (CKM) has recently emerged to facilitate the placement and trajectory optimization for unmanned aerial vehicle (UAV) communications. This paper investigates a CKM-assisted multi-UAV wireless network, by focusing on the construction and utilization of CKMs for multi-UAV placement optimization. First, we consider the CKM construction problem when data measurements for only a limited number of points are available. Towards this end, we exploit a data-driven interpolation technique to construct CKMs to characterize the signal propagation environments. Next, we study the multi-UAV placement optimization problem by utilizing the constructed CKMs, in which the multiple UAVs aim to optimize their placement locations to maximize the weighted sum rate with their respectively associated ground base stations (GBSs). However, the rate function based on the CKMs is generally non-differentiable. To tackle this issue, we propose a novel iterative algorithm based on derivative-free optimization, in which a series of quadratic functions are iteratively constructed to approximate the objective function under a set of interpolation conditions, and accordingly, the UAVs' placement locations are updated by maximizing the approximate function subject to a trust region constraint. Finally, numerical results are presented to validate the proposed design achieves near-optimal performance, but with much lower implementation complexity.

cs.IT↗

Task-Oriented Sensing, Computation, and Communication Integration for Multi-Device Edge AI

This paper studies a new multi-device edge artificial-intelligent (AI) system, which jointly exploits the AI model split inference and integrated sensing and communication (ISAC) to enable low-latency intelligent services at the network edge. In this system, multiple ISAC devices perform radar sensing to obtain multi-view data, and then offload the quantized version of extracted features to a centralized edge server, which conducts model inference based on the cascaded feature vectors. Under this setup and by considering classification tasks, we measure the inference accuracy by adopting an approximate but tractable metric, namely discriminant gain, which is defined as the distance of two classes in the Euclidean feature space under normalized covariance. To maximize the discriminant gain, we first quantify the influence of the sensing, computation, and communication processes on it with a derived closed-form expression. Then, an end-to-end task-oriented resource management approach is developed by integrating the three processes into a joint design. This integrated sensing, computation, and communication (ISCC) design approach, however, leads to a challenging non-convex optimization problem, due to the complicated form of discriminant gain and the device heterogeneity in terms of channel gain, quantization level, and generated feature subsets. Remarkably, the considered non-convex problem can be optimally solved based on the sum-of-ratios method. This gives the optimal ISCC scheme, that jointly determines the transmit power and time allocation at multiple devices for sensing and communication, as well as their quantization bits allocation for computation distortion control. By using human motions recognition as a concrete AI inference task, extensive experiments are conducted to verify the performance of our derived optimal ISCC scheme.

cs.IT↗

Frame hydrodynamics of biaxial nematics from molecular-theory-based tensor models

Starting from a dynamic tensor model about two second-order tensors, we derive the frame hydrodynamics for the biaxial nematic phase using the Hilbert expansion. The coefficients in the frame model are derived from those in the tensor model. The energy dissipation of the tensor model is maintained in the frame model. The model is reduced to the Ericksen--Leslie model if the biaxial bulk energy minimum of the tensor model is reduced to a uniaxial one.

cond-mat.soft↗