Searcharxiv⌕ Search

arXiv subjects

Yao Xiao

Publications and source records attributed to Yao Xiao.

At least 73 records · Page 4Linked to original sources
arXiv2024

Variance-reduced sampling importance resampling

The sampling importance resampling method is widely utilized in various fields, such as numerical integration and statistical simulation. In this paper, two modified methods are presented by incorporating two variance reduction techniques commonly used in Monte Carlo simulation, namely antithetic sampling and Latin hypercube sampling, into the process of sampling importance resampling method respectively. Theoretical evidence is provided to demonstrate that the proposed methods significantly reduce estimation errors compared to the original approach. Furthermore, the effectiveness and advantages of the proposed methods are validated through both numerical studies and real data analysis.

stat.CO↗
arXiv2024

Moment Lagrangian correspondences are unobstructed after bulk deformation

We prove that the Lagrangian correspondences induced by the symplectic reduction maps at free zero level sets of the moment maps are unobstructed after bulk deformation, assuming the existence of certain equivariant Kuranishi structures and compatible equivariant CF-perturbations on the moduli spaces of pseudoholomorphic discs.

math.SG↗
arXiv2024

Low-Latency Video Conferencing via Optimized Packet Routing and Reordering

In the face of rising global demand for video meetings, managing traffic across geographically distributed (geo-distributed) data centers presents a significant challenge due to the dynamic and limited nature of inter-DC network performance. Facing these issues, this paper introduces two novel techniques, VCRoute and WMJitter, to optimize the performance of geo-distributed video conferencing systems. VCRoute is a routing method designed for audio data packets of video conferences. It treats the routing problem as a Multi-Armed Bandit issue, and utilizes a tailored Thompson Sampling algorithm for resolution. Unlike traditional approaches, VCRoute considers transmitting latency and its variance simultaneously by using Thompson Sampling algorithm, which leads to effective end-to-end latency optimization. In conjunction with VCRoute, we present WMJitter, a watermark-based mechanism for managing network jitter, which can further reduce the end-to-end delay and keep an improved balance between latency and loss rate. Evaluations based on real geo-distributed network performance demonstrate the effectiveness and scalability of VCRoute and WMJitter, offering robust solutions for optimizing video conferencing systems in geo-distributed settings.

cs.NI↗
arXiv2024

A Non-staggered Projection Algorithm for Two-Phase Fluid-Structure Interaction Simulation Using the Phase-Field/Immersed-Boundary Method

We present a Pressure-Oscillation-Free projection algorithm for large-density-ratio multiphase fluid-structure interaction simulations, implemented on a non-staggered Cartesian grid. The incompressible Navier-Stokes is decoupled with an improved five-step incremental pressure correction algorithm. Fluid-fluid interface is captured using the Cahn-Hilliard equation, and the surface tension model is coupled with a momentum-weighted interpolation scheme to suppress unphysical pressure oscillations, ensuring accurate evolution of multiphase interfaces. Interaction at the fluid-structure interface is obtained by implicitly solving for the feedback acceleration in the Eulerian-Lagrangian system. For validation of the present method, the comparison studies for Pressure-Oscillation-Free effect are systematically conducted using lid driving cavity and droplet deformation cases. Moreover, several challenging multiphase simulations are implemented and discussed. As a demonstrating example of fluid-structure interaction, a rising bubble bypassing an obstacle is tested.

physics.flu-dyn↗
arXiv2023

Impact of Indoor Mobility Behavior on the Respiratory Infectious Diseases Transmission Trends

The importance of indoor human mobility in the transmission dynamics of respiratory infectious diseases has been acknowledged. Previous studies have predominantly addressed a single type of mobility behavior such as queueing and a series of behaviors under specific scenarios. However, these studies ignore the abstraction of mobility behavior in various scenes and the critical examination of how these abstracted behaviors impact disease propagation. To address these problems, this study considers people's mobility behaviors in a general scenario, abstracting them into two main categories: crowding behavior, related to the spatial aspect, and stopping behavior, related to the temporal aspect. Accordingly, this study investigates their impacts on disease spreading and the impact of individual spatio-temporal distribution resulting from these mobility behaviors on epidemic transmission. First, a point of interest (POI) method is introduced to quantify the crowding-related spatial POI factors (i.e., the number of crowdings and the distance between crowdings) and stopping-related temporal POI factors (i.e., the number of stoppings and the duration of each stopping). Besides, a personal space determined with Voronoi diagrams is used to construct the individual spatio-temporal distribution factor. Second, two indicators (i.e., the daily number of new cases and the average exposure risk of people) are applied to quantify epidemic transmission. These indicators are derived from a fundamental model which accurately predicts disease transmission between moving individuals. Third, a set of 200 indoor scenarios is constructed and simulated to help determine variable values. Concurrently, the influences and underlying mechanisms of these behavioral factors on disease transmission are examined using structural equation modeling and causal inference modeling......

cs.CY↗
arXiv2023

Ten issues of NetGPT

With the rapid development and application of foundation models (FMs), it is foreseeable that FMs will play an important role in future wireless communications. As current Artificial Intelligence (AI) algorithms applied in wireless networks are dedicated models that aim for different neural network architectures and objectives, drawbacks in aspects of generality, performance gain, management, collaboration, etc. need to be conquered. In this paper, we define NetGPT (Network Generative Pre-trained Transformer) -- the foundation models for wireless communications, and summarize ten issues regarding design and application of NetGPT.

cs.NI↗
arXiv2023

Equivariant Lagrangian Floer theory on compact toric manifolds

We define an equivariant Lagrangian Floer theory for Lagrangian torus fibers in a compact symplectic toric manifold equipped with a subtorus action. We show that the set of all Lagrangian torus fibers with weak bounding cochain data whose equivariant Lagrangian Floer cohomology is non-zero can be identified with a rigid analytic space. We prove that the set of these Lagrangian torus fibers is the tropicalization of the rigid analytic space. This provides a way to locate them in the moment polytope. Moreover, we prove that the dimension of such a rigid analytic space is equal to the dimension of the subtorus when the symplectic manifold is $\mathbb{CP}^n$ or has complex dimension less than or equal to 2. We also show that the Lagrangian submanifolds with non-trivial equivariant Floer cohomology are non-displaceable by $G$-equivariant Hamiltonian diffeomorphisms.

math.SG↗
arXiv2023

Efficiently Visualizing Large Graphs

Most existing graph visualization methods based on dimension reduction are limited to relatively small graphs due to performance issues. In this work, we propose a novel dimension reduction method for graph visualization, called t-Distributed Stochastic Graph Neighbor Embedding (t-SGNE). t-SGNE is specifically designed to visualize cluster structures in the graph. As a variant of the standard t-SNE method, t-SGNE avoids the time-consuming computations of pairwise similarity. Instead, it uses the neighbor structures of the graph to reduce the time complexity from quadratic to linear, thus supporting larger graphs. In addition, to suit t-SGNE, we combined Laplacian Eigenmaps with the shortest path algorithm in graphs to form the graph embedding algorithm ShortestPath Laplacian Eigenmaps Embedding (SPLEE). Performing SPLEE to obtain a high-dimensional embedding of the large-scale graph and then using t-SGNE to reduce its dimension for visualization, we are able to visualize graphs with up to 300K nodes and 1M edges within 5 minutes and achieve approximately 10% improvement in visualization quality. Codes and data are available at https://github.com/Charlie-XIAO/embedding-visualization-test.

cs.LG↗
arXiv2023

Decomposed Prompt Tuning via Low-Rank Reparameterization

While prompt tuning approaches have achieved competitive performance with high efficiency, we observe that they invariably employ the same initialization process, wherein the soft prompt is either randomly initialized or derived from an existing embedding vocabulary. In contrast to these conventional methods, this study aims to investigate an alternative way to derive soft prompt. Our empirical studies show that the soft prompt typically exhibits a low intrinsic rank characteristic. With such observations, we propose decomposed prompt tuning, a novel approach that utilizes low-rank matrices to initialize the soft prompt. Through the low-rank reparameterization, our method significantly reduces the number of trainable parameters while maintaining effectiveness. Experimental results on the SuperGLUE benchmark in both high-resource and low-resource scenarios demonstrate the effectiveness of the proposed method.

cs.CL↗
arXiv2023

Atomically-precise engineering of spin-orbit polarons in a kagome magnetic Weyl semimetal

Atomically-precise engineering of defects in topological quantum materials, which is essential for constructing new artificial quantum materials with exotic properties and appealing for practical quantum applications, remains challenging due to the hindrances in modifying complex lattice with atomic precision. Here, we report the atomically-precise engineering of the vacancy-localized spin-orbital polarons (SOP) in a kagome magnetic Weyl semimetal Co3Sn2S2, using scanning tunneling microscope. We achieve the step-by-step repairing of the selected vacancies, which results in the formation of artificial sulfur vacancy with elaborate geometry. We find that that the bound states localized around the vacancies experience a symmetry-dependent energy shift towards Fermi level with increasing vacancy size. Strikingly, as vacancy size increases, the localized magnetic moments of SOPs are tunable and ultimately extended to the negative magnetic moments resulting from spin-orbit coupling in the kagome flat band. These findings establish a new platform for engineering atomic quantum states in topological quantum materials, offering potential for kagome-lattice-based spintronics and quantum technologies.

cond-mat.mes-hall↗
arXiv2023

DISC-LawLLM: Fine-tuning Large Language Models for Intelligent Legal Services

We propose DISC-LawLLM, an intelligent legal system utilizing large language models (LLMs) to provide a wide range of legal services. We adopt legal syllogism prompting strategies to construct supervised fine-tuning datasets in the Chinese Judicial domain and fine-tune LLMs with legal reasoning capability. We augment LLMs with a retrieval module to enhance models' ability to access and utilize external legal knowledge. A comprehensive legal benchmark, DISC-Law-Eval, is presented to evaluate intelligent legal systems from both objective and subjective dimensions. Quantitative and qualitative results on DISC-Law-Eval demonstrate the effectiveness of our system in serving various users across diverse legal scenarios. The detailed resources are available at https://github.com/FudanDISC/DISC-LawLLM.

cs.CL↗
arXiv2023

SPM: Structured Pretraining and Matching Architectures for Relevance Modeling in Meituan Search

In e-commerce search, relevance between query and documents is an essential requirement for satisfying user experience. Different from traditional e-commerce platforms that offer products, users search on life service platforms such as Meituan mainly for product providers, which usually have abundant structured information, e.g. name, address, category, thousands of products. Modeling search relevance with these rich structured contents is challenging due to the following issues: (1) there is language distribution discrepancy among different fields of structured document, making it difficult to directly adopt off-the-shelf pretrained language model based methods like BERT. (2) different fields usually have different importance and their length vary greatly, making it difficult to extract document information helpful for relevance matching. To tackle these issues, in this paper we propose a novel two-stage pretraining and matching architecture for relevance matching with rich structured documents. At pretraining stage, we propose an effective pretraining method that employs both query and multiple fields of document as inputs, including an effective information compression method for lengthy fields. At relevance matching stage, a novel matching method is proposed by leveraging domain knowledge in search query to generate more effective document representations for relevance scoring. Extensive offline experiments and online A/B tests on millions of users verify that the proposed architectures effectively improve the performance of relevance modeling. The model has already been deployed online, serving the search traffic of Meituan for over a year.

cs.IR↗
arXiv2023

Sequential image recovery using joint hierarchical Bayesian learning

Recovering temporal image sequences (videos) based on indirect, noisy, or incomplete data is an essential yet challenging task. We specifically consider the case where each data set is missing vital information, which prevents the accurate recovery of the individual images. Although some recent (variational) methods have demonstrated high-resolution image recovery based on jointly recovering sequential images, there remain robustness issues due to parameter tuning and restrictions on the type of the sequential images. Here, we present a method based on hierarchical Bayesian learning for the joint recovery of sequential images that incorporates prior intra- and inter-image information. Our method restores the missing information in each image by "borrowing" it from the other images. As a result, \emph{all} of the individual reconstructions yield improved accuracy. Our method can be used for various data acquisitions and allows for uncertainty quantification. Some preliminary results indicate its potential use for sequential deblurring and magnetic resonance imaging.

cs.CV↗
arXiv2023

Exploring assessment method of technological advancement based on literature cross-citation

Assessing advancements of technology is essential for creating science and technology policies and making informed investments in the technology market. However, current methods primarily focus on the characteristics of the technologies themselves, making it difficult to accurately assess technologies across various fields and generations. To address this challenge, we propose a novel approach that uses bibliometrics, specifically literature citation networks, to measure changes in knowledge flow throughout the evolution of technology. This method can identify diverse trends in technology development and is an effective tool for evaluating technological advancements. We demonstrate its accuracy and applicability by applying it to mobile communication technology and comparing its quantitative results with other assessment methods. Our work provides critical support for assessing different technical routes and formulating technology policy.

stat.AP↗
arXiv2023

Masked Images Are Counterfactual Samples for Robust Fine-tuning

Deep learning models are challenged by the distribution shift between the training data and test data. Recently, the large models pre-trained on diverse data have demonstrated unprecedented robustness to various distribution shifts. However, fine-tuning these models can lead to a trade-off between in-distribution (ID) performance and out-of-distribution (OOD) robustness. Existing methods for tackling this trade-off do not explicitly address the OOD robustness problem. In this paper, based on causal analysis of the aforementioned problems, we propose a novel fine-tuning method, which uses masked images as counterfactual samples that help improve the robustness of the fine-tuning model. Specifically, we mask either the semantics-related or semantics-unrelated patches of the images based on class activation map to break the spurious correlation, and refill the masked patches with patches from other images. The resulting counterfactual samples are used in feature-based distillation with the pre-trained model. Extensive experiments verify that regularizing the fine-tuning with the proposed masked images can achieve a better trade-off between ID and OOD performance, surpassing previous methods on the OOD performance. Our code is available at https://github.com/Coxy7/robust-finetuning.

cs.CV↗
arXiv2023

Sequential edge detection using joint hierarchical Bayesian learning

This paper introduces a new sparse Bayesian learning (SBL) algorithm that jointly recovers a temporal sequence of edge maps from noisy and under-sampled Fourier data. The new method is cast in a Bayesian framework and uses a prior that simultaneously incorporates intra-image information to promote sparsity in each individual edge map with inter-image information to promote similarities in any unchanged regions. By treating both the edges as well as the similarity between adjacent images as random variables, there is no need to separately form regions of change. Thus we avoid both additional computational cost as well as any information loss resulting from pre-processing the image. Our numerical examples demonstrate that our new method compares favorably with more standard SBL approaches.

stat.AP↗
arXiv2023

Twisted bilayer zigzag-graphene nanoribbon junctions with tunable edge states

Stacking two-dimensional layered materials such as graphene and transitional metal dichalcogenides with nonzero interlayer twist angles has recently become attractive because of the emergence of novel physical properties. Stacking of one-dimensional nanomaterials offers the lateral stacking offset as an additional parameter for modulating the resulting material properties. Here, we report that the edge states of twisted bilayer zigzag graphene nanoribbons (TBZGNRs) can be tuned with both the twist angle and the stacking offset. Strong edge state variations in the stacking region are first revealed by density functional theory (DFT) calculations. We construct and characterize twisted bilayer zigzag graphene nanoribbon (TBZGNR) systems on a Au(111) surface using scanning tunneling microscopy. A detailed analysis of three prototypical orthogonal TBZGNR junctions exhibiting different stacking offsets by means of scanning tunneling spectroscopy reveals emergent near-zero-energy states. From a comparison with DFT calculations, we conclude that the emergent edge states originate from the formation of flat bands whose energy and spin degeneracy are highly tunable with the stacking offset. Our work highlights fundamental differences between 2D and 1D twistronics and spurs further investigation of twisted one-dimensional systems.

cond-mat.mes-hall↗
arXiv2023

Determinate Node Selection for Semi-supervised Classification Oriented Graph Convolutional Networks

Graph Convolutional Networks (GCNs) have been proved successful in the field of semi-supervised node classification by extracting structural information from graph data. However, the random selection of labeled nodes used by GCNs may lead to unstable generalization performance of GCNs. In this paper, we propose an efficient method for the deterministic selection of labeled nodes: the Determinate Node Selection (DNS) algorithm. The DNS algorithm identifies two categories of representative nodes in the graph: typical nodes and divergent nodes. These labeled nodes are selected by exploring the structure of the graph and determining the ability of the nodes to represent the distribution of data within the graph. The DNS algorithm can be applied quite simply on a wide range of semi-supervised graph neural network models for node classification tasks. Through extensive experimentation, we have demonstrated that the incorporation of the DNS algorithm leads to a remarkable improvement in the average accuracy of the model and a significant decrease in the standard deviation, as compared to the original method.

cs.LG↗