Searcharxiv⌕ Search

arXiv subjects

Lu Liu

Publications and source records attributed to Lu Liu.

At least 127 records · Page 7Linked to original sources
arXiv2023

Bridging Data-Driven and Knowledge-Driven Approaches for Safety-Critical Scenario Generation in Automated Vehicle Validation

Automated driving vehicles~(ADV) promise to enhance driving efficiency and safety, yet they face intricate challenges in safety-critical scenarios. As a result, validating ADV within generated safety-critical scenarios is essential for both development and performance evaluations. This paper investigates the complexities of employing two major scenario-generation solutions: data-driven and knowledge-driven methods. Data-driven methods derive scenarios from recorded datasets, efficiently generating scenarios by altering the existing behavior or trajectories of traffic participants but often falling short in considering ADV perception; knowledge-driven methods provide effective coverage through expert-designed rules, but they may lead to inefficiency in generating safety-critical scenarios within that coverage. To overcome these challenges, we introduce BridgeGen, a safety-critical scenario generation framework, designed to bridge the benefits of both methodologies. Specifically, by utilizing ontology-based techniques, BridgeGen models the five scenario layers in the operational design domain (ODD) from knowledge-driven methods, ensuring broad coverage, and incorporating data-driven strategies to efficiently generate safety-critical scenarios. An optimized scenario generation toolkit is developed within BridgeGen. This expedites the crafting of safety-critical scenarios through a combination of traditional optimization and reinforcement learning schemes. Extensive experiments conducted using Carla simulator demonstrate the effectiveness of BridgeGen in generating diverse safety-critical scenarios.

cs.LG↗
arXiv2023

Varying magnetism in the lattice distorted Y2NiIrO6 and La2NiIrO6

We investigate the electronic and magnetic properties of the newly synthesized double perovskites Y$_{2}$NiIrO$_{6}$ and La$_{2}$NiIrO$_{6}$, using density functional calculations, crystal field theory, superexchange pictures, and Monte Carlo simulations. We find that both systems are antiferromagnetic (AFM) Mott insulators, with the high-spin Ni$^{2+}$ $t_{2g}$$^{6}e_{g}$$^{2}$ ($S=1$) and the low-spin Ir$^{4+}$ $t_{2g}$$^{5}$ ($S=1/2$) configurations. We address that their lattice distortion induces $t_{2g}$-$e_{g}$ orbital mixing and thus enables the normal Ni$^{+}$-Ir$^{5+}$ charge excitation with the electron hopping from the Ir `$t_{2g}$' to Ni `$e_g$' orbitals, which promotes the AFM Ni$^{2+}$-Ir$^{4+}$ coupling. Therefore, the increasing $t_{2g}$-$e_{g}$ mixing accounts for the enhanced $T_{\rm N}$ from the less distorted La$_{2}$NiIrO$_{6}$ to the more distorted Y$_{2}$NiIrO$_{6}$. Moreover, our test calculations find that in the otherwise ideally cubic Y$_{2}$NiIrO$_{6}$, the Ni$^{+}$-Ir$^{5+}$ charge excitation is forbidden, and only the abnormal Ni$^{3+}$-Ir$^{3+}$ excitation gives a weakly ferromagnetic (FM) behavior. Furthermore, we find that owing to the crystal field splitting, Hund exchange, and broad band formation in the highly coordinated fcc sublattice, Ir$^{4+}$ ions are not in the $j_{\rm eff}=1/2$ state but in the $S=1/2$ state carrying a finite orbital moment by spin-orbit coupling (SOC). This work clarifies the varying magnetism in Y$_{2}$NiIrO$_{6}$ and La$_{2}$NiIrO$_{6}$ associated with the lattice distortions.

cond-mat.mtrl-sci↗
arXiv2023

Reversible Graph Neural Network-based Reaction Distribution Learning for Multiple Appropriate Facial Reactions Generation

Generating facial reactions in a human-human dyadic interaction is complex and highly dependent on the context since more than one facial reactions can be appropriate for the speaker's behaviour. This has challenged existing machine learning (ML) methods, whose training strategies enforce models to reproduce a specific (not multiple) facial reaction from each input speaker behaviour. This paper proposes the first multiple appropriate facial reaction generation framework that re-formulates the one-to-many mapping facial reaction generation problem as a one-to-one mapping problem. This means that we approach this problem by considering the generation of a distribution of the listener's appropriate facial reactions instead of multiple different appropriate facial reactions, i.e., 'many' appropriate facial reaction labels are summarised as 'one' distribution label during training. Our model consists of a perceptual processor, a cognitive processor, and a motor processor. The motor processor is implemented with a novel Reversible Multi-dimensional Edge Graph Neural Network (REGNN). This allows us to obtain a distribution of appropriate real facial reactions during the training process, enabling the cognitive processor to be trained to predict the appropriate facial reaction distribution. At the inference stage, the REGNN decodes an appropriate facial reaction by using this distribution as input. Experimental results demonstrate that our approach outperforms existing models in generating more appropriate, realistic, and synchronized facial reactions. The improved performance is largely attributed to the proposed appropriate facial reaction distribution learning strategy and the use of a REGNN. The code is available at https://github.com/TongXu-05/REGNN-Multiple-Appropriate-Facial-Reaction-Generation.

cs.CV↗
arXiv2023

Combining Policy Gradient and Safety-Based Control for Autonomous Driving

With the advancement of data-driven techniques, addressing continuous con-trol challenges has become more efficient. However, the reliance of these methods on historical data introduces the potential for unexpected decisions in novel scenarios. To enhance performance in autonomous driving and collision avoidance, we propose a symbiotic fusion of policy gradient with safety-based control. In this study, we em-ploy the Deep Deterministic Policy Gradient (DDPG) algorithm to enable autono-mous driving in the absence of surrounding vehicles. By training the vehicle's driving policy within a stable and familiar environment, a robust and efficient learning pro-cess is achieved. Subsequently, an artificial potential field approach is utilized to formulate a collision avoidance algorithm, accounting for the presence of surround-ing vehicles. Furthermore, meticulous consideration is given to path tracking meth-ods. The amalgamation of these approaches demonstrates substantial performance across diverse scenarios, underscoring its potential for advancing autonomous driving while upholding safety standards.

cs.RO↗
arXiv2023

Worst-Case Morphs using Wasserstein ALI and Improved MIPGAN

A morph is a combination of two separate facial images and contains identity information of two different people. When used in an identity document, both people can be authenticated by a biometric Face Recognition (FR) system. Morphs can be generated using either a landmark-based approach or approaches based on deep learning such as Generative Adversarial Networks (GAN). In a recent paper, we introduced a \emph{worst-case} upper bound on how challenging morphing attacks can be for an FR system. The closer morphs are to this upper bound, the bigger the challenge they pose to FR. We introduced an approach with which it was possible to generate morphs that approximate this upper bound for a known FR system (white box), but not for unknown (black box) FR systems. In this paper, we introduce a morph generation method that can approximate worst-case morphs even when the FR system is not known. A key contribution is that we include the goal of generating difficult morphs \emph{during} training. Our method is based on Adversarially Learned Inference (ALI) and uses concepts from Wasserstein GANs trained with Gradient Penalty, which were introduced to stabilise the training of GANs. We include these concepts to achieve similar improvement in training stability and call the resulting method Wasserstein ALI (WALI). We finetune WALI using loss functions designed specifically to improve the ability to manipulate identity information in facial images and show how it can generate morphs that are more challenging for FR systems than landmark- or GAN-based morphs. We also show how our findings can be used to improve MIPGAN, an existing StyleGAN-based morph generator.

cs.CV↗
arXiv2023

Improved scaling of the entanglement entropy of quantum antiferromagnetic Heisenberg systems

In this paper, we derive corrections to the subleading logarithmic term of the entanglement entropy in systems with spontaneous broken continuous symmetry. Using quantum Monte Carlo simulations, we show that the improved scaling formula leads to much better estimations of the number of Goldstone modes in the two-dimensional square lattice spin-1/2 Heisenberg model and bilayer spin-1/2 Heisenberg model in systems of rather small sizes, compared with previous results. In addition, the universal geometry-dependent finite constant in the entanglement entropy scaling is also obtained in good agreement with the theoretical value.

cond-mat.str-el↗
arXiv2023

Coding information into all infinite subsets of a dense set

Suppose you have an uncomputable set $X$ and you want to find a set $A$, all of whose infinite subsets compute $X$. There are several ways to do this, but all of them seem to produce a set $A$ which is fairly sparse. We show that this is necessary in the following technical sense: if $X$ is uncomputable and $A$ is a set of positive lower density then $A$ has an infinite subset which does not compute $X$. We also prove an analogous result for PA degree: if $X$ is uncomputable and $A$ is a set of positive lower density then $A$ has an infinite subset which is not of PA degree. We will show that these theorems are sharp in certain senses and also prove a quantitative version formulated in terms of Kolmogorov complexity. Our results use a modified version of Mathias forcing and build on work by Seetapun, Liu, and others on the reverse math of Ramsey's theorem for pairs.

math.LO↗
arXiv2023

A volatile polymer stamp for large-scale, etching-free, and ultraclean transfer and assembly of two-dimensional materials and its heterostructures

The intact transfer and assembly of two-dimensional (2D) materials and their heterostructures are critical for their integration into advanced electronic and optical devices. Herein, we report a facile technique called volatile polymer stamping (VPS) to achieve efficient transfer of 2D materials and assembly of large-scale heterojunctions with clean interfaces. The central feature of the VPS technique is the use of volatile polyphthalaldehyde (PPA) together with hydrophobic polystyrene (PS). While PS enables the direct delamination of 2D materials from hydrophilic substrates owing to water intercalation, PPA can protect 2D materials from solution attack and maintain their integrity during PS removal. Thereafter, PPA can be completely removed by thermal annealing at 180 °C. The proposed VPS technique overcomes the limitations of currently used transfer techniques, such as chemical etching during the delamination stage, solution tearing during cleaning, and contamination from polymer residues.

physics.app-ph↗
arXiv2023

Improving Coreference Resolution by Leveraging Entity-Centric Features with Graph Neural Networks and Second-order Inference

One of the major challenges in coreference resolution is how to make use of entity-level features defined over clusters of mentions rather than mention pairs. However, coreferent mentions usually spread far apart in an entire text, which makes it extremely difficult to incorporate entity-level features. We propose a graph neural network-based coreference resolution method that can capture the entity-centric information by encouraging the sharing of features across all mentions that probably refer to the same real-world entity. Mentions are linked to each other via the edges modeling how likely two linked mentions point to the same entity. Modeling by such graphs, the features between mentions can be shared by message passing operations in an entity-centric manner. A global inference algorithm up to second-order features is also presented to optimally cluster mentions into consistent groups. Experimental results show our graph neural network-based method combing with the second-order decoding algorithm (named GNNCR) achieved close to state-of-the-art performance on the English CoNLL-2012 Shared Task dataset.

cs.CL↗
arXiv2023

MRecGen: Multimodal Appropriate Reaction Generator

Verbal and non-verbal human reaction generation is a challenging task, as different reactions could be appropriate for responding to the same behaviour. This paper proposes the first multiple and multimodal (verbal and nonverbal) appropriate human reaction generation framework that can generate appropriate and realistic human-style reactions (displayed in the form of synchronised text, audio and video streams) in response to an input user behaviour. This novel technique can be applied to various human-computer interaction scenarios by generating appropriate virtual agent/robot behaviours. Our demo is available at \url{https://github.com/SSYSteve/MRecGen}.

cs.CV↗
arXiv2023

Stochastic Verification Theorems for Stochastic Control Problems of Reflected FBSDEs

In this paper, the stochastic verification theorems for stochastic control problems of reflected forward-backward stochastic differential equations are studied. We carry out the work within the frameworks of classical and viscosity solutions. The sufficient conditions of verifying the controls to be optimal are given. We also construct the feedback optimal control laws from the classical and viscosity solutions of the associated Hamilton-Jacobi-Bellman equations with obstacles. Finally, we apply the theoretical results in two concrete examples. One is for the case of the classical solution, and the other is for the case of the viscosity solution.

math.OC↗
arXiv2023

Carlson-Simpson's lemma and applications in reverse mathematics

We study the reverse mathematics of infinitary extensions of the Hales-Jewett theorem, due to Carlson and Simpson. These theorems have multiple applications in Ramsey's theory, such as the existence of finite big Ramsey numbers for the triangle-free graph, or the Dual Ramsey theorem. We show in particular that the Open Dual Ramsey theorem holds in $\mathsf{ACA}^{+}_0$.

math.LO↗
arXiv2023

Combatting Front-Running in Smart Contracts: Attack Mining, Benchmark Construction and Vulnerability Detector Evaluation

Front-running attacks have been a major concern on the blockchain. Attackers launch front-running attacks by inserting additional transactions before upcoming victim transactions to manipulate victim transaction executions and make profits. Recent studies have shown that front-running attacks are prevalent on the Ethereum blockchain and have caused millions of US dollars loss. Vulnerable smart contracts, blockchain programs invoked by transactions, are held responsible for front-running attacks. Although techniques to detect front-running vulnerabilities have been proposed, their performance on real-world vulnerable contracts is unclear. There is no large-scale benchmark based on real attacks to evaluate their capabilities. This motivates us to build a benchmark consisting of 513 real-world attacks with vulnerable code labeled in 235 distinct smart contracts. We propose automated techniques to effectively collect real-world attacks and localize the corresponding vulnerable code at scale. Our experiments show that our approaches are effective, achieving higher recall in finding real attacks and higher precision in pinpointing vulnerabilities compared to the existing techniques. The evaluation of seven state-of-the-art vulnerability detection techniques on the benchmark reveals their inadequacy in detecting front-running vulnerabilities, with a low recall of at most 6.04%. Our further analysis identifies four common limitations in existing techniques: lack of support for inter-contract analysis, inefficient constraint solving for cryptographic operations, improper vulnerability patterns, and lack of token support.

cs.SE↗
arXiv2023

Contrasting electronic states of RuI3 and RuCl3

The spin-orbital entangled states are of great interest as they hold exotic phases and intriguing properties. Here we use first-principles calculations to investigate the electronic and magnetic properties of RuI$_{3}$ and RuCl$_{3}$ in both bulk and monolayer cases. Our results show that RuI$_{3}$ bulk is a paramagnetic metal, which is in agreement with recent experiments. We find that the Ru$^{3+}$ ion of RuI$_{3}$ is in the spin-orbital entangled $j_{\rm eff}=\frac{1}{2}$ state. More interestingly, a metal-insulator transition occurs from RuI$_{3}$ bulk to monolayer, and this is mainly due to the band narrowing with the decreasing lattice dimensionality and to the Ru-I hybridization altered by the I $5p$ spin-orbit coupling. In contrast, RuCl$_{3}$ bulk and monolayer both show Mott-insulating behavior, the Ru$^{3+}$ ion is in the formal $S=\frac{1}{2}$ and $L=1$ state with a large in-plane orbital moment, and this result well explains the experimental large effective magnetic moment of RuCl$_{3}$ and the strong in-plane magnetization. The present work demonstrates the contrasting spin-orbital states and the varying properties of RuI$_{3}$ and RuCl$_{3}$.

cond-mat.str-el↗
arXiv2023

Robust Symbol Level Precoding for Overlay Cognitive Radio Networks

This paper focuses on designing robust symbol-level precoding (SLP) in an overlay cognitive radio (CR) network, where the primary and secondary networks transmit signals concurrently. When the primary base station (PBS) shares data and perfect channel state information (CSI) with the cognitive base station (CBS), we derive an SLP approach that minimizes the CR transmission power and satisfies symbol-wise Safety Margin (SM) constraints of both primary users (PUs) and cognitive users (CUs). The resulting optimization has a quadratic objective and linear inequality (LI) constraints, which can be solved by standard convex methods. For the case of imperfect CSI from the PBS, we propose robust SLP schemes. First, with a norm-bounded CSI error model to approximate the uncertain channels, we adopt a max-min philosophy to conservatively achieve robust SLP constraints. Second, we use the additive quantization noise model (AQNM) to describe the quantized PBS CSI and employ a stochastic constraint to formulate the problem. Both robust approaches also result in a quadratic objective with LI constraints. Simulation results show that, rather than simply trying to eliminate the network's cross-interference, the proposed robust SLP schemes enable the primary and secondary networks to aid each other in meeting their quality of service constraints.

eess.SP↗
arXiv2023

One-Bit Massive MIMO Precoding for Frequency-Selective Fading Channels

One-bit digital-to-analog converters (DACs) are a practical and promising solution for reducing cost and power consumption in massive multiple-input multiple-output (MIMO) systems. However, the one-bit precoding problem is NP-hard and even more challenging in frequency-selective fading channels compared to the flat-fading scenario. While block-wise processing (BWP) can effectively address the inter-symbol-interference (ISI) in frequency-selective fading channels, its computational complexity and processing delay can be too high for practical implementation. An alternative solution to alleviate the processing complexity and delay issues is symbol-wise processing (SWP) which sequentially designs the transmit signals. However, existing SWP work leaves unwanted interference for later signal designs. In this paper, we propose an SWP approach which can efficiently address the ISI even at the symbol rate. The idea is to design the transmit signal to not only be beneficial for its time slot, but also to provide constructive interference for subsequent symbols. We develop two active ISI processing methods that significantly outperform a conventional approach, one of which that even outperforms the BWP approach at low SNR.

eess.SP↗
arXiv2023

Bokeh Rendering Based on Adaptive Depth Calibration Network

Bokeh rendering is a popular and effective technique used in photography to create an aesthetically pleasing effect. It is widely used to blur the background and highlight the subject in the foreground, thereby drawing the viewer's attention to the main focus of the image. In traditional digital single-lens reflex cameras (DSLRs), this effect is achieved through the use of a large aperture lens. This allows the camera to capture images with shallow depth-of-field, in which only a small area of the image is in sharp focus, while the rest of the image is blurred. However, the hardware embedded in mobile phones is typically much smaller and more limited than that found in DSLRs. Consequently, mobile phones are not able to capture natural shallow depth-of-field photos, which can be a significant limitation for mobile photography. To address this challenge, in this paper, we propose a novel method for bokeh rendering using the Vision Transformer, a recent and powerful deep learning architecture. Our approach employs an adaptive depth calibration network that acts as a confidence level to compensate for errors in monocular depth estimation. This network is used to supervise the rendering process in conjunction with depth information, allowing for the generation of high-quality bokeh images at high resolutions. Our experiments demonstrate that our proposed method outperforms state-of-the-art methods, achieving about 24.7% improvements on LPIPS and obtaining higher PSNR scores.

cs.CV↗
arXiv2022

Document-level Relation Extraction with Relation Correlations

Document-level relation extraction faces two overlooked challenges: long-tail problem and multi-label problem. Previous work focuses mainly on obtaining better contextual representations for entity pairs, hardly address the above challenges. In this paper, we analyze the co-occurrence correlation of relations, and introduce it into DocRE task for the first time. We argue that the correlations can not only transfer knowledge between data-rich relations and data-scarce ones to assist in the training of tailed relations, but also reflect semantic distance guiding the classifier to identify semantically close relations for multi-label entity pairs. Specifically, we use relation embedding as a medium, and propose two co-occurrence prediction sub-tasks from both coarse- and fine-grained perspectives to capture relation correlations. Finally, the learned correlation-aware embeddings are used to guide the extraction of relational facts. Substantial experiments on two popular DocRE datasets are conducted, and our method achieves superior results compared to baselines. Insightful analysis also demonstrates the potential of relation correlations to address the above challenges.

cs.CL↗