Searcharxiv⌕ Search

arXiv subjects

Wei Xiao

Publications and source records attributed to Wei Xiao.

At least 109 records · Page 6Linked to original sources

Lifelong Pretraining: Continually Adapting Language Models to Emerging Corpora

Pretrained language models (PTLMs) are typically learned over a large, static corpus and further fine-tuned for various downstream tasks. However, when deployed in the real world, a PTLM-based model must deal with data distributions that deviate from what the PTLM was initially trained on. In this paper, we study a lifelong language model pretraining challenge where a PTLM is continually updated so as to adapt to emerging data. Over a domain-incremental research paper stream and a chronologically-ordered tweet stream, we incrementally pretrain a PTLM with different continual learning algorithms, and keep track of the downstream task performance (after fine-tuning). We evaluate PTLM's ability to adapt to new corpora while retaining learned knowledge in earlier corpora. Our experiments show distillation-based approaches to be most effective in retaining downstream performance in earlier domains. The algorithms also improve knowledge transfer, allowing models to achieve better downstream performance over the latest data, and improve temporal generalization when distribution gaps exist between training and evaluation because of time. We believe our problem formulation, methods, and analysis will inspire future studies towards continual pretraining of language models.

cs.CL↗

Self-Triggered Coordination Control of Connected Automated Vehicles in Traffic Networks

In this paper, a self-triggered scheme is proposed to optimally control the traffic flow of Connected and Automated Vehicles (CAVs) at conflict areas of a traffic network with the main aim of reducing the data exchange among CAVs in the control zone and at the same to minimize the travel time and energy consumption. The safety constraints and the vehicle limitations are considered using the Control Barrier Function (CBF) framework and a self-triggered scheme is proposed using the CBF constraints. Moreover, modified CBF constraints are developed to ensure a minimum inter-event interval for the proposed self-triggered schemes. Finally, it is shown through a simulation study that the number of data exchanges among CAVs is significantly reduced using the proposed self-triggered schemes in comparison with the standard time-triggered framework.

eess.SY↗

ConferencingSpeech 2022 Challenge: Non-intrusive Objective Speech Quality Assessment (NISQA) Challenge for Online Conferencing Applications

With the advances in speech communication systems such as online conferencing applications, we can seamlessly work with people regardless of where they are. However, during online meetings, speech quality can be significantly affected by background noise, reverberation, packet loss, network jitter, etc. Because of its nature, speech quality is traditionally assessed in subjective tests in laboratories and lately also in crowdsourcing following the international standards from ITU-T Rec. P.800 series. However, those approaches are costly and cannot be applied to customer data. Therefore, an effective objective assessment approach is needed to evaluate or monitor the speech quality of the ongoing conversation. The ConferencingSpeech 2022 challenge targets the non-intrusive deep neural network models for the speech quality assessment task. We open-sourced a training corpus with more than 86K speech clips in different languages, with a wide range of synthesized and live degradations and their corresponding subjective quality scores through crowdsourcing. 18 teams submitted their models for evaluation in this challenge. The blind test sets included about 4300 clips from wide ranges of degradations. This paper describes the challenge, the datasets, and the evaluation methods and reports the final results.

cs.SD↗

Optimal Control of Connected Automated Vehicles with Event-Triggered Control Barrier Functions

We address the problem of controlling Connected and Automated Vehicles (CAVs) in conflict areas of a traffic network subject to hard safety constraints. It has been shown that such problems can be solved through a combination of tractable optimal control problem formulations and the use of Control Barrier Functions (CBFs) that guarantee the satisfaction of all constraints. These solutions can be reduced to a sequence of Quadratic Programs (QPs) which are efficiently solved on line over discrete time steps. However, the feasibility of each such QP cannot be guaranteed over every time step. To overcome this limitation, we develop an event-driven approach such that the next QP is triggered by properly defined events and show that this approach can eliminate infeasible cases due to time-driven inter-sampling effects. Simulation examples show how overall infeasibilities can be significantly reduced with the proposed event-triggering scheme, while also reducing the need for communication among CAVs without compromising performance.

eess.SY↗

Control Barrier Functions for Systems with Multiple Control Inputs

Control Barrier Functions (CBFs) are becoming popular tools in guaranteeing safety for nonlinear systems and constraints, and they can reduce a constrained optimal control problem into a sequence of Quadratic Programs (QPs) for affine control systems. The recently proposed High Order Control Barrier Functions (HOCBFs) work for arbitrary relative degree constraints. One of the challenges in a HOCBF is to address the relative degree problem when a system has multiple control inputs, i.e., the relative degree could be defined with respect to different components of the control vector. This paper proposes two methods for HOCBFs to deal with systems with multiple control inputs: a general integral control method and a method which is simpler but limited to specific classes of physical systems. When control bounds are involved, the feasibility of the above mentioned QPs can also be significantly improved with the proposed methods. We illustrate our approaches on a unicyle model with two control inputs, and compare the two proposed methods to demonstrate their effectiveness and performance.

eess.SY↗

Feasibility Guaranteed Traffic Merging Control Using Control Barrier Functions

We consider the merging control problem for Connected and Automated Vehicles (CAVs) aiming to jointly minimize travel time and energy consumption while providing speed-dependent safety guarantees and satisfying velocity and acceleration constraints. Applying the joint optimal control and control barrier function (OCBF) method, a controller that optimally tracks the unconstrained optimal control solution while guaranteeing the satisfaction of all constraints is efficiently obtained by transforming the optimal tracking problem into a sequence of quadratic programs (QPs). However, these QPs can become infeasible, especially under tight control bounds, thus failing to guarantee safety constraints. We solve this problem by deriving a control-dependent feasibility constraint corresponding to each CBF constraint which is added to each QP and we show that each such modified QP is guaranteed to be feasible. Extensive simulations of the merging control problem illustrate the effectiveness of this feasibility guaranteed controller.

eess.SY↗

QaNER: Prompting Question Answering Models for Few-shot Named Entity Recognition

Recently, prompt-based learning for pre-trained language models has succeeded in few-shot Named Entity Recognition (NER) by exploiting prompts as task guidance to increase label efficiency. However, previous prompt-based methods for few-shot NER have limitations such as a higher computational complexity, poor zero-shot ability, requiring manual prompt engineering, or lack of prompt robustness. In this work, we address these shortcomings by proposing a new prompt-based learning NER method with Question Answering (QA), called QaNER. Our approach includes 1) a refined strategy for converting NER problems into the QA formulation; 2) NER prompt generation for QA models; 3) prompt-based tuning with QA models on a few annotated NER examples; 4) zero-shot NER by prompting the QA model. Comparing the proposed approach with previous methods, QaNER is faster at inference, insensitive to the prompt quality, and robust to hyper-parameters, as well as demonstrating significantly better low-resource performance and zero-shot capability.

cs.CL↗

Differentiable Control Barrier Functions for Vision-based End-to-End Autonomous Driving

Guaranteeing safety of perception-based learning systems is challenging due to the absence of ground-truth state information unlike in state-aware control scenarios. In this paper, we introduce a safety guaranteed learning framework for vision-based end-to-end autonomous driving. To this end, we design a learning system equipped with differentiable control barrier functions (dCBFs) that is trained end-to-end by gradient descent. Our models are composed of conventional neural network architectures and dCBFs. They are interpretable at scale, achieve great test performance under limited training data, and are safety guaranteed in a series of autonomous driving scenarios such as lane keeping and obstacle avoidance. We evaluated our framework in a sim-to-real environment, and tested on a real autonomous car, achieving safe lane following and obstacle avoidance via Augmented Reality (AR) and real parked vehicles.

cs.RO↗

Virtual Augmentation Supported Contrastive Learning of Sentence Representations

Despite profound successes, contrastive representation learning relies on carefully designed data augmentations using domain specific knowledge. This challenge is magnified in natural language processing where no general rules exist for data augmentation due to the discrete nature of natural language. We tackle this challenge by presenting a Virtual augmentation Supported Contrastive Learning of sentence representations (VaSCL). Originating from the interpretation that data augmentation essentially constructs the neighborhoods of each training instance, we in turn utilize the neighborhood to generate effective data augmentations. Leveraging the large training batch size of contrastive learning, we approximate the neighborhood of an instance via its K-nearest in-batch neighbors in the representation space. We then define an instance discrimination task regarding this neighborhood and generate the virtual augmentation in an adversarial training manner. We access the performance of VaSCL on a wide range of downstream tasks, and set a new state-of-the-art for unsupervised sentence representation learning.

cs.CL↗

Pairwise Supervised Contrastive Learning of Sentence Representations

Many recent successes in sentence representation learning have been achieved by simply fine-tuning on the Natural Language Inference (NLI) datasets with triplet loss or siamese loss. Nevertheless, they share a common weakness: sentences in a contradiction pair are not necessarily from different semantic categories. Therefore, optimizing the semantic entailment and contradiction reasoning objective alone is inadequate to capture the high-level semantic structure. The drawback is compounded by the fact that the vanilla siamese or triplet losses only learn from individual sentence pairs or triplets, which often suffer from bad local optima. In this paper, we propose PairSupCon, an instance discrimination based approach aiming to bridge semantic entailment and contradiction understanding with high-level categorical concept encoding. We evaluate PairSupCon on various downstream tasks that involve understanding sentence semantics at different granularities. We outperform the previous state-of-the-art method with $10\%$--$13\%$ averaged improvement on eight clustering tasks, and $5\%$--$6\%$ averaged improvement on seven semantic textual similarity (STS) tasks.

cs.CL↗

Gelfand-Kirillov dimensions and associated varieties of highest weight modules

In this paper, we present a uniform formula of Lusztig's $ \mathbf{a}$-functions on classical Weyl groups. Then we obtain an efficient algorithm for the Gelfand-Kirillov dimensions of simple highest weight modules of classical Lie algebras, whose highest weight is not necessarily regular or integral. To deal with type $ D $, we prove an interesting property about domino tableaux by introducing an invariant, called the hollow tableau. As an application, the associated varieties of all the simple highest weight Harish-Chandra modules are explicitly determined, including the exceptional cases.

math.RT↗

Search for topological defect dark matter with a global network of optical magnetometers

Ultralight bosons such as axion-like particles are viable candidates for dark matter. They can form stable, macroscopic field configurations in the form of topological defects that could concentrate the dark matter density into many distinct, compact spatial regions that are small compared to the galaxy but much larger than the Earth. Here, we report the results of a search for transient signals from axion-like particle domain walls with the Global Network of Optical Magnetometers for Exotic physics searches (GNOME). We search the data, consisting of correlated measurements from optical atomic magnetometers located in laboratories all over the world, for patterns of signals propagating through the network consistent with domain walls. The analysis of data from a continuous month-long operation of the GNOME finds no statistically significant signals, thus placing experimental constraints on such dark matter scenarios.

astro-ph.CO↗

BarrierNet: A Safety-Guaranteed Layer for Neural Networks

This paper introduces differentiable higher-order control barrier functions (CBF) that are end-to-end trainable together with learning systems. CBFs are usually overly conservative, while guaranteeing safety. Here, we address their conservativeness by softening their definitions using environmental dependencies without loosing safety guarantees, and embed them into differentiable quadratic programs. These novel safety layers, termed a BarrierNet, can be used in conjunction with any neural network-based controller, and can be trained by gradient descent. BarrierNet allows the safety constraints of a neural controller be adaptable to changing environments. We evaluate them on a series of control problems such as traffic merging and robot navigations in 2D and 3D space, and demonstrate their effectiveness compared to state-of-the-art approaches.

cs.LG↗

On Fractal Features and Fractal Linear Space About Fractal Continuous Functions

This paper investigates fractal dimension of linear combination of fractal continuous functions with the same or different fractal dimensions. It has been proved that: (1) $BV_{I}$ all fractal continuous functions with bounded variation is fractal linear space; (2) ${}^{1}D_{I}$ all fractal continuous functions with Box dimension one is a fractal linear space; (3) ${}^{s}D_{I}$ all fractal continuous functions with identical Box dimension $s(1<s\leq 2)$ is surprisingly a non-fractal linear space, even non-fractal linear manifold, beyond our initial expectation, because the Box dimension of linear combination of fractal continuous functions can take any real number in $[1,s)$ if it exists, and some different upper and lower Box dimension if it does not exit. This attracts our interests to probe into fractal characteristics of ${}^{s}D_{I}$, and get some suggesting results.

math.CA↗

Two-stage Voice Application Recommender System for Unhandled Utterances in Intelligent Personal Assistant

Intelligent personal assistants (IPA) enable voice applications that facilitate people's daily tasks. However, due to the complexity and ambiguity of voice requests, some requests may not be handled properly by the standard natural language understanding (NLU) component. In such cases, a simple reply like "Sorry, I don't know" hurts the user's experience and limits the functionality of IPA. In this paper, we propose a two-stage shortlister-reranker recommender system to match third-party voice applications (skills) to unhandled utterances. In this approach, a skill shortlister is proposed to retrieve candidate skills from the skill catalog by calculating both lexical and semantic similarity between skills and user requests. We also illustrate how to build a new system by using observed data collected from a baseline rule-based system, and how the exposure biases can generate discrepancy between offline and human metrics. Lastly, we present two relabeling methods that can handle the incomplete ground truth, and mitigate exposure bias. We demonstrate the effectiveness of our proposed system through extensive offline experiments. Furthermore, we present online A/B testing results that show a significant boost on user experience satisfaction.

cs.LG↗

Rule-based Evaluation and Optimal Control for Autonomous Driving

We develop optimal control strategies for autonomous vehicles (AVs) that are required to meet complex specifications imposed as rules of the road (ROTR) and locally specific cultural expectations of reasonable driving behavior. We formulate these specifications as rules, and specify their priorities by constructing a priority structure, called \underline{T}otal \underline{OR}der over e\underline{Q}uivalence classes (TORQ). We propose a recursive framework, in which the satisfaction of the rules in the priority structure are iteratively relaxed in reverse order of priority. Central to this framework is an optimal control problem, where convergence to desired states is achieved using Control Lyapunov Functions (CLFs) and clearance with other road users is enforced through Control Barrier Functions (CBFs). We present offline and online approaches to this problem. In the latter, the AV has limited sensing range that affects the activation of the rules, and the control is generated using a receding horizon (Model Predictive Control, MPC) approach. We also show how the offline method can be used for after-the-fact (offline) pass/fail evaluation of trajectories - a given trajectory is rejected if we can find a controller producing a trajectory that leads to less violation of the rule priority structure. We present case studies with multiple driving scenarios to demonstrate the effectiveness of the algorithms, and to compare the offline and online versions of our proposed framework.

cs.RO↗

Jantzen Conjecture for singular characters

We show that the Jantzen filtration of a Verma module (possibly singular) coincides with its radical filtration. It implies that the Jantzen Conjecture on Verma modules holds for all infinitesimal characters, while the regular case was settled by Beilinson and Bernstein by geometric methods and reproved by Williamson by an algebraic approach. The coincidence between Jantzen filtration and radical filtration is also generalized to the case of parabolic Verma modules by Shan's results.

math.RT↗

Decentralized Time and Energy-Optimal Control of Connected and Automated Vehicles in a Roundabout

The paper considers the problem of controlling Connected and Automated Vehicles (CAVs) traveling through a three-entry roundabout so as to jointly minimize both the travel time and the energy consumption while providing speed-dependent safety guarantees, as well as satisfying velocity and acceleration constraints. We first design a systematic approach to dynamically determine the safety constraints and derive the unconstrained optimal control solution. A joint optimal control and barrier function (OCBF) method is then applied to efficiently obtain a controller that optimally track the unconstrained optimal solution while guaranteeing all the constraints. Simulation experiments are performed to compare the optimal controller to a baseline of human-driven vehicles showing effectiveness under symmetric and asymmetric roundabout configurations, balanced and imbalanced traffic rates and different sequencing rules for CAVs.

eess.SY↗