Searcharxiv⌕ Search

arXiv subjects

Yan Li

Publications and source records attributed to Yan Li.

At least 487 records · Page 27Linked to original sources

Electronic Raman Scattering in Suspended Semiconducting Carbon Nanotubes

The electronic Raman scattering (ERS) features of single-walled carbon nanotubes (SWNTs) can reveal a wealth of information about their electronic structures, but have previously been thought to appear exclusively in metallic (M-) but not in semiconducting (S-) SWNTs. We report the experimental observation of the ERS features with an accuracy of 1 meV in suspended S-SWNTs, the processes of which are accomplished via the available high-energy electron-hole pairs. The ERS features can facilitate further systematic studies on the properties of SWNT, both metallic and semiconducting, with defined chirality.

cond-mat.mes-hall↗

Residual Network Based Direct Synthesis of EM Structures: A Study on One-to-One Transformers

We propose using machine learning models for the direct synthesis of on-chip electromagnetic (EM) passive structures to enable rapid or even automated designs and optimizations of RF/mm-Wave circuits. As a proof of concept, we demonstrate the direct synthesis of a 1:1 transformer on a 45nm SOI process using our proposed neural network model. Using pre-existing transformer s-parameter files and their geometric design training samples, the model predicts target geometric designs.

cs.LG↗

Deep Reinforcement Learning with Robust and Smooth Policy

Deep reinforcement learning (RL) has achieved great empirical successes in various domains. However, the large search space of neural networks requires a large amount of data, which makes the current RL algorithms not sample efficient. Motivated by the fact that many environments with continuous state space have smooth transitions, we propose to learn a smooth policy that behaves smoothly with respect to states. We develop a new framework -- \textbf{S}mooth \textbf{R}egularized \textbf{R}einforcement \textbf{L}earning ($\textbf{SR}^2\textbf{L}$), where the policy is trained with smoothness-inducing regularization. Such regularization effectively constrains the search space, and enforces smoothness in the learned policy. Moreover, our proposed framework can also improve the robustness of policy against measurement error in the state space, and can be naturally extended to distribubutionally robust setting. We apply the proposed framework to both on-policy (TRPO) and off-policy algorithm (DDPG). Through extensive experiments, we demonstrate that our method achieves improved sample efficiency and robustness.

cs.LG↗

Air-to-Air Communications Beyond 5G: A Novel 3D CoMP Transmission Scheme

In this paper, a novel $3$D cellular model consisting of aerial base stations (aBSs) and aerial user equipments (aUEs) is proposed, by integrating the coordinated multi-point (CoMP) transmission technique with the theory of stochastic geometry. For this new $3$D architecture, a tractable model for aBSs' deployment based on the binomial-Delaunay tetrahedralization is developed, which ensures seamless coverage for a given space. In addition, a versatile and practical frequency allocation scheme is designed to eliminate the inter-cell interference effectively. Based on this model, performance metrics including the achievable data rate and coverage probability are derived for two types of aUEs: {\it i)} the general aUE (i.e., an aUE having distinct distances from its serving aBSs) and {\it ii)} the worst-case aUE (i.e., an aUE having equal distances from its serving aBSs). Simulation and numerical results demonstrate that the proposed approach emphatically outperforms the conventional binomial-Voronoi tessellation without CoMP. Insightfully, it provides a similar performance to the binomial-Voronoi tessellation which utilizes the conventional CoMP scheme; yet, introducing a considerably reduced computational complexity and backhaul/signaling overhead.

cs.IT↗

Large spin to charge conversion in topological superconductor \b{eta}-PdBi2 at room temperature

\b{eta}-PdBi2 has attracted much attention for its prospective ability to possess simultaneously topological surface and superconducting states due to its unprecedented spin-orbit interaction (SOC). Whereas most works have focused solely on investigating its topological surface states, the coupling between spin and charge degrees of freedom in this class of quantum material remains unexplored. Here we first report a study of spin-to-charge conversion in a \b{eta}-PdBi2 ultrathin film grown by molecular beam epitaxy, utilizing a spin pumping technique to perform inverse spin Hall effect measurements. We find that the room temperature spin Hall angle of Fe/\b{eta}-PdBi2, θ_SH=0.037. This value is one order of magnitude larger than that of reported conventional superconductors, and is comparable to that of the best SOC metals and topological insulators. Our results provide an avenue for developing superconductor-based spintronic applications.

cond-mat.mes-hall↗

LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation

Graph Convolution Network (GCN) has become new state-of-the-art for collaborative filtering. Nevertheless, the reasons of its effectiveness for recommendation are not well understood. Existing work that adapts GCN to recommendation lacks thorough ablation analyses on GCN, which is originally designed for graph classification tasks and equipped with many neural network operations. However, we empirically find that the two most common designs in GCNs -- feature transformation and nonlinear activation -- contribute little to the performance of collaborative filtering. Even worse, including them adds to the difficulty of training and degrades recommendation performance. In this work, we aim to simplify the design of GCN to make it more concise and appropriate for recommendation. We propose a new model named LightGCN, including only the most essential component in GCN -- neighborhood aggregation -- for collaborative filtering. Specifically, LightGCN learns user and item embeddings by linearly propagating them on the user-item interaction graph, and uses the weighted sum of the embeddings learned at all layers as the final embedding. Such simple, linear, and neat model is much easier to implement and train, exhibiting substantial improvements (about 16.0\% relative improvement on average) over Neural Graph Collaborative Filtering (NGCF) -- a state-of-the-art GCN-based recommender model -- under exactly the same experimental setting. Further analyses are provided towards the rationality of the simple LightGCN from both analytical and empirical perspectives.

cs.IR↗

The A Priori Estimate and Existence of the Positive Solution for A Nonlinear System Involving the Fractional Laplacian

In the paper, we consider the fractional elliptic system \begin{equation*}\left\{\begin{array}{ll} (- Δ)^{\frac{α_1}{2}}u(x)+\sum\limits^n_{i=1}b_i(x)\frac{\partial u}{\partial x_i}+B(x)u(x)=f(x,u,v),& \mbox { in } Ω,\\ (- Δ)^{\frac{α_2}{2}}v(x)+\sum\limits^n_{i=1}c_i(x)\frac{\partial v}{\partial x_i}+C(x)v(x)=g(x,u,v),& \mbox { in } Ω,\\ u=v=0, & \mbox { in } \mathbb{R}^n\setminusΩ, \end{array} \right.\label{a-1.2} \end{equation*} where $Ω$ is a bounded domain with $C^2$ boundary in $\mathbb{R}^n$ and $n>\max\{α_1,α_2\}$. We first utilize the blowing-up and re-scaling method to derive the a priori estimate for positive solutions when $1<α_1,α_2 <2$. Then for $0<α_1,α_2 <1$, we obtain the regularity estimate of positive solutions. On top of this, using the topological degree theory we prove the existence of positive solutions.

math.AP↗

Tian's $α_{m,k}^{\hat K}$-invariants on group compactifications

In this paper, we compute Tian's $α_{m,k}^{K\times K}$-invariant on a polarized $G$-group compactification, where $K$ denotes a maximal compact subgroup of a connected complex reductive group $G$. We prove that Tian's conjecture (see Conjecture 1.1 below) is true for $α_{m,k}^{K\times K}$-invariant on such manifolds when $k=1$, but it fails in general by producing counter-examples when $k\ge 2$.

math.DG↗

Partial Wave Mixing in Hamiltonian Effective Field Theory

The spectrum of excited states observed in the finite volume of lattice QCD is governed by the discrete symmetries of the cubic group. This finite group permits the mixing of orbital angular momentum quanta in the finite volume. As experimental results refer to specific angular momentum in a partial-wave decomposition, a formalism mapping the partial-wave scattering potentials to the finite volume is required. This formalism is developed herein for Hamiltonian effective field theory, an extension of chiral effective field theory incorporating the Lüscher relation linking the energy levels observed in finite volume to the scattering phase shift. The formalism provides an optimal set of rest-frame basis states maximally reducing the dimension of the Hamiltonian, and it should work in any Hamiltonian formalism. As a first example of the formalism's implementation, lattice QCD results for the spectrum of an isospin-2 $ππ$ scattering system are analyzed to determine the $s$, $d$, and $g$ partial-wave scattering information.

hep-lat↗

A Physics Model-Guided Online Bayesian Framework for Energy Management of Extended Range Electric Delivery Vehicles

Increasing the fuel economy of hybrid electric vehicles (HEVs) and extended range electric vehicles (EREVs) through optimization-based energy management strategies (EMS) has been an active research area in transportation. However, it is difficult to apply optimization-based EMS to current in-use EREVs because insufficient knowledge is known about future trips, and because such methods are computationally expensive for large-scale deployment. As a result, most past research has been validated on standard driving cycles or on recorded high-resolution data from past real driving cycles. This paper improves an in-use rule-based EMS that is used in a delivery vehicle fleet equipped with two-way vehicle-to-cloud connectivity. A physics model-guided online Bayesian framework is described and validated on large number of in-use driving samples of EREVs used for last-mile package delivery. The framework includes: a database, a preprocessing module, a vehicle model and an online Bayesian algorithm module. It uses historical 0.2 Hz resolution trip data as input and outputs an updated parameter to the engine control logic on the vehicle to reduce fuel consumption on the next trip. The key contribution of this work is a framework that provides an immediate solution for fuel use reduction of in-use EREVs. The framework was also demonstrated on real-world EREVs delivery vehicles operating on actual routes. The results show an average of 12.8% fuel use reduction among tested vehicles for 155 real delivery trips. The presented framework is extendable to other EREV applications including passenger vehicles, transit buses, and other vocational vehicles whose trips are similar day-to-day.

eess.SP↗

Adversarial Attacks on Reinforcement Learning based Energy Management Systems of Extended Range Electric Delivery Vehicles

Adversarial examples are firstly investigated in the area of computer vision: by adding some carefully designed ''noise'' to the original input image, the perturbed image that cannot be distinguished from the original one by human, can fool a well-trained classifier easily. In recent years, researchers also demonstrated that adversarial examples can mislead deep reinforcement learning (DRL) agents on playing video games using image inputs with similar methods. However, although DRL has been more and more popular in the area of intelligent transportation systems, there is little research investigating the impacts of adversarial attacks on them, especially for algorithms that do not take images as inputs. In this work, we investigated several fast methods to generate adversarial examples to significantly degrade the performance of a well-trained DRL- based energy management system of an extended range electric delivery vehicle. The perturbed inputs are low-dimensional state representations and close to the original inputs quantified by different kinds of norms. Our work shows that, to apply DRL agents on real-world transportation systems, adversarial examples in the form of cyber-attack should be considered carefully, especially for applications that may lead to serious safety issues.

cs.LG↗

Bilinear Graph Neural Network with Neighbor Interactions

Graph Neural Network (GNN) is a powerful model to learn representations and make predictions on graph data. Existing efforts on GNN have largely defined the graph convolution as a weighted sum of the features of the connected nodes to form the representation of the target node. Nevertheless, the operation of weighted sum assumes the neighbor nodes are independent of each other, and ignores the possible interactions between them. When such interactions exist, such as the co-occurrence of two neighbor nodes is a strong signal of the target node's characteristics, existing GNN models may fail to capture the signal. In this work, we argue the importance of modeling the interactions between neighbor nodes in GNN. We propose a new graph convolution operator, which augments the weighted sum with pairwise interactions of the representations of neighbor nodes. We term this framework as Bilinear Graph Neural Network (BGNN), which improves GNN representation ability with bilinear interactions between neighbor nodes. In particular, we specify two BGNN models named BGCN and BGAT, based on the well-known GCN and GAT, respectively. Empirical results on three public benchmarks of semi-supervised node classification verify the effectiveness of BGNN -- BGCN (BGAT) outperforms GCN (GAT) by 1.6% (1.5%) in classification accuracy.Codes are available at: https://github.com/zhuhm1996/bgnn.

cs.LG↗

How to Retrain Recommender System? A Sequential Meta-Learning Method

Practical recommender systems need be periodically retrained to refresh the model with new interaction data. To pursue high model fidelity, it is usually desirable to retrain the model on both historical and new data, since it can account for both long-term and short-term user preference. However, a full model retraining could be very time-consuming and memory-costly, especially when the scale of historical data is large. In this work, we study the model retraining mechanism for recommender systems, a topic of high practical values but has been relatively little explored in the research community. Our first belief is that retraining the model on historical data is unnecessary, since the model has been trained on it before. Nevertheless, normal training on new data only may easily cause overfitting and forgetting issues, since the new data is of a smaller scale and contains fewer information on long-term user preference. To address this dilemma, we propose a new training method, aiming to abandon the historical data during retraining through learning to transfer the past training experience. Specifically, we design a neural network-based transfer component, which transforms the old model to a new model that is tailored for future recommendations. To learn the transfer component well, we optimize the "future performance" -- i.e., the recommendation accuracy evaluated in the next time period. Our Sequential Meta-Learning(SML) method offers a general training paradigm that is applicable to any differentiable model. We demonstrate SML on matrix factorization and conduct experiments on two real-world datasets. Empirical results show that SML not only achieves significant speed-up, but also outperforms the full model retraining in recommendation accuracy, validating the effectiveness of our proposals. We release our codes at: https://github.com/zyang1580/SML.

cs.IR↗

An extended Flaherty-Keller formula for an elastic composite with densely packed convex inclusions

In this paper, we are concerned with the effective elastic property of a two-phase high-contrast periodic composite with densely packed inclusions. The equations of linear elasticity are assumed. We first give a novel proof of the Flaherty-Keller formula for elliptic inclusions, which improves a recent result of Kang and Yu (Calc.Var.Partial Differential Equations, 2020). We construct an auxiliary function consisting of the Keller function and an additional corrected function depending on the coefficients of Lamé system and the geometry of inclusions, to capture the full singular term of the gradient. On the other hand, this method allows us to deal with the inclusions of arbitrary shape, even with zero curvature. An extended Flaherty-Keller formula is proved for m-convex inclusions, m > 2, curvilinear squares with round off angles, which minimize the elastic modulus under the same volume fraction of hard inclusions.

math.AP↗

Increasing two-photon entangled dimensions by shaping input beam profiles

Photon pair entangled in high dimensional orbital angular momentum (OAM) degree of freedom (DOF) has been widely regarded as a possible source in improving the capacity of quantum information processing. The need for the generation of a high dimensional maximally entangled state in the OAM DOF is therefore much desired. In this work, we demonstrate a simple method to generate a broader and flatter OAM spectrum, i.e. a larger spiral bandwidth (SB), of entangled photon pairs generated through spontaneous parametric down-conversion by modifying the pump beam profile. By investigating both experimentally and theoretically, we have found that an exponential pump profile that is roughly the inverse of the mode profiles of the single-mode fibers used for OAM detection will provide a much larger SB when compared to a Gaussian shaped pump.

quant-ph↗

Information scrambling in a collision model

The information scrambling in many-body systems is closely related to quantum chaotic dynamics, complexity, and gravity. Here we propose a collision model to simulate the information dynamics in an all-optical system. In our model the information is initially localized in the memory and evolves under the combined actions of many-body interactions and dissipation. We find that the information is scrambled if the memory and environmental particles are alternatively squeezed along two directions which are perpendicular to each other. Moreover, the disorder and imperfection of the interaction strength tend to prevent the information flow away to the environment and lead to the information scrambling in the memory. We analyze the spatial distributions of the correlations in the memory. Our proposal is possible to realize with current experimental techniques.

quant-ph↗

KIC 10736223: An Algol-type eclipsing binary just undergone the rapid mass-transfer stage

This paper reports the discovery of an Algol system KIC 10736223 that just past the rapid mass transfer stage. From the light curve and radial-velocity modelling we find KIC 10736223 to be a detached Algol system with the less-massive secondary nearly filling its Roche lobe. Based on the short-cadence Kepler data, we analyzed intrinsic oscillations of the pulsator and identified six secured independent $δ$ Scuti-type pulsation modes ($f_{1}$, $f_3$, $f_{9}$, $f_{19}$, $f_{42}$, and $f_{48}$). We compute two grids of theoretical models to reproduce the $δ$ Scuti freqiencies, and find fitting results of mass-accreting models meet well with those of single-star evolutionary models. The fundamental parameters of the primary star yielded with asteroseismology are $M$ = $1.57^{+0.05}_{-0.09}$ $M_{\odot}$, $Z$ = 0.009 $\pm$ 0.001, $R$ = $1.484^{+0.016}_{-0.028}$ $R_{\odot}$, $\log g$ = $4.291^{+0.004}_{-0.009}$, $T_{\rm eff}$ = $7748^{+230}_{-378}$ K, $L$ = $7.136^{+1.014}_{-1.519}$ $L_{\odot}$. The asteroseismic parameters match well with the dynamical parameters derived from the binary model. Moreover, our asteroseismic results show that the pulsator is an almost unevolved star with an age between 9.46-11.65 Myr for single-star evolutionary models and 2.67-3.14 Myr for mass-accreting models. Thereofore, KIC 10736223 may be an Algol system that has just undergone the rapid mass-transfer process.

astro-ph.SR↗