arXiv subjects

Yongji Wang

Publications and source records attributed to Yongji Wang.

24 records · Page 2Linked to original sources

arXiv2023

Prescribed Time Time-varying Output Formation Tracking for Uncertain Heterogeneous Multi-agent Systems

The time-varying output formation tracking for the heterogeneous multi-agent systems (MAS) is investigated in this paper. First, a distributed observer is constructed for followers to estimate the states of the leader, which can ensure that the estimation error converges to the origin in the prescribed time. Then, the local formation controller is designed for each follower based on the estimation of the observer, under which, the formation errors converge to the origin in the prescribed time as well. That is, the settling time of the whole system can be predefined in advance. It's noted that not only the uncertainties in the state matrix but also the uncertainties in the input matrix are considered, which makes the problem more practical. Last, a simulation is performed to show the effectiveness of the proposed approach.

eess.SY↗

arXiv2022

Waveguide-Integrated Two-Dimensional Material Photodetectors in Thin-Film Lithium Niobate

Thin-film lithium niobate on insulator (LNOI) is a promising platform for optical communications, microwave photonics, and quantum technologies. While many high-performance devices like electro-optic modulators and frequency comb sources have been achieved on LNOI platform, it remains challenging to realize photodetectors (PDs) on LNOI platform using simple and low-cost fabrication techniques. Two-dimensional (2D) materials are excellent candidates to achieve photodetection since they feature strong light-matter interaction, excellent mechanical flexibility, and potential large-scale complementary metal-oxide-semiconductor-compatible fabrication. In this work, we propose to address this demand using an LNOI-2D material platform and demonstrate two types of high-performance LNOI waveguide-integrated 2D material PDs, namely graphene and Tellurium (Te). Specifically, the LNOI-graphene PD features broadband operations at telecom and visible wavelengths, high normalized photocurrent-to-dark current ratios up to 3*106 W-1, and large 3-dB photoelectric bandwidths of over 40 GHz, simultaneously. The LNOI-Te PD on the other hand provides an ultrahigh responsivity of 7 A/W under 0.5 V bias for telecom optical signals while supporting GHz frequency responses. Our results show that the versatile properties of 2D materials and their excellent compatibility with LNOI waveguides could provide important low-cost solutions for system operating point monitoring and high-speed photoelectric conversion in future LN photonic integrated circuits.

physics.optics↗

arXiv2022

When Language Model Meets Private Library

With the rapid development of pre-training techniques, a number of language models have been pre-trained on large-scale code corpora and perform well in code generation. In this paper, we investigate how to equip pre-trained language models with the ability of code generation for private libraries. In practice, it is common for programmers to write code using private libraries. However, this is a challenge for language models since they have never seen private APIs during training. Motivated by the fact that private libraries usually come with elaborate API documentation, we propose a novel framework with two modules: the APIRetriever finds useful APIs, and then the APICoder generates code using these APIs. For APIRetriever, we present a dense retrieval system and also design a friendly interaction to involve uses. For APICoder, we can directly use off-the-shelf language models, or continually pre-train the base model on a code corpus containing API information. Both modules are trained with data from public libraries and can be generalized to private ones. Furthermore, we craft three benchmarks for private libraries, named TorchDataEval, MonkeyEval, and BeatNumEval. Experimental results demonstrate the impressive performance of our framework.

cs.PL↗

arXiv2022

CERT: Continual Pre-Training on Sketches for Library-Oriented Code Generation

Code generation is a longstanding challenge, aiming to generate a code snippet based on a natural language description. Usually, expensive text-code paired data is essential for training a code generation model. Recently, thanks to the success of pre-training techniques, large language models are trained on large-scale unlabelled code corpora and perform well in code generation. In this paper, we investigate how to leverage an unlabelled code corpus to train a model for library-oriented code generation. Since it is a common practice for programmers to reuse third-party libraries, in which case the text-code paired data are harder to obtain due to the huge number of libraries. We observe that library-oriented code snippets are more likely to share similar code sketches. Hence, we present CERT with two steps: a sketcher generates the sketch, then a generator fills the details in the sketch. Both the sketcher and the generator are continually pre-trained upon a base model using unlabelled data. Furthermore, we craft two benchmarks named PandasEval and NumpyEval to evaluate library-oriented code generation. Experimental results demonstrate the impressive performance of CERT. For example, it surpasses the base model by an absolute 15.67% improvement in terms of pass@1 on PandasEval. Our work is available at https://github.com/microsoft/PyCodeGPT.

cs.SE↗

arXiv2021

Fed-EINI: An Efficient and Interpretable Inference Framework for Decision Tree Ensembles in Federated Learning

The increasing concerns about data privacy and security drive an emerging field of studying privacy-preserving machine learning from isolated data sources, i.e., federated learning. A class of federated learning, vertical federated learning, where different parties hold different features for common users, has a great potential of driving a great variety of business cooperation among enterprises in many fields. In machine learning, decision tree ensembles such as gradient boosting decision trees (GBDT) and random forest are widely applied powerful models with high interpretability and modeling efficiency. However, stateof-art vertical federated learning frameworks adapt anonymous features to avoid possible data breaches, makes the interpretability of the model compromised. To address this issue in the inference process, in this paper, we firstly make a problem analysis about the necessity of disclosure meanings of feature to Guest Party in vertical federated learning. Then we find the prediction result of a tree could be expressed as the intersection of results of sub-models of the tree held by all parties. With this key observation, we protect data privacy and allow the disclosure of feature meaning by concealing decision paths and adapt a communication-efficient secure computation method for inference outputs. The advantages of Fed-EINI will be demonstrated through both theoretical analysis and extensive numerical results. We improve the interpretability of the model by disclosing the meaning of features while ensuring efficiency and accuracy.

cs.LG↗

arXiv2012

Incremental Collaborative Filtering Considering Temporal Effects

Recommender systems require their recommendation algorithms to be accurate, scalable and should handle very sparse training data which keep changing over time. Inspired by ant colony optimization, we propose a novel collaborative filtering scheme: Ant Collaborative Filtering that enjoys those favorable characteristics above mentioned. With the mechanism of pheromone transmission between users and items, our method can pinpoint most relative users and items even in face of the sparsity problem. By virtue of the evaporation of existing pheromone, we capture the evolution of user preference over time. Meanwhile, the computation complexity is comparatively small and the incremental update can be done online. We design three experiments on three typical recommender systems, namely movie recommendation, book recommendation and music recommendation, which cover both explicit and implicit rating data. The results show that the proposed algorithm is well suited for real-world recommendation scenarios which have a high throughput and are time sensitive.

cs.IR↗