arXiv subjects

Boli Chen

Publications and source records attributed to Boli Chen.

At least 37 records · Page 2Linked to original sources

arXiv2024

Data-driven modeling and supervisory control system optimization for plug-in hybrid electric vehicles

Learning-based intelligent energy management systems for plug-in hybrid electric vehicles (PHEVs) are crucial for achieving efficient energy utilization. However, their application faces system reliability challenges in the real world, which prevents widespread acceptance by original equipment manufacturers (OEMs). This paper begins by establishing a PHEV model based on physical and data-driven models, focusing on the high-fidelity training environment. It then proposes a real-vehicle application-oriented control framework, combining horizon-extended reinforcement learning (RL)-based energy management with the equivalent consumption minimization strategy (ECMS) to enhance practical applicability, and improves the flawed method of equivalent factor evaluation based on instantaneous driving cycle and powertrain states found in existing research. Finally, comprehensive simulation and hardware-in-the-loop validation are carried out which demonstrates the advantages of the proposed control framework in fuel economy over adaptive-ECMS and rule-based strategies. Compared to conventional RL architectures that directly control powertrain components, the proposed control method not only achieves similar optimality but also significantly enhances the disturbance resistance of the energy management system, providing an effective control framework for RL-based energy management strategies aimed at real-vehicle applications by OEMs.

eess.SY↗

arXiv2024

RaFe: Ranking Feedback Improves Query Rewriting for RAG

As Large Language Models (LLMs) and Retrieval Augmentation Generation (RAG) techniques have evolved, query rewriting has been widely incorporated into the RAG system for downstream tasks like open-domain QA. Many works have attempted to utilize small models with reinforcement learning rather than costly LLMs to improve query rewriting. However, current methods require annotations (e.g., labeled relevant documents or downstream answers) or predesigned rewards for feedback, which lack generalization, and fail to utilize signals tailored for query rewriting. In this paper, we propose ours, a framework for training query rewriting models free of annotations. By leveraging a publicly available reranker, ours~provides feedback aligned well with the rewriting objectives. Experimental results demonstrate that ours~can obtain better performance than baselines.

cs.CL↗

arXiv2024

Let LLMs Take on the Latest Challenges! A Chinese Dynamic Question Answering Benchmark

How to better evaluate the capabilities of Large Language Models (LLMs) is the focal point and hot topic in current LLMs research. Previous work has noted that due to the extremely high cost of iterative updates of LLMs, they are often unable to answer the latest dynamic questions well. To promote the improvement of Chinese LLMs' ability to answer dynamic questions, in this paper, we introduce CDQA, a Chinese Dynamic QA benchmark containing question-answer pairs related to the latest news on the Chinese Internet. We obtain high-quality data through a pipeline that combines humans and models, and carefully classify the samples according to the frequency of answer changes to facilitate a more fine-grained observation of LLMs' capabilities. We have also evaluated and analyzed mainstream and advanced Chinese LLMs on CDQA. Extensive experiments and valuable insights suggest that our proposed CDQA is challenging and worthy of more further study. We believe that the benchmark we provide will become one of the key data resources for improving LLMs' Chinese question-answering ability in the future.

cs.CL↗

arXiv2024

Geo-Encoder: A Chunk-Argument Bi-Encoder Framework for Chinese Geographic Re-Ranking

Chinese geographic re-ranking task aims to find the most relevant addresses among retrieved candidates, which is crucial for location-related services such as navigation maps. Unlike the general sentences, geographic contexts are closely intertwined with geographical concepts, from general spans (e.g., province) to specific spans (e.g., road). Given this feature, we propose an innovative framework, namely Geo-Encoder, to more effectively integrate Chinese geographical semantics into re-ranking pipelines. Our methodology begins by employing off-the-shelf tools to associate text with geographical spans, treating them as chunking units. Then, we present a multi-task learning module to simultaneously acquire an effective attention matrix that determines chunk contributions to extra semantic representations. Furthermore, we put forth an asynchronous update mechanism for the proposed addition task, aiming to guide the model capable of effectively focusing on specific chunks. Experiments on two distinct Chinese geographic re-ranking datasets, show that the Geo-Encoder achieves significant improvements when compared to state-of-the-art baselines. Notably, it leads to a substantial improvement in the Hit@1 score of MGEO-BERT, increasing it by 6.22% from 62.76 to 68.98 on the GeoTES dataset.

cs.CL↗

arXiv2023

Safe Reinforcement Learning in Tensor Reproducing Kernel Hilbert Space

This paper delves into the problem of safe reinforcement learning (RL) in a partially observable environment with the aim of achieving safe-reachability objectives. In traditional partially observable Markov decision processes (POMDP), ensuring safety typically involves estimating the belief in latent states. However, accurately estimating an optimal Bayesian filter in POMDP to infer latent states from observations in a continuous state space poses a significant challenge, largely due to the intractable likelihood. To tackle this issue, we propose a stochastic model-based approach that guarantees RL safety almost surely in the face of unknown system dynamics and partial observation environments. We leveraged the Predictive State Representation (PSR) and Reproducing Kernel Hilbert Space (RKHS) to represent future multi-step observations analytically, and the results in this context are provable. Furthermore, we derived essential operators from the kernel Bayes' rule, enabling the recursive estimation of future observations using various operators. Under the assumption of \textit{undercompleness}, a polynomial sample complexity is established for the RL algorithm for the infinite size of observation and action spaces, ensuring an $ε-$suboptimal safe policy guarantee.

cs.LG↗

arXiv2023

A Real-Time Robust Ecological-Adaptive Cruise Control Strategy for Battery Electric Vehicles

This work addresses the ecological-adaptive cruise control problem for connected electric vehicles by a computationally efficient robust control strategy. The problem is formulated in the space-domain with a realistic description of the nonlinear electric powertrain model and motion dynamics to yield a convex optimal control problem (OCP). The OCP is approached by a novel robust model predictive control (RMPC) method handling various disturbances due to modelling mismatch and inaccurate leading vehicle information. The RMPC problem is solved by semi-definite programming relaxation and single linear matrix inequality (sLMI) techniques for further enhanced computational efficiency. The performance of the proposed real-time robust ecological-adaptive cruise control (REACC) method is evaluated using an experimentally collected driving cycle. Its robustness is verified by comparison with a nominal MPC which is shown to result in speed-limit constraint violations. The energy economy of the proposed method outperforms a state-of-the-art time-domain RMPC scheme, as a more precisely fitted convex powertrain model can be integrated into the space-domain scheme. The additional comparison with a traditional constant distance following strategy (CDFS) further verifies the effectiveness of the proposed REACC. Finally, it is verified that the REACC can be potentially implemented in real-time owing to the sLMI and resulting convex algorithm.

eess.SY↗

arXiv2023

MGeo: Multi-Modal Geographic Pre-Training Method

As a core task in location-based services (LBS) (e.g., navigation maps), query and point of interest (POI) matching connects users' intent with real-world geographic information. Recently, pre-trained models (PTMs) have made advancements in many natural language processing (NLP) tasks. Generic text-based PTMs do not have enough geographic knowledge for query-POI matching. To overcome this limitation, related literature attempts to employ domain-adaptive pre-training based on geo-related corpus. However, a query generally contains mentions of multiple geographic objects, such as nearby roads and regions of interest (ROIs). The geographic context (GC), i.e., these diverse geographic objects and their relationships, is therefore pivotal to retrieving the most relevant POI. Single-modal PTMs can barely make use of the important GC and therefore have limited performance. In this work, we propose a novel query-POI matching method Multi-modal Geographic language model (MGeo), which comprises a geographic encoder and a multi-modal interaction module. MGeo represents GC as a new modality and is able to fully extract multi-modal correlations for accurate query-POI matching. Besides, there is no publicly available benchmark for this topic. In order to facilitate further research, we build a new open-source large-scale benchmark Geographic TExtual Similarity (GeoTES). The POIs come from an open-source geographic information system (GIS). The queries are manually generated by annotators to prevent privacy issues. Compared with several strong baselines, the extensive experiment results and detailed ablation analyses on GeoTES demonstrate that our proposed multi-modal pre-training method can significantly improve the query-POI matching capability of generic PTMs, even when the queries' GC is not provided. Our code and dataset are publicly available at https://github.com/PhantomGrapes/MGeo.

cs.CL↗

arXiv2023

GeoGLUE: A GeoGraphic Language Understanding Evaluation Benchmark

With a fast developing pace of geographic applications, automatable and intelligent models are essential to be designed to handle the large volume of information. However, few researchers focus on geographic natural language processing, and there has never been a benchmark to build a unified standard. In this work, we propose a GeoGraphic Language Understanding Evaluation benchmark, named GeoGLUE. We collect data from open-released geographic resources and introduce six natural language understanding tasks, including geographic textual similarity on recall, geographic textual similarity on rerank, geographic elements tagging, geographic composition analysis, geographic where what cut, and geographic entity alignment. We also pro vide evaluation experiments and analysis of general baselines, indicating the effectiveness and significance of the GeoGLUE benchmark.

cs.CL↗

arXiv2023

A Hierarchical Robust Control Strategy for Decentralized Signal-Free Intersection Management

The development of connected and automated vehicles is the key to improving urban mobility safety and efficiency. This paper focuses on cooperative vehicle management at a signal-free intersection with consideration of vehicle modeling uncertainties and sensor measurement disturbances. The problem is approached by a hierarchical robust control strategy in a decentralized traffic coordination framework where optimal control and tube-based robust model predictive control methods are designed to hierarchically solve the optimal crossing order and the velocity trajectories of a group of CAVs in terms of energy consumption and throughput. To capture the energy consumption of each vehicle, their powertrain system is modeled in line with an electric drive system. With a suitable relaxation and spatial modeling approach, the optimization problems in the proposed strategy can be formulated as convex second-order cone programs, which provide a unique and computationally efficient solution. A rigorous proof of the equivalence between the convexified and the original problems is also provided. Simulation results illustrate the effectiveness and robustness of the proposed strategy and reveal the impact of traffic density on the control solution. The study of the Pareto optimal solutions for the energy-time objective shows that a minor reduction in journey time can considerably reduce energy consumption, which emphasizes the necessity of optimizing their trade-off. Finally, the numerical comparisons carried out for different prediction horizons and sampling intervals provide insight into the control design.

math.OC↗

arXiv2022

Cyber-Resilient Self-Triggered Distributed Control of Networked Microgrids Against Multi-Layer DoS Attacks

Networked microgrids with high penetration of distributed generators have ubiquitous remote information exchange, which may be exposed to various cyber security threats. This paper, for the first time, addresses a consensus problem in terms of frequency synchronisation in networked microgrids subject to multi-layer denial of service (DoS) attacks, which could simultaneously affect communication, measurement and control actuation channels. A unified notion of Persistency-of-Data-Flow (PoDF) is proposed to characterise the data unavailability in different information network links, and further quantifies the multi-layer DoS effects on the hierarchical system. With PoDF, we provide a sufficient condition of the DoS attacks under which the consensus can be preserved with the proposed edge-based self-triggered distributed control framework. In addition, to mitigate the conservativeness of offline design against the worst-case attack across all agents, an online self-adaptive scheme of the control parameters is developed to fully utilise the latest available information of all data transmission channels. Finally, the effectiveness of the proposed cyber-resilient self-triggered distributed control is verified by representative case studies.

eess.SY↗

arXiv2022

A Computationally Efficient Robust Model Predictive Control Framework for Ecological Adaptive Cruise Control Strategy of Electric Vehicles

The recent advancement in vehicular networking technology provides novel solutions for designing intelligent and sustainable vehicle motion controllers. This work addresses a car-following task, where the feedback linearisation method is combined with a robust model predictive control (RMPC) scheme to safely, optimally and efficiently control a connected electric vehicle. In particular, the nonlinear dynamics are linearised through a feedback linearisation method to maintain an efficient computational speed and to guarantee global optimality. At the same time, the inevitable model mismatch is dealt with by the RMPC design. The control objective of the RMPC is to optimise the electric energy efficiency of the ego vehicle with consideration of a bounded model mismatch disturbance subject to satisfaction of physical and safety constraints. Numerical results first verify the validity and robustness through a comparison between the proposed RMPC and a nominal MPC. Further investigation into the performance of the proposed method reveals a higher energy efficiency and passenger comfort level as compared to a recently proposed benchmark method using the space-domain modelling approach.

eess.SY↗

arXiv2022

Economic Potential for Hybrid Electric Vehicles in Urban Signal-free Intersections with Decentralized MPC

The development of electric and connected vehicles as well as automated driving technologies are key towards the smart city, with convenient urban mobility and high energy economy performance. However, the global rise in electricity price provokes renewed interest on CAVs with hybrid electric powertrains rather than considering battery electric powertrains. This paper provides a decentralized coordination strategy for a group of connected and autonomous vehicles (CAVs) with a series hybrid electric (sHEV) powertrain at signal-free intersections. The problem is formulated as a convex form with suitable relaxation and approximation of the powertrain model and solved by decentralized model predictive control, which is able to ensure a rapid search and unique solution in real time. Numerical examples validate the effectiveness of the proposed methods concerning physical and safety constraints. By utilizing the petrol fuel and battery charging prices over the last year, the performance of the proposed approach is evaluated against the optimal results produced by two benchmark solutions, conventional vehicles (CVs) and battery electric vehicles (BEVs). The comparison results show that the traveling cost of sHEVs approaches and even under some circumstances reaches the same level as for BEVs, which indicates the importance of hybridization, particularly under the current rising electricity price situation.

eess.SY↗

arXiv2022

Forging Multiple Training Objectives for Pre-trained Language Models via Meta-Learning

Multiple pre-training objectives fill the vacancy of the understanding capability of single-objective language modeling, which serves the ultimate purpose of pre-trained language models (PrLMs), generalizing well on a mass of scenarios. However, learning multiple training objectives in a single model is challenging due to the unknown relative significance as well as the potential contrariety between them. Empirical studies have shown that the current objective sampling in an ad-hoc manual setting makes the learned language representation barely converge to the desired optimum. Thus, we propose \textit{MOMETAS}, a novel adaptive sampler based on meta-learning, which learns the latent sampling pattern on arbitrary pre-training objectives. Such a design is lightweight with negligible additional training overhead. To validate our approach, we adopt five objectives and conduct continual pre-training with BERT-base and BERT-large models, where MOMETAS demonstrates universal performance gain over other rule-based sampling strategies on 14 natural language processing tasks.

cs.CL↗

arXiv2022

A Convex Optimal Control Framework for Autonomous Vehicle Intersection Crossing

Cooperative vehicle management emerges as a promising solution to improve road traffic safety and efficiency. This paper addresses the speed planning problem for connected and autonomous vehicles (CAVs) at an unsignalized intersection with consideration of turning maneuvers. The problem is approached by a hierarchical centralized coordination scheme that successively optimizes the crossing order and velocity trajectories of a group of vehicles so as to minimize their total energy consumption and travel time required to pass the intersection. For an accurate estimate of the energy consumption of each CAV, the vehicle modeling framework in this paper captures 1) friction losses that affect longitudinal vehicle dynamics, and 2) the powertrain of each CAV in line with a battery-electric architecture. It is shown that the underlying optimization problem subject to safety constraints for powertrain operation, cornering and collision avoidance, after convexification and relaxation in some aspects can be formulated as two second-order cone programs, which ensures a rapid solution search and a unique global optimum. Simulation case studies are provided showing the tightness of the convex relaxation bounds, the overall effectiveness of the proposed approach, and its advantages over a benchmark solution invoking the widely used first-in-first-out policy. The investigation of Pareto optimal solutions for the two objectives (travel time and energy consumption) highlights the importance of optimizing their trade-off, as small compromises in travel time could produce significant energy savings.

eess.SY↗

arXiv2022

Fixed-Time Convergent Distributed Observer Design of Linear Systems: A Kernel-Based Approach

The robust distributed state estimation for a class of continuous-time linear time-invariant systems is achieved by a novel kernel-based distributed observer, which, for the first time, ensures fixed-time convergence properties. The communication network between the agents is prescribed by a directed graph in which each node involves a fixed-time convergent estimator. The local observer estimates and broadcasts the observable states among neighbours so that the full state vector can be recovered at each node and the estimation error reaches zero after a predefined fixed time in the absence of perturbation. This represents a new distributed estimation framework that enables faster convergence speed and further reduced information exchange compared to a conventional Luenberger-like approach. The ubiquitous time-varying communication delay across the network is suitably compensated by a prediction scheme. Moreover, the robustness of the algorithm in the presence of bounded measurement and process noise is characterised. Numerical simulations and comparisons demonstrate the effectiveness of the observer and its advantages over the existing methods.

eess.SY↗

arXiv2022

Optimal Energy Management of Series Hybrid Electric Vehicles with Engine Start-Stop System

This paper develops energy management (EM) control for series hybrid electric vehicles (HEVs) that include an engine start-stop system (SSS). The objective of the control is to optimally split the energy between the sources of the powertrain and achieve fuel consumption minimization. In contrast to existing works, a fuel penalty is used to characterize more realistically SSS engine restarts, to enable more realistic design and testing of control algorithms. The paper first derives two important analytic results: a) analytic EM optimal solutions of fundamental and commonly used series HEV frameworks, and b) proof of optimality of charge sustaining operation in series HEVs. It then proposes a novel heuristic control strategy, the hysteresis power threshold strategy (HPTS), by amalgamating simple and effective control rules extracted from the suite of derived analytic EM optimal solutions. The decision parameters of the control strategy are small in number and freely tunable. The overall control performance can be fully optimized for different HEV parameters and driving cycles by a systematic tuning process, while also targeting charge sustaining operation. The performance of HPTS is evaluated and benchmarked against existing methodologies, including dynamic programming (DP) and a recently proposed state-of-the-art heuristic strategy. The results show the effectiveness and robustness of the HPTS and also indicate its potential to be used as the benchmark strategy for high fidelity HEV models, where DP is no longer applicable due to computational complexity.

eess.SY↗

arXiv2022

AISHELL-NER: Named Entity Recognition from Chinese Speech

Named Entity Recognition (NER) from speech is among Spoken Language Understanding (SLU) tasks, aiming to extract semantic information from the speech signal. NER from speech is usually made through a two-step pipeline that consists of (1) processing the audio using an Automatic Speech Recognition (ASR) system and (2) applying an NER tagger to the ASR outputs. Recent works have shown the capability of the End-to-End (E2E) approach for NER from English and French speech, which is essentially entity-aware ASR. However, due to the many homophones and polyphones that exist in Chinese, NER from Chinese speech is effectively a more challenging task. In this paper, we introduce a new dataset AISEHLL-NER for NER from Chinese speech. Extensive experiments are conducted to explore the performance of several state-of-the-art methods. The results demonstrate that the performance could be improved by combining entity-aware ASR and pretrained NER tagger, which can be easily applied to the modern SLU pipeline. The dataset is publicly available at github.com/Alibaba-NLP/AISHELL-NER.

cs.CL↗

arXiv2021

Probing BERT in Hyperbolic Spaces

Recently, a variety of probing tasks are proposed to discover linguistic properties learned in contextualized word embeddings. Many of these works implicitly assume these embeddings lay in certain metric spaces, typically the Euclidean space. This work considers a family of geometrically special spaces, the hyperbolic spaces, that exhibit better inductive biases for hierarchical structures and may better reveal linguistic hierarchies encoded in contextualized representations. We introduce a Poincare probe, a structural probe projecting these embeddings into a Poincare subspace with explicitly defined hierarchies. We focus on two probing objectives: (a) dependency trees where the hierarchy is defined as head-dependent structures; (b) lexical sentiments where the hierarchy is defined as the polarity of words (positivity and negativity). We argue that a key desideratum of a probe is its sensitivity to the existence of linguistic structures. We apply our probes on BERT, a typical contextualized embedding model. In a syntactic subspace, our probe better recovers tree structures than Euclidean probes, revealing the possibility that the geometry of BERT syntax may not necessarily be Euclidean. In a sentiment subspace, we reveal two possible meta-embeddings for positive and negative sentiments and show how lexically-controlled contextualization would change the geometric localization of embeddings. We demonstrate the findings with our Poincare probe via extensive experiments and visualization. Our results can be reproduced at https://github.com/FranxYao/PoincareProbe.

cs.CL↗