arXiv subjects

Na Li

Publications and source records attributed to Na Li.

At least 199 records · Page 11Linked to original sources

arXiv2022

Detecting Interlocutor Confusion in Situated Human-Avatar Dialogue: A Pilot Study

In order to enhance levels of engagement with conversational systems, our long term research goal seeks to monitor the confusion state of a user and adapt dialogue policies in response to such user confusion states. To this end, in this paper, we present our initial research centred on a user-avatar dialogue scenario that we have developed to study the manifestation of confusion and in the long term its mitigation. We present a new definition of confusion that is particularly tailored to the requirements of intelligent conversational system development for task-oriented dialogue. We also present the details of our Wizard-of-Oz based data collection scenario wherein users interacted with a conversational avatar and were presented with stimuli that were in some cases designed to invoke a confused state in the user. Post study analysis of this data is also presented. Here, three pre-trained deep learning models were deployed to estimate base emotion, head pose and eye gaze. Despite a small pilot study group, our analysis demonstrates a significant relationship between these indicators and confusion states. We understand this as a useful step forward in the automated analysis of the pragmatics of dialogue.

cs.HC↗

arXiv2022

Transferring Studies Across Embodiments: A Case Study in Confusion Detection

Human-robot studies are expensive to conduct and difficult to control, and as such researchers sometimes turn to human-avatar interaction in the hope of faster and cheaper data collection that can be transferred to the robot domain. In terms of our work, we are particularly interested in the challenge of detecting and modelling user confusion in interaction, and as part of this research programme, we conducted situated dialogue studies to investigate users' reactions in confusing scenarios that we give in both physical and virtual environments. In this paper, we present a combined review of these studies and the results that we observed across these two embodiments. For the physical embodiment, we used a Pepper Robot, while for the virtual modality, we used a 3D avatar. Our study shows that despite attitudinal differences and technical control limitations, there were a number of similarities detected in user behaviour and self-reporting results across embodiment options. This work suggests that, while avatar interaction is no true substitute for robot interaction studies, sufficient care in study design may allow well executed human-avatar studies to supplement more challenging human-robot studies.

cs.HC↗

arXiv2022

Notebook-as-a-VRE (NaaVRE): from private notebooks to a collaborative cloud virtual research environment

Virtual Research Environments (VREs) provide user-centric support in the lifecycle of research activities, e.g., discovering and accessing research assets, or composing and executing application workflows. A typical VRE is often implemented as an integrated environment, which includes a catalog of research assets, a workflow management system, a data management framework, and tools for enabling collaboration among users. Notebook environments, such as Jupyter, allow researchers to rapidly prototype scientific code and share their experiments as online accessible notebooks. Jupyter can support several popular languages that are used by data scientists, such as Python, R, and Julia. However, such notebook environments do not have seamless support for running heavy computations on remote infrastructure or finding and accessing software code inside notebooks. This paper investigates the gap between a notebook environment and a VRE and proposes an embedded VRE solution for the Jupyter environment called Notebook-as-a-VRE (NaaVRE). The NaaVRE solution provides functional components via a component marketplace and allows users to create a customized VRE on top of the Jupyter environment. From the VRE, a user can search research assets (data, software, and algorithms), compose workflows, manage the lifecycle of an experiment, and share the results among users in the community. We demonstrate how such a solution can enhance a legacy workflow that uses Light Detection and Ranging (LiDAR) data from country-wide airborne laser scanning surveys for deriving geospatial data products of ecosystem structure at high resolution over broad spatial extents. This enables users to scale out the processing of multi-terabyte LiDAR point clouds for ecological applications to more data sources in a distributed cloud environment.

cs.DC↗

arXiv2022

Observation of biradical spin coupling through hydrogen bonds

Investigation of intermolecular electron spin interaction is of fundamental importance in both science and technology.Here, radical pairs of all-trans retinoic acid molecules on Au(111) are created using an ultra-low temperature scanning tunneling microscope. Antiferromagnetic coupling between two radicals is identified by magnetic-field dependent spectroscopy.The measured exchange energies are from 0.1 to 1.0 meV. The biradical spin coupling is mediated through O-H$\cdots$O hydrogen bonds, as elucidated from analysis combining density functional theory calculation and a modern version of valence bond theory.

cond-mat.mes-hall↗

arXiv2022

Deep Learning-Based Intra Mode Derivation for Versatile Video Coding

In intra coding, Rate Distortion Optimization (RDO) is performed to achieve the optimal intra mode from a pre-defined candidate list. The optimal intra mode is also required to be encoded and transmitted to the decoder side besides the residual signal, where lots of coding bits are consumed. To further improve the performance of intra coding in Versatile Video Coding (VVC), an intelligent intra mode derivation method is proposed in this paper, termed as Deep Learning based Intra Mode Derivation (DLIMD). In specific, the process of intra mode derivation is formulated as a multi-class classification task, which aims to skip the module of intra mode signaling for coding bits reduction. The architecture of DLIMD is developed to adapt to different quantization parameter settings and variable coding blocks including non-square ones, which are handled by one single trained model. Different from the existing deep learning based classification problems, the hand-crafted features are also fed into the intra mode derivation network besides the learned features from feature learning network. To compete with traditional method, one additional binary flag is utilized in the video codec to indicate the selected scheme with RDO. Extensive experimental results reveal that the proposed method can achieve 2.28%, 1.74%, and 2.18% bit rate reduction on average for Y, U, and V components on the platform of VVC test model, which outperforms the state-of-the-art works.

eess.IV↗

arXiv2022

Escaping High-order Saddles in Policy Optimization for Linear Quadratic Gaussian (LQG) Control

First order policy optimization has been widely used in reinforcement learning. It guarantees to find the optimal policy for the state-feedback linear quadratic regulator (LQR). However, the performance of policy optimization remains unclear for the linear quadratic Gaussian (LQG) control where the LQG cost has spurious suboptimal stationary points. In this paper, we introduce a novel perturbed policy gradient (PGD) method to escape a large class of bad stationary points (including high-order saddles). In particular, based on the specific structure of LQG, we introduce a novel reparameterization procedure which converts the iterate from a high-order saddle to a strict saddle, from which standard random perturbations in PGD can escape efficiently. We further characterize the high-order saddles that can be escaped by our algorithm.

math.OC↗

arXiv2022

Layer-by-Layer Epitaxy of Multilayer MoS2 Wafers

Two-dimensional (2D) semiconductor of MoS2 has great potential for advanced electronics technologies beyond silicon1-9. So far, high-quality monolayer MoS2 wafers10-12 are already available and various demonstrations from individual transistors to integrated circuits have also been shown13-15. In addition to the monolayer, multilayers have narrower band gaps but improved carrier mobilities and current capacities over the monolayer5,16-18. However, achieving high-quality multilayer MoS2 wafers remains a challenge. Here we report the growth of high quality multilayer MoS2 4-inch wafers via the layer-by-layer epitaxy process. The epitaxy leads to well-defined stacking orders between adjacent epitaxial layers and offers a delicate control of layer numbers up to 6. Systematic evaluations on the atomic structures and electronic properties were carried out for achieved wafers with different layer numbers. Significant improvements on device performances were found in thicker-layer field effect transistors (FETs), as expected. For example, the average field-effect mobility (μFE) at room temperature (RT) can increase from ~80 cm2V-1s-1 for monolayer to ~110/145 cm2V-1s-1 for bilayer/trilayer devices. The highest RT μFE=234.7 cm2V-1s-1 and a record-high on-current densities of 1.704 mAμm-1 at Vds=2 V were also achieved in trilayer MoS2 FETs with a high on/off ratio exceeding 107. Our work hence moves a step closer to practical applications of 2D MoS2 in electronics.

physics.app-ph↗

arXiv2022

Finite groups in which every maximal subgroup is nilpotent or normal or has $p'$-order

Let $G$ be a finite group and $p$ a fixed prime divisor of $|G|$. Combining the nilpotence, the normality and the order of groups together, we prove that if every maximal subgroup of $G$ is nilpotent or normal or has $p'$-order, then (1) $G$ is solvable; (2) $G$ has a Sylow tower; (3) There exists at most one prime divisor $q$ of $|G|$ such that $G$ is neither $q$-nilpotent nor $q$-closed, where $q\neq p$.

math.GR↗

arXiv2022

Bipolaronic nature of the pseudogap in (TaSe4)2I revealed via weak photoexcitation

The origin of the pseudogap in many strongly correlated materials has been a longstanding puzzle. Here, we uncover which many-body interactions underlie the pseudogap in quasi-one-dimensional (quasi-1D) material (TaSe4)2I by weak photo-excitation of the material to partially melt the ground state order and thereby reveal the underlying states in the gap. We observe the appearance of both dispersive and flat bands by using time- and angle-resolved photoemission spectroscopy. We assign the dispersive band to a single-particle bare band, while the flat band to a collection of single-polaron sub-bands. Our results provide direct experimental evidence that many-body interactions among small Holstein polarons i.e., the formation of bipolarons, are primarily responsible for the pseudogap in (TaSe4)2I. Recent theoretical studies of the Holstein model support the presence of such a bipolaron-to-polaron crossover. We also observe dramatically different relaxation times for the excited in-gap states in (TaSe4)2I (~600 fs) compared with another quasi-1D material Rb0.3MoO3 (~60 fs), which provides a new method for distinguishing between pseudogaps induced by polaronic or Luttinger-liquid many-body interactions.

cond-mat.str-el↗

arXiv2022

Reinforcement Learning for Selective Key Applications in Power Systems: Recent Advances and Future Challenges

With large-scale integration of renewable generation and distributed energy resources, modern power systems are confronted with new operational challenges, such as growing complexity, increasing uncertainty, and aggravating volatility. Meanwhile, more and more data are becoming available owing to the widespread deployment of smart meters, smart sensors, and upgraded communication networks. As a result, data-driven control techniques, especially reinforcement learning (RL), have attracted surging attention in recent years. This paper provides a comprehensive review of various RL techniques and how they can be applied to decision-making and control in power systems. In particular, we select three key applications, i.e., frequency regulation, voltage control, and energy management, as examples to illustrate RL-based models and solutions. We then present the critical issues in the application of RL, i.e., safety, robustness, scalability, and data. Several potential future directions are discussed as well.

cs.LG↗

arXiv2022

Realization of fast all-microwave CZ gates with a tunable coupler

The development of high-fidelity two-qubit quantum gates is essential for digital quantum computing. Here, we propose and realize an all-microwave parametric Controlled-Z (CZ) gates by coupling strength modulation in a superconducting Transmon qubit system with tunable couplers. After optimizing the design of the tunable coupler together with the control pulse numerically, we experimentally realized a 100 ns CZ gate with high fidelity of 99.38%$ \pm$0.34% and the control error being 0.1%. We note that our CZ gates are not affected by pulse distortion and do not need pulse correction, {providing a solution for the real-time pulse generation in a dynamic quantum feedback circuit}. With the expectation of utilizing our all-microwave control scheme to reduce the number of control lines through frequency multiplexing in the future, our scheme draws a blueprint for the high-integrable quantum hardware design.

quant-ph↗

arXiv2022

The CUHK-TENCENT speaker diarization system for the ICASSP 2022 multi-channel multi-party meeting transcription challenge

This paper describes our speaker diarization system submitted to the Multi-channel Multi-party Meeting Transcription (M2MeT) challenge, where Mandarin meeting data were recorded in multi-channel format for diarization and automatic speech recognition (ASR) tasks. In these meeting scenarios, the uncertainty of the speaker number and the high ratio of overlapped speech present great challenges for diarization. Based on the assumption that there is valuable complementary information between acoustic features, spatial-related and speaker-related features, we propose a multi-level feature fusion mechanism based target-speaker voice activity detection (FFM-TS-VAD) system to improve the performance of the conventional TS-VAD system. Furthermore, we propose a data augmentation method during training to improve the system robustness when the angular difference between two speakers is relatively small. We provide comparisons for different sub-systems we used in M2MeT challenge. Our submission is a fusion of several sub-systems and ranks second in the diarization task.

eess.AS↗

arXiv2022

System-level, Input-output and New Parameterizations of Stabilizing Controllers, and Their Numerical Computation

It is known that the set of internally stabilizing controller $\mathcal{C}_{\text{stab}}$ is non-convex, but it admits convex characterizations using certain closed-loop maps: a classical result is the Youla parameterization, and two recent notions are the system-level parameterization (SLP) and the input-output parameterization (IOP). In this paper, we address the existence of new convex parameterizations and discuss potential tradeoffs of each parametrization in different scenarios. Our main contributions are: 1) We reveal that only four groups of stable closed-loop transfer matrices are equivalent to internal stability: one of them is used in the SLP, another one is used in the IOP, and the other two are new, leading to two new convex parameterizations of $\mathcal{C}_{\text{stab}}$. 2) We investigate the properties of these parameterizations after imposing the finite impulse response (FIR) approximation, revealing that the IOP has the best ability of approximating $\mathcal{C}_{\text{stab}}$ given FIR constraints. 3) These four parameterizations require no \emph{a priori} doubly-coprime factorization of the plant, but impose a set of equality constraints. However, these equality constraints will never be satisfied exactly in floating-point arithmetic computation and/or implementation. We prove that the IOP is numerically robust for open-loop stable plants, in the sense that small mismatches in the equality constraints do not compromise the closed-loop stability; but a direct IOP implementation will fail to stabilize open-loop unstable systems in practice. The SLP is known to enjoy numerical robustness in the state feedback case; here, we show that numerical robustness of the four-block SLP controller requires case-by-case analysis even the plant is open-loop stable.

math.OC↗

arXiv2022

Realization of an Error-Correcting Surface Code with Superconducting Qubits

Quantum error correction is a critical technique for transitioning from noisy intermediate-scale quantum (NISQ) devices to fully fledged quantum computers. The surface code, which has a high threshold error rate, is the leading quantum error correction code for two-dimensional grid architecture. So far, the repeated error correction capability of the surface code has not been realized experimentally. Here, we experimentally implement an error-correcting surface code, the distance-3 surface code which consists of 17 qubits, on the \textit{Zuchongzhi} 2.1 superconducting quantum processor. By executing several consecutive error correction cycles, the logical error can be significantly reduced after applying corrections, achieving the repeated error correction of surface code for the first time. This experiment represents a fully functional instance of an error-correcting surface code, providing a key step on the path towards scalable fault-tolerant quantum computing.

quant-ph↗

arXiv2021

Communication-Efficient Distributed SGD with Compressed Sensing

We consider large scale distributed optimization over a set of edge devices connected to a central server, where the limited communication bandwidth between the server and edge devices imposes a significant bottleneck for the optimization procedure. Inspired by recent advances in federated learning, we propose a distributed stochastic gradient descent (SGD) type algorithm that exploits the sparsity of the gradient, when possible, to reduce communication burden. At the heart of the algorithm is to use compressed sensing techniques for the compression of the local stochastic gradients at the device side; and at the server side, a sparse approximation of the global stochastic gradient is recovered from the noisy aggregated compressed local gradients. We conduct theoretical analysis on the convergence of our algorithm in the presence of noise perturbation incurred by the communication channels, and also conduct numerical experiments to corroborate its effectiveness.

math.OC↗

arXiv2021

Scalable Reinforcement Learning for Multi-Agent Networked Systems

We study reinforcement learning (RL) in a setting with a network of agents whose states and actions interact in a local manner where the objective is to find localized policies such that the (discounted) global reward is maximized. A fundamental challenge in this setting is that the state-action space size scales exponentially in the number of agents, rendering the problem intractable for large networks. In this paper, we propose a Scalable Actor Critic (SAC) framework that exploits the network structure and finds a localized policy that is an $O(ρ^κ)$-approximation of a stationary point of the objective for some $ρ\in(0,1)$, with complexity that scales with the local state-action space size of the largest $κ$-hop neighborhood of the network. We illustrate our model and approach using examples from wireless communication, epidemics and traffic.

math.OC↗

arXiv2021

Safe Adaptive Learning-based Control for Constrained Linear Quadratic Regulators with Regret Guarantees

We study the adaptive control of an unknown linear system with a quadratic cost function subject to safety constraints on both the states and actions. The challenges of this problem arise from the tension among safety, exploration, performance, and computation. To address these challenges, we propose a polynomial-time algorithm that guarantees feasibility and constraint satisfaction with high probability under proper conditions. Our algorithm is implemented on a single trajectory and does not require system restarts. Further, we analyze the regret of our learning algorithm compared to the optimal safe linear controller with known model information. The proposed algorithm can achieve a $\tilde O(T^{2/3})$ regret, where $T$ is the number of stages and $\tilde O(\cdot)$ absorbs some logarithmic terms of $T$.

eess.SY↗

arXiv2021

Optimal Distributed Energy Resource Coordination: A Decomposition Method Based on Distribution Locational Marginal Costs

In this paper, we consider the day-ahead operational planning problem of a radial distribution network hosting Distributed Energy Resources (DERs) including rooftop solar and storage-like loads, such as electric vehicles. We present a novel decomposition method that is based on a centralized AC Optimal Power Flow (AC OPF) problem interacting iteratively with self-dispatching DER problems adapting to real and reactive power Distribution Locational Marginal Costs. We illustrate the applicability and tractability of the proposed method on an actual distribution feeder, while modeling the full complexity of spatiotemporal DER capabilities and preferences, and accounting for instances of non-exact AC OPF convex relaxations. We show that the proposed method achieves optimal Grid-DER coordination, by successively improving feasible AC OPF solutions, and discovers spatiotemporally varying marginal costs in distribution networks that are key to optimal DER scheduling by modeling losses, ampacity and voltage congestion, and, most importantly, dynamic asset degradation.

math.OC↗