arXiv subjects

Yang Li

Publications and source records attributed to Yang Li.

At least 1,171 records · Page 65Linked to original sources

arXiv2021

Automated Hyperparameter Optimization Challenge at CIKM 2021 AnalyticCup

In this paper, we describe our method for tackling the automated hyperparameter optimization challenge in QQ Browser 2021 AI Algorithm Competiton (ACM CIKM 2021 AnalyticCup Track 2). The competition organizers provide anonymized realistic industrial tasks and datasets for black-box optimization. Based on our open-sourced package OpenBox, we adopt the Bayesian optimization framework for configuration sampling and a heuristic early stopping strategy. We won first place in both the preliminary and final contests with the results of 0.938291 and 0.918753, respectively.

cs.LG↗

arXiv2021

Path-Enhanced Multi-Relational Question Answering with Knowledge Graph Embeddings

The multi-relational Knowledge Base Question Answering (KBQA) system performs multi-hop reasoning over the knowledge graph (KG) to achieve the answer. Recent approaches attempt to introduce the knowledge graph embedding (KGE) technique to handle the KG incompleteness but only consider the triple facts and neglect the significant semantic correlation between paths and multi-relational questions. In this paper, we propose a Path and Knowledge Embedding-Enhanced multi-relational Question Answering model (PKEEQA), which leverages multi-hop paths between entities in the KG to evaluate the ambipolar correlation between a path embedding and a multi-relational question embedding via a customizable path representation mechanism, benefiting for achieving more accurate answers from the perspective of both the triple facts and the extra paths. Experimental results illustrate that PKEEQA improves KBQA models' performance for multi-relational question answering with explainability to some extent derived from paths.

cs.CL↗

arXiv2021

Node Dependent Local Smoothing for Scalable Graph Learning

Recent works reveal that feature or label smoothing lies at the core of Graph Neural Networks (GNNs). Concretely, they show feature smoothing combined with simple linear regression achieves comparable performance with the carefully designed GNNs, and a simple MLP model with label smoothing of its prediction can outperform the vanilla GCN. Though an interesting finding, smoothing has not been well understood, especially regarding how to control the extent of smoothness. Intuitively, too small or too large smoothing iterations may cause under-smoothing or over-smoothing and can lead to sub-optimal performance. Moreover, the extent of smoothness is node-specific, depending on its degree and local structure. To this end, we propose a novel algorithm called node-dependent local smoothing (NDLS), which aims to control the smoothness of every node by setting a node-specific smoothing iteration. Specifically, NDLS computes influence scores based on the adjacency matrix and selects the iteration number by setting a threshold on the scores. Once selected, the iteration number can be applied to both feature smoothing and label smoothing. Experimental results demonstrate that NDLS enjoys high accuracy -- state-of-the-art performance on node classifications tasks, flexibility -- can be incorporated with any models, scalability and efficiency -- can support large scale graphs with fast training.

cs.LG↗

arXiv2021

Premelting and formation of ice due to Casimir-Lifshitz interactions: Impact of improved parameterization for materials

Recently, the premelting and formation of ice due to the Casimir-Lifshitz interaction, proposed in early 1990s by Elbaum and Schick [Phys. Rev. Lett. 66, 1713-1716 (1991)], have been generalized to diverse practical scenarios, yielding novel physical intuitions and possibilities of application for those phenomena. The properties of materials, in particular, the electrical permittivity and permeability, exert significant influences on the Casimir-Cifshitz energies and forces, and hence on the corresponding premelting and formation of ice. To address these influences in detail and explore the resulting physics, here we revisit and extend the analyses of previous work, with both the dielectric data utilized there and the latest dielectric functions for ice and cold water. While our previous results are rederived, an error there has also been spotted. For the four-layer cases considered by some of us, the existence of stable configurations depending on the initial conditions has been confirmed, and different types of stability corresponding to minima of the Casimir-Lifshitz free energy are demonstrated. As the new dielectric functions for ice and cold water deviate considerably from those used by Elbaum and Schick, their vital impacts on three- and four-layer configurations are therefore being reconsidered.

cond-mat.mtrl-sci↗

arXiv2021

The energetics of quantum vacuum friction: Field fluctuations

Quantum fluctuations can induce a friction on a neutral but polarizable particle and cause it to radiate energy even if the particle is moving in free space filled with blackbody radiation, and is not in contact with or close to any surface or other object. We explore the energetics of such a particle moving uniformly in vacuum, continuing our previous investigations of quantum friction. The intrinsic polarizability of the particle is considered to be purely real before it is dressed by radiation. The particle is then guaranteed to be in the nonequilibrium steady state (NESS), where it absorbs and emits energy at the same rate. We first calculate the quantum frictional power and force on the particle in the rest frame of the blackbody radiation from first principles, namely the Maxwell-Heaviside equations and the Lorentz force law. Then we provide a simpler method of obtaining the same quantities in the rest frame of the particle by using the principle of virtual work. The equivalence of the two approaches is illustrated. The formulas we derive for quantum vacuum frictional power and force are fully relativistic and applicable to finite temperature. In NESS, the quantum vacuum frictional force on the particle is shown to be a true drag, independent of the model for polarizability and the polarization state of the particle. Finally, we give an estimate of the quantum vacuum friction on a gold atom and comment on the feasibility of detecting such quantum vacuum frictional effects.

hep-th↗

arXiv2021

An algebra isomorphism on $U(\mathfrak{gl}_n)$

For each positive integer $n$, let $\mathfrak{s}_n=\mathfrak{gl}_n\ltimes \mathbb{C}^n$. We show that $U(\mathfrak{s}_{n})_{X_{n}}\cong \mathcal{D}_{n}\otimes U(\mathfrak{s}_{n-1})$ for any $n\in\mathbb{Z}_{\geq 2}$, where $U(\mathfrak{s}_{n})_{X_{n}}$ is the localization of $U(\mathfrak{s}_{n})$ with respect to the subset $X_n:=\{e_1^{i_1}\cdots e_{n}^{i_{n}}\mid i_1,\dots,i_{n}\in \mathbb{Z}_+\}$, and $\mathcal{D}_{n}$ is the Weyl algebra $\mathbb{C}[x_1^{\pm 1}, \cdots, x_{n}^{\pm 1}, \frac{\partial}{\partial x_1},\cdots, \frac{\partial}{\partial x_{n}}]$. As an application, we give a new proof of the Gelfand-Kirillov conjecture for $\mathfrak{s}_n$ and $\mathfrak{gl}_n$. Moreover we show that the category of Harish-Chandra $U(\mathfrak{s}_{n})_{X_n}$-modules with a fixed weight support is equivalent to the category of finite dimensional $\mathfrak{s}_{n-1}$-modules whose representation type is wild, for any $n\in \mathbb{Z}_{\geq 2}$.

math.RT↗

arXiv2021

Creating User Interface Mock-ups from High-Level Text Descriptions with Deep-Learning Models

The design process of user interfaces (UIs) often begins with articulating high-level design goals. Translating these high-level design goals into concrete design mock-ups, however, requires extensive effort and UI design expertise. To facilitate this process for app designers and developers, we introduce three deep-learning techniques to create low-fidelity UI mock-ups from a natural language phrase that describes the high-level design goal (e.g. "pop up displaying an image and other options"). In particular, we contribute two retrieval-based methods and one generative method, as well as pre-processing and post-processing techniques to ensure the quality of the created UI mock-ups. We quantitatively and qualitatively compare and contrast each method's ability in suggesting coherent, diverse and relevant UI design mock-ups. We further evaluate these methods with 15 professional UI designers and practitioners to understand each method's advantages and disadvantages. The designers responded positively to the potential of these methods for assisting the design process.

cs.HC↗

arXiv2021

Implementation of a time-dependent multiconfiguration self-consistent-field method for coupled electron-nuclear dynamics in diatomic molecules driven by intense laser pulses

We present an implementation of a time-dependent multiconfiguration self-consistent-field (TD-MCSCF) method [R. Anzaki et al., Phys. Chem. Chem. Phys. 19, 22008 (2017)] with the full configuration interaction expansion for coupled electron-nuclear dynamics in diatomic molecules subject to a strong laser field. In this method, the total wave function is expressed as a superposition of different configurations constructed from time-dependent electronic Slater determinants and time-dependent orthonormal nuclear basis functions. The primitive basis functions of nuclei and electrons are strictly independent of each other without invoking the Born-Oppenheimer approximation. Our implementation treats the electronic motion in its full dimensionality on curvilinear coordinates, while the nuclear wave function is propagated on a one-dimensional stretching coordinate with rotational nuclear motion neglected. We apply the present implementation to high-harmonic generation and dissociative ionization of a hydrogen molecule and discuss the role of electron-nuclear correlation.

physics.atom-ph↗

arXiv2021

Extracting stochastic dynamical systems with $α$-stable Lévy noise from data

With the rapid increase of valuable observational, experimental and simulated data for complex systems, much efforts have been devoted to identifying governing laws underlying the evolution of these systems. Despite the wide applications of non-Gaussian fluctuations in numerous physical phenomena, the data-driven approaches to extract stochastic dynamical systems with (non-Gaussian) Lévy noise are relatively few so far. In this work, we propose a data-driven method to extract stochastic dynamical systems with $α$-stable Lévy noise from short burst data based on the properties of $α$-stable distributions. More specifically, we first estimate the Lévy jump measure and noise intensity via computing mean and variance of the amplitude of the increment of the sample paths. Then we approximate the drift coefficient by combining nonlocal Kramers-Moyal formulas with normalizing flows. Numerical experiments on one- and two-dimensional prototypical examples illustrate the accuracy and effectiveness of our method. This approach will become an effective scientific tool in discovering stochastic governing laws of complex phenomena and understanding dynamical behaviors under non-Gaussian fluctuations.

stat.ML↗

arXiv2021

Bitcoin Transaction Strategy Construction Based on Deep Reinforcement Learning

The emerging cryptocurrency market has lately received great attention for asset allocation due to its decentralization uniqueness. However, its volatility and brand new trading mode have made it challenging to devising an acceptable automatically-generating strategy. This study proposes a framework for automatic high-frequency bitcoin transactions based on a deep reinforcement learning algorithm-proximal policy optimization (PPO). The framework creatively regards the transaction process as actions, returns as awards and prices as states to align with the idea of reinforcement learning. It compares advanced machine learning-based models for static price predictions including support vector machine (SVM), multi-layer perceptron (MLP), long short-term memory (LSTM), temporal convolutional network (TCN), and Transformer by applying them to the real-time bitcoin price and the experimental results demonstrate that LSTM outperforms. Then an automatically-generating transaction strategy is constructed building on PPO with LSTM as the basis to construct the policy. Extensive empirical studies validate that the proposed method performs superiorly to various common trading strategy benchmarks for a single financial product. The approach is able to trade bitcoins in a simulated environment with synchronous data and obtains a 31.67% more return than that of the best benchmark, improving the benchmark by 12.75%. The proposed framework can earn excess returns through both the period of volatility and surge, which opens the door to research on building a single cryptocurrency trading strategy based on deep learning. Visualizations of trading the process show how the model handles high-frequency transactions to provide inspiration and demonstrate that it can be expanded to other financial products.

cs.LG↗

arXiv2021

Autonomous Vehicles Drive into Shared Spaces: eHMI Design Concept Focusing on Vulnerable Road Users

In comparison to conventional traffic designs, shared spaces promote a more pleasant urban environment with slower motorized movement, smoother traffic, and less congestion. In the foreseeable future, shared spaces will be populated with a mixture of autonomous vehicles (AVs) and vulnerable road users (VRUs) like pedestrians and cyclists. However, a driver-less AV lacks a way to communicate with the VRUs when they have to reach an agreement of a negotiation, which brings new challenges to the safety and smoothness of the traffic. To find a feasible solution to integrating AVs seamlessly into shared-space traffic, we first identified the possible issues that the shared-space designs have not considered for the role of AVs. Then an online questionnaire was used to ask participants about how they would like a driver of the manually driving vehicle to communicate with VRUs in a shared space. We found that when the driver wanted to give some suggestions to the VRUs in a negotiation, participants thought that the communications via the driver's body behaviors were necessary. Besides, when the driver conveyed information about her/his intentions and cautions to the VRUs, participants selected different communication methods with respect to their transport modes (as a driver, pedestrian, or cyclist). These results suggest that novel eHMIs might be useful for AV-VRU communication when the original drivers are not present. Hence, a potential eHMI design concept was proposed for different VRUs to meet their various expectations. In the end, we further discussed the effects of the eHMIs on improving the sociality in shared spaces and the autonomous driving systems.

cs.HC↗

arXiv2021

Hierarchical Relation-Guided Type-Sentence Alignment for Long-Tail Relation Extraction with Distant Supervision

Distant supervision uses triple facts in knowledge graphs to label a corpus for relation extraction, leading to wrong labeling and long-tail problems. Some works use the hierarchy of relations for knowledge transfer to long-tail relations. However, a coarse-grained relation often implies only an attribute (e.g., domain or topic) of the distant fact, making it hard to discriminate relations based solely on sentence semantics. One solution is resorting to entity types, but open questions remain about how to fully leverage the information of entity types and how to align multi-granular entity types with sentences. In this work, we propose a novel model to enrich distantly-supervised sentences with entity types. It consists of (1) a pairwise type-enriched sentence encoding module injecting both context-free and -related backgrounds to alleviate sentence-level wrong labeling, and (2) a hierarchical type-sentence alignment module enriching a sentence with the triple fact's basic attributes to support long-tail relations. Our model achieves new state-of-the-art results in overall and long-tail performance on benchmarks.

cs.CL↗

arXiv2021

Phase Noise Model for Continuous-Variable Quantum Key Distribution Using a Local Local Oscillator

The value of residual phase noise, after phase compensation, is one of the key limitations of performance improvement for continuous-variable quantum key distribution using a local local oscillator (LLO CV-QKD) system, since it is the major excess noise. However, due to the non-ideality of the realistic devices implemented in practice, for example, imperfect lasers, detectors and unbalanced interferometers, the value of residual phase noise in current system is still relatively large. Here, we develop a phase noise model to improve the phase noise tolerance of the LLO CV-QKD schemes. In our model, part of the phase-reference measurement noise associated with detection efficiency and electronic noise of Bob's detector as well as a real-time monitored phasereference intensity at Bob's side is considered trusted because it can be locally calibrated by Bob. We show that using our phase noise model can significantly improve the secure key rate and transmission distance of the LLO CV-QKD system. We further conduct an experiment to substantiate the superiority of the phase noise model. Based on experimental data of a LLO CV-QKD system in the 25 km optical fiber channel, we demonstrate that the secure key rate under our phase noise model is approximately 40% higher than that under the conventional phase noise model.

quant-ph↗

arXiv2021

Class-conditioned Domain Generalization via Wasserstein Distributional Robust Optimization

Given multiple source domains, domain generalization aims at learning a universal model that performs well on any unseen but related target domain. In this work, we focus on the domain generalization scenario where domain shifts occur among class-conditional distributions of different domains. Existing approaches are not sufficiently robust when the variation of conditional distributions given the same class is large. In this work, we extend the concept of distributional robust optimization to solve the class-conditional domain generalization problem. Our approach optimizes the worst-case performance of a classifier over class-conditional distributions within a Wasserstein ball centered around the barycenter of the source conditional distributions. We also propose an iterative algorithm for learning the optimal radius of the Wasserstein balls automatically. Experiments show that the proposed framework has better performance on unseen target domain than approaches without domain generalization.

cs.LG↗

arXiv2021

Global well-posedness for the three-dimensional full compressible viscous non-resistive MHD system

In this paper, we consider the three-dimensional full compressible viscous non-resistive MHD system. Global well-posedness is proved for an initial-boundary value problem around a strong background magnetic field. It is also shown that the unique solution converges to the steady state at an almost exponential rate as time tends to infinity. The proof is based on the celebrated two-tier energy method, due to Guo and Tice [\emph{Arch. Ration. Mech. Anal.}, 207 (2013), pp. 459--531; \emph{Anal. PDE.}, 6 (2013), pp. 287--369], reformulated in Lagrangian coordinates. The obtained result may be viewed as an extension of Tan and Wang [\emph{SIAM J. Math. Anal.}, 50 (2018), pp. 1432--1470] to the context of heat-conductive fluids. This in particular verifies the stabilization effects of vertical magnetic field in the full compressible non-resistive fluids.

math.AP↗

arXiv2021

Non-intrusive load decomposition based on CNN-LSTM hybrid deep learning model

With the rapid development of science and technology, the problem of energy load monitoring and decomposition of electrical equipment has been receiving widespread attention from academia and industry. For the purpose of improving the performance of non-intrusive load decomposition, a non-intrusive load decomposition method based on a hybrid deep learning model is proposed. In this method, first of all, the data set is normalized and preprocessed. Secondly, a hybrid deep learning model integrating convolutional neural network (CNN) with long short-term memory network (LSTM) is constructed to fully excavate the spatial and temporal characteristics of load data. Finally, different evaluation indicators are used to analyze the mixture. The model is fully evaluated, and contrasted with the traditional single deep learning model. Experimental results on the open dataset UK-DALE show that the proposed algorithm improves the performance of the whole network system. In this paper, the proposed decomposition method is compared with the existing traditional deep learning load decomposition method. At the same time, compared with the obtained methods: spectral decomposition, EMS, LSTM-RNN, and other algorithms, the accuracy of load decomposition is significantly improved, and the test accuracy reaches 98%.

eess.SP↗

arXiv2021

Extracting Stochastic Governing Laws by Nonlocal Kramers-Moyal Formulas

With the rapid development of computational techniques and scientific tools, great progress of data-driven analysis has been made to extract governing laws of dynamical systems from data. Despite the wide occurrences of non-Gaussian fluctuations, the effective data-driven methods to identify stochastic differential equations with non-Gaussian Lévy noise are relatively few so far. In this work, we propose a data-driven approach to extract stochastic governing laws with both (Gaussian) Brownian motion and (non-Gaussian) Lévy motion, from short bursts of simulation data. Specifically, we use the normalizing flows technology to estimate the transition probability density function (solution of nonlocal Fokker-Planck equation) from data, and then substitute it into the recently proposed nonlocal Kramers-Moyal formulas to approximate Lévy jump measure, drift coefficient and diffusion coefficient. We demonstrate that this approach can learn the stochastic differential equation with Lévy motion. We present examples with one- and two-dimensional, decoupled and coupled systems to illustrate our method. This approach will become an effective tool for discovering stochastic governing laws and understanding complex dynamical behaviors.

math.DS↗

arXiv2021

Lightweight Self-Attentive Sequential Recommendation

Modern deep neural networks (DNNs) have greatly facilitated the development of sequential recommender systems by achieving state-of-the-art recommendation performance on various sequential recommendation tasks. Given a sequence of interacted items, existing DNN-based sequential recommenders commonly embed each item into a unique vector to support subsequent computations of the user interest. However, due to the potentially large number of items, the over-parameterised item embedding matrix of a sequential recommender has become a memory bottleneck for efficient deployment in resource-constrained environments, e.g., smartphones and other edge devices. Furthermore, we observe that the widely-used multi-head self-attention, though being effective in modelling sequential dependencies among items, heavily relies on redundant attention units to fully capture both global and local item-item transition patterns within a sequence. In this paper, we introduce a novel lightweight self-attentive network (LSAN) for sequential recommendation. To aggressively compress the original embedding matrix, LSAN leverages the notion of compositional embeddings, where each item embedding is composed by merging a group of selected base embedding vectors derived from substantially smaller embedding matrices. Meanwhile, to account for the intrinsic dynamics of each item, we further propose a temporal context-aware embedding composition scheme. Besides, we develop an innovative twin-attention network that alleviates the redundancy of the traditional multi-head self-attention while retaining full capacity for capturing long- and short-term (i.e., global and local) item dependencies. Comprehensive experiments demonstrate that LSAN significantly advances the accuracy and memory efficiency of existing sequential recommenders.

cs.IR↗