arXiv subjects

Rui Zhang

Publications and source records attributed to Rui Zhang.

At least 721 records · Page 40Linked to original sources

arXiv2023

Asymmetry-enhanced phase sensing via asymmetric entangled coherent states

We study quantum phase sensing with an asymmetric two-mode entangled coherent state (ECS) in which the two local amplitudes have different values. We find the phenomenon of the asymmetry-enhanced phase sensing which the asymmetry can significantly increase the precise of the phase estimation. We further study the effect of decoherence induced by the photon loss on quantum phase sensing. It is shown that the asymmetric ECSs have stronger capability against decoherence over the symmetric ECSs. It is indicated that the asymmetric ECSs have obvious advantages over the symmetric ECSs in the quantum phase sensing. We also study the practical phase sensing scheme with the intensity-difference measurement, and show that the asymmetry in the asymmetric ECSs can enhance the phase sensitivity in the practical phase measurement scheme. Our work reveals the asymmetry in the asymmetric ECSs is a new quantum-sensing resource, and opens a new way to the ultra-sensitive quantum phase sensing in the presence of photon losses.

quant-ph↗

arXiv2023

Joint Beam Scheduling and Power Allocation for SWIPT in Mixed Near- and Far-Field Channels

Extremely large-scale array (XL-array) has emerged as a promising technology to enhance the spectrum efficiency and spatial resolution in future wireless networks, leading to a fundamental paradigm shift from conventional far-field communications towards the new near-field communications. Different from the existing works that mostly considered simultaneous wireless information and power transfer (SWIPT) in the far field, we consider in this paper a new and practical scenario, called mixed near- and far-field SWIPT, in which energy harvesting (EH) and information decoding (ID) receivers are located in the near- and far-field regions of the XL-array base station (BS), respectively. Specifically, we formulate an optimization problem to maximize the weighted sum-power harvested at all EH receivers by jointly designing the BS beam scheduling and power allocation, under the constraints on the ID sum-rate and BS transmit power. To solve this nonconvex optimization problem, an efficient algorithm is proposed to obtain a suboptimal solution by leveraging the binary variable elimination and successive convex approximation methods. Numerical results demonstrate that our proposed joint design achieves substantial performance gain over other benchmark schemes.

eess.SP↗

arXiv2023

PLM-GNN: A Webpage Classification Method based on Joint Pre-trained Language Model and Graph Neural Network

The number of web pages is growing at an exponential rate, accumulating massive amounts of data on the web. It is one of the key processes to classify webpages in web information mining. Some classical methods are based on manually building features of web pages and training classifiers based on machine learning or deep learning. However, building features manually requires specific domain knowledge and usually takes a long time to validate the validity of features. Considering webpages generated by the combination of text and HTML Document Object Model(DOM) trees, we propose a representation and classification method based on a pre-trained language model and graph neural network, named PLM-GNN. It is based on the joint encoding of text and HTML DOM trees in the web pages. It performs well on the KI-04 and SWDE datasets and on practical dataset AHS for the project of scholar's homepage crawling.

cs.CL↗

arXiv2023

Near-Field Beam Focusing Pattern and Grating Lobe Characterization for Modular XL-Array

In this paper, we investigate the near-field modelling and analyze the beam focusing pattern for modular extremely large-scale array (XL-array) communications. As modular XL-array is physically and electrically large in general, the accurate characterization of amplitude and phase variations across its array elements requires the non-uniform spherical wave (NUSW) model, which, however, is difficult for performance analysis and optimization. To address this issue, we first present two ways to simplify the NUSW model by exploiting the unique regular structure of modular XL-array, termed sub-array based uniform spherical wave (USW) models with different or common angles, respectively. Based on the developed models, the near-field beam focusing patterns of XL-array communications are derived. It is revealed that compared to the existing collocated XL-array with the same number of array elements, modular XL-array can significantly enhance the spatial resolution, but at the cost of generating undesired grating lobes. Fortunately, different from the conventional far-field uniform plane wave (UPW) model, the near-field USW model for modular XL-array exhibits a higher grating lobe suppression capability, thanks to the non-linear phase variations across the array elements. Finally, simulation results are provided to verify the near-field beam focusing pattern and grating lobe characteristics of modular XL-array.

cs.IT↗

arXiv2023

CSGCL: Community-Strength-Enhanced Graph Contrastive Learning

Graph Contrastive Learning (GCL) is an effective way to learn generalized graph representations in a self-supervised manner, and has grown rapidly in recent years. However, the underlying community semantics has not been well explored by most previous GCL methods. Research that attempts to leverage communities in GCL regards them as having the same influence on the graph, leading to extra representation errors. To tackle this issue, we define ''community strength'' to measure the difference of influence among communities. Under this premise, we propose a Community-Strength-enhanced Graph Contrastive Learning (CSGCL) framework to preserve community strength throughout the learning process. Firstly, we present two novel graph augmentation methods, Communal Attribute Voting (CAV) and Communal Edge Dropping (CED), where the perturbations of node attributes and edges are guided by community strength. Secondly, we propose a dynamic ''Team-up'' contrastive learning scheme, where community strength is used to progressively fine-tune the contrastive objective. We report extensive experiment results on three downstream tasks: node classification, node clustering, and link prediction. CSGCL achieves state-of-the-art performance compared with other GCL methods, validating that community strength brings effectiveness and generality to graph representations. Our code is available at https://github.com/HanChen-HUST/CSGCL.

cs.SI↗

arXiv2023

Self-supervised Learning for Pre-Training 3D Point Clouds: A Survey

Point cloud data has been extensively studied due to its compact form and flexibility in representing complex 3D structures. The ability of point cloud data to accurately capture and represent intricate 3D geometry makes it an ideal choice for a wide range of applications, including computer vision, robotics, and autonomous driving, all of which require an understanding of the underlying spatial structures. Given the challenges associated with annotating large-scale point clouds, self-supervised point cloud representation learning has attracted increasing attention in recent years. This approach aims to learn generic and useful point cloud representations from unlabeled data, circumventing the need for extensive manual annotations. In this paper, we present a comprehensive survey of self-supervised point cloud representation learning using DNNs. We begin by presenting the motivation and general trends in recent research. We then briefly introduce the commonly used datasets and evaluation metrics. Following that, we delve into an extensive exploration of self-supervised point cloud representation learning methods based on these techniques. Finally, we share our thoughts on some of the challenges and potential issues that future research in self-supervised learning for pre-training 3D point clouds may encounter.

cs.CV↗

arXiv2023

A Preconditioned Riemannian Gradient Descent Algorithm for Low-Rank Matrix Recovery

The low-rank matrix recovery problem often arises in various fields, including signal processing, machine learning, and imaging science. The Riemannian gradient descent (RGD) algorithm has proven to be an efficient algorithm for solving this problem. In this paper, we present a preconditioned Riemannian gradient descent (PRGD) for low-rank matrix recovery. The preconditioner, noted for its simplicity and computational efficiency, is constructed by weighting the (i,j)-th entry of the gradient matrix according to the norms of the i-th row and the j-th column. We establish the theoretical recovery guarantee for PRGD under the restricted isometry property assumption. Experimental results indicate that PRGD can accelerate RGD by up to tenfold in solving low-rank matrix recovery problems such as matrix completion.

math.OC↗

arXiv2023

Denoising Multi-modal Sequential Recommenders with Contrastive Learning

There is a rapidly-growing research interest in engaging users with multi-modal data for accurate user modeling on recommender systems. Existing multimedia recommenders have achieved substantial improvements by incorporating various modalities and devising delicate modules. However, when users decide to interact with items, most of them do not fully read the content of all modalities. We refer to modalities that directly cause users' behaviors as point-of-interests, which are important aspects to capture users' interests. In contrast, modalities that do not cause users' behaviors are potential noises and might mislead the learning of a recommendation model. Not surprisingly, little research in the literature has been devoted to denoising such potential noises due to the inaccessibility of users' explicit feedback on their point-of-interests. To bridge the gap, we propose a weakly-supervised framework based on contrastive learning for denoising multi-modal recommenders (dubbed Demure). In a weakly-supervised manner, Demure circumvents the requirement of users' explicit feedback and identifies the noises by analyzing the modalities of all interacted items from a given user.

cs.IR↗

arXiv2023

Acousto-microfluidic Control of Liquid Crystals

The optical properties of liquid crystals serve as the basis for display, diagnostic, and sensing technologies. Such properties are generally controlled by relying on electric fields. In this work, we investigate the effects of microfluidic flows and acoustic fields on the molecular orientation and the corresponding optical response of nematic liquid crystals. Several previously unknown structures are identified, which are rationalized in terms of a state diagram as a function of the strengths of the flow and the acoustic field. The new structures are interpreted by relying on calculations with a free energy functional expressed in terms of the tensorial order parameter, using continuum theory simulations in the Landau-de Gennes framework. Taken together, the findings presented here offer promise for the development of new systems based on combinations of sound, flow, and confinement.

cond-mat.soft↗

arXiv2023

Optimal Sparse Regression Trees

Regression trees are one of the oldest forms of AI models, and their predictions can be made without a calculator, which makes them broadly useful, particularly for high-stakes applications. Within the large literature on regression trees, there has been little effort towards full provable optimization, mainly due to the computational hardness of the problem. This work proposes a dynamic-programming-with-bounds approach to the construction of provably-optimal sparse regression trees. We leverage a novel lower bound based on an optimal solution to the k-Means clustering algorithm in 1-dimension over the set of labels. We are often able to find optimal sparse trees in seconds, even for challenging datasets that involve large numbers of samples and highly-correlated features.

cs.LG↗

arXiv2023

Joint Base Station and IRS Deployment for Enhancing Network Coverage: A Graph-Based Modeling and Optimization Approach

Intelligent reflecting surface (IRS) can be densely deployed in complex environment to create cascaded line-of-sight (LoS) paths between multiple base stations (BSs) and users via tunable IRS reflections, thereby significantly enhancing the coverage performance of wireless networks. To achieve this goal, it is vital to optimize the deployed locations of BSs and IRSs in the wireless network, which is investigated in this paper. Specifically, we divide the coverage area of the network into multiple non-overlapping cells and decide whether to deploy a BS/IRS in each cell given a total number of BSs/IRSs available. We show that to ensure the network coverage/communication performance, i.e., each cell has a direct/cascaded LoS path with at least one BS, as well as such LoS paths have the average number of IRS reflections less than a given threshold, there is a fundamental trade-off with the deployment cost or the number of BSs/IRSs needed. To optimally characterize this trade-off, we formulate a joint BS and IRS deployment problem based on graph theory, which, however, is difficult to be optimally solved due to the combinatorial optimization involved. To circumvent this difficulty, we first consider a simplified problem with given BS deployment and propose the optimal as well as an efficient suboptimal IRS deployment solution to it, by applying the branch-and-bound method and iteratively removing IRSs from the candidate locations, respectively. Next, an efficient sequential update algorithm is proposed for solving the joint BS and IRS deployment problem. Numerical results are provided to show the efficacy of the proposed design approach and optimization algorithms for the joint BS and IRS deployment. The trade-off between the network coverage performance and the number of deployed BSs/IRSs with different cost ratios is also unveiled.

cs.IT↗

arXiv2023

Fair-CDA: Continuous and Directional Augmentation for Group Fairness

In this work, we propose {\it Fair-CDA}, a fine-grained data augmentation strategy for imposing fairness constraints. We use a feature disentanglement method to extract the features highly related to the sensitive attributes. Then we show that group fairness can be achieved by regularizing the models on transition paths of sensitive features between groups. By adjusting the perturbation strength in the direction of the paths, our proposed augmentation is controllable and auditable. To alleviate the accuracy degradation caused by fairness constraints, we further introduce a calibrated model to impute labels for the augmented data. Our proposed method does not assume any data generative model and ensures good generalization for both accuracy and fairness. Experimental results show that Fair-CDA consistently outperforms state-of-the-art methods on widely-used benchmarks, e.g., Adult, CelebA and MovieLens. Especially, Fair-CDA obtains an 86.3\% relative improvement for fairness while maintaining the accuracy on the Adult dataset. Moreover, we evaluate Fair-CDA in an online recommendation system to demonstrate the effectiveness of our method in terms of accuracy and fairness.

cs.LG↗

arXiv2023

Resumming Quark's Longitudinal Momentum Logarithms in LaMET Expansion of Lattice PDFs

In the large-momentum expansion for parton distribution functions (PDFs), the natural physics scale is the longitudinal momentum ($p_z$) of the quarks (or gluons) in a large-momentum hadron. We show how to expose this scale dependence through resumming logarithms of the type $\ln^n p_z/μ$ in the matching coefficient, where $μ$ is a fixed renormalization scale. The result enhances the accuracy of the expansion at moderate $p_z>1$ GeV, and at the same time, clearly shows that the partons cannot be approximated from quarks with $p_z\sim Λ_{\rm QCD}$ which are not predominantly collinear with the parent hadron momentum, consistent with power counting of the large-momentum effective theory. The same physics mechanism constrains the coordinate space expansion at large distances $z$, the conjugate of $p_z$, as illustrated in the example of fitting the moments of the PDFs.

hep-ph↗

arXiv2023

Knowledge-augmented Frame Semantic Parsing with Hybrid Prompt-tuning

Frame semantics-based approaches have been widely used in semantic parsing tasks and have become mainstream. It remains challenging to disambiguate frame representations evoked by target lexical units under different contexts. Pre-trained Language Models (PLMs) have been used in semantic parsing and significantly improve the accuracy of neural parsers. However, the PLMs-based approaches tend to favor collocated patterns presented in the training data, leading to inaccurate outcomes. The intuition here is to design a mechanism to optimally use knowledge captured in semantic frames in conjunction with PLMs to disambiguate frames. We propose a novel Knowledge-Augmented Frame Semantic Parsing Architecture (KAF-SPA) to enhance semantic representation by incorporating accurate frame knowledge into PLMs during frame semantic parsing. Specifically, a Memory-based Knowledge Extraction Module (MKEM) is devised to select accurate frame knowledge and construct the continuous templates in the high dimensional vector space. Moreover, we design a Task-oriented Knowledge Probing Module (TKPM) using hybrid prompts (in terms of continuous and discrete prompts) to incorporate the selected knowledge into the PLMs and adapt PLMs to the tasks of frame and argument identification. Experimental results on two public FrameNet datasets demonstrate that our method significantly outperforms strong baselines (by more than +3$\%$ in F1), achieving state-of-art results on the current benchmark. Ablation studies verify the effectiveness of KAF-SPA.

cs.CL↗

arXiv2023

Visual-Language Prompt Tuning with Knowledge-guided Context Optimization

Prompt tuning is an effective way to adapt the pre-trained visual-language model (VLM) to the downstream task using task-related textual tokens. Representative CoOp-based work combines the learnable textual tokens with the class tokens to obtain specific textual knowledge. However, the specific textual knowledge is the worse generalization to the unseen classes because it forgets the essential general textual knowledge having a strong generalization ability. To tackle this issue, we introduce a novel Knowledge-guided Context Optimization (KgCoOp) to enhance the generalization ability of the learnable prompt for unseen classes. The key insight of KgCoOp is that forgetting about essential knowledge can be alleviated by reducing the discrepancy between the learnable prompt and the hand-crafted prompt. Especially, KgCoOp minimizes the discrepancy between the textual embeddings generated by learned prompts and the hand-crafted prompts. Finally, adding the KgCoOp upon the contrastive loss can make a discriminative prompt for both seen and unseen tasks. Extensive evaluation of several benchmarks demonstrates that the proposed Knowledge-guided Context Optimization is an efficient method for prompt tuning, \emph{i.e.,} achieves better performance with less training time.

cs.CV↗

arXiv2023

Dynamics of active defects on the anisotropic surface of an ellipsoidal droplet

Cells are fundamental building blocks of living organisms displaying an array of shapes, morphologies, and textures that encode specific functions and physical behaviors. Elucidating the rules of this code remains a challenge. In this work, we create biomimetic structural building blocks by coating ellipsoidal droplets of a smectic liquid crystal with a protein-based active cytoskeletal gel, thus obtaining core-shell structures. By exploiting the patterned texture and anisotropic shape of the smectic core, we were able to mold the complex nematodynamics of the interfacial active material and identify new time-dependent states where topological defects periodically oscillate between rotational and translational regimes. Our nemato-hydrodynamic simulations of active nematics demonstrate that, beyond topology and activity, the dynamics of the active material are profoundly influenced by the local curvature and smectic texture of the droplet, as well as by external hydrodynamic forces. These results illustrate how the incorporation of these constraints into active nematic shells orchestrates remarkable spatio-temporal motifs, offering critical new insights into biological processes and providing compelling prospects for designing bio-inspired micro-machines.

cond-mat.soft↗

arXiv2023

Bounding System-Induced Biases in Recommender Systems with A Randomized Dataset

Debiased recommendation with a randomized dataset has shown very promising results in mitigating the system-induced biases. However, it still lacks more theoretical insights or an ideal optimization objective function compared with the other more well studied route without a randomized dataset. To bridge this gap, we study the debiasing problem from a new perspective and propose to directly minimize the upper bound of an ideal objective function, which facilitates a better potential solution to the system-induced biases. Firstly, we formulate a new ideal optimization objective function with a randomized dataset. Secondly, according to the prior constraints that an adopted loss function may satisfy, we derive two different upper bounds of the objective function, i.e., a generalization error bound with the triangle inequality and a generalization error bound with the separability. Thirdly, we show that most existing related methods can be regarded as the insufficient optimization of these two upper bounds. Fourthly, we propose a novel method called debiasing approximate upper bound with a randomized dataset (DUB), which achieves a more sufficient optimization of these upper bounds. Finally, we conduct extensive experiments on a public dataset and a real product dataset to verify the effectiveness of our DUB.

cs.IR↗

arXiv2023

A conservative implicit scheme for three-dimensional steady flows of diatomic gases in all flow regimes using unstructured meshes in the physical and velocity spaces

A computationally accurate and efficient numerical method under a unified framework is crucial to various multi-scale scientific and engineering problems. So far, many numerical methods have encountered various challenges in efficiently solving multi-scale non-equilibrium flows that cover a wide range of Knudsen numbers, especially the three-dimensional hypersonic flows. In this study, a conservative implicit scheme is further presented for three-dimensional steady flows of diatomic gases in all flow regimes, where both the implicit microscopic kinetic equations based on Rykov model and the corresponding implicit macroscopic governing equations are solved synchronously. Furthermore, a simplified multi-scale numerical flux inspired by the strategy of discrete unified gas kinetic scheme (DUGKS) is proposed to relieve the limitation of grid size and time step in all flow regimes. The flux is constructed through a backward Euler difference scheme with the consideration of collision effect in the physical reconstruction of the gas distribution function on the cell interface. Meanwhile, its asymptotic preserving property in the continuum limit is analyzed. In order to pursue high computational efficiency in three-dimensional flow simulations, the unstructured discrete velocity space (DVS) and MPI parallel in DVS are adopted to further speed up the calculation. Additionally, based on numerical experiments of Apollo 6 command module, an empirical generation criterion for three-dimensional unstructured DVS is proposed. Numerical results indicate that, the present method is about one to two orders of magnitude faster than the explicit conserved DUGKS method. The present method is proved to accurately and efficiently predict aerothermodynamic properties of hypersonic rarefied gas flows.

physics.flu-dyn↗