Searcharxiv⌕ Search

arXiv subjects

Liang Chen

Publications and source records attributed to Liang Chen.

At least 397 records · Page 22Linked to original sources

Reinforcement Learning with a Disentangled Universal Value Function for Item Recommendation

In recent years, there are great interests as well as challenges in applying reinforcement learning (RL) to recommendation systems (RS). In this paper, we summarize three key practical challenges of large-scale RL-based recommender systems: massive state and action spaces, high-variance environment, and the unspecific reward setting in recommendation. All these problems remain largely unexplored in the existing literature and make the application of RL challenging. We develop a model-based reinforcement learning framework, called GoalRec. Inspired by the ideas of world model (model-based), value function estimation (model-free), and goal-based RL, a novel disentangled universal value function designed for item recommendation is proposed. It can generalize to various goals that the recommender may have, and disentangle the stochastic environmental dynamics and high-variance reward signals accordingly. As a part of the value function, free from the sparse and high-variance reward signals, a high-capacity reward-independent world model is trained to simulate complex environmental dynamics under a certain goal. Based on the predicted environmental dynamics, the disentangled universal value function is related to the user's future trajectory instead of a monolithic state and a scalar reward. We demonstrate the superiority of GoalRec over previous approaches in terms of the above three practical challenges in a series of simulations and a real application.

cs.IR↗

Hysteresis bifurcation and application to delayed Fitzhugh-Nagumo neural systems

Hysteresis dynamics has been described in a vast number of biological experimental studies. Many such studies are phenomenological and a mathematical appreciation has not attracted enough attention. In the paper, we explore the nature of hysteresis and study it from the dynamical system point of view by using the bifurcation and perturbation theories. We firstly make a classification of hysteresis according to the system behaviours transiting between different types of attractors. Then, we focus on a mathematically amenable situation where hysteretic movements between the equilibrium point and the limit cycle are initiated by a subcritical Hopf bifurcation and a saddle-node bifurcation of limit cycles. We present a analytical framework by using the method of multiple scales to obtain the normal form up to the fifth order. Theoretical results are compared with time domain simulations and numerical continuation, showing good agreement. Although we consider the time-delayed FitzHugh-Nagumo neural system in the paper, the generalization should be clear to other systems or parameters. The general framework we present in the paper can be naturally extended to the notion of bursting activity in neuroscience where hysteresis is a dominant mechanism to generate bursting oscillations.

nlin.AO↗

Robust Kalman filter-based dynamic state estimation of natural gas pipeline networks

To obtain the accurate transient states of the big scale natural gas pipeline networks under the bad data and non-zero mean noises conditions, a robust Kalman filter-based dynamic state estimation method is proposed using the linearized gas pipeline transient flow equations in this paper. Firstly, the dynamic state estimation model is built. Since the gas pipeline transient flow equations are less than the states, the boundary conditions are used as supplementary constraints to predict the transient states. To increase the measurement redundancy, the zero mass flow rate constraints at the sink nodes are taken as virtual measurements. Secondly, to ensure the stability under bad data condition, the robust Kalman filter algorithm is proposed by introducing a time-varying scalar matrix to regulate the measurement error variances correctly according to the innovation vector at every time step. At last, the proposed method is applied to a 30-node gas pipeline networks in several kinds of measurement conditions. The simulation shows that the proposed robust dynamic state estimation can decrease the effects of bad data and achieve better estimating results.

eess.SP↗

On the origin of GeV spectral break for Fermi blazars: 3C 454.3

The GeV break in spectra of the blazar 3C 454.3 is a special observation feature that has been discovered by the {\it Fermi}-LAT. The origin of the GeV break in the spectra is still under debate. In order to explore the possible source of GeV spectral break in 3C 454.3, a one-zone homogeneous leptonic jet model, as well as the {\it McFit} technique are utilized for fitting the quasi-simultaneous multi-waveband spectral energy distribution (SED) of 3C 454.3. The outside border of the broad-line region (BLR) and inner dust torus are chosen to contribute radiation in the model as external, seed photons to the external-Compton process, considering the observed $γ$-ray radiation. The combination of two components, namely the Compton-scattered BLR and dust torus radiation, assuming a broken power-law distribution of emitted particles, provides a proper fitting to the multi-waveband SED of 3C 454.3 detected 2008 Aug 3 - Sept 2 and explains the GeV spectral break. We propose that the spectral break of 3C 454.3 may originate from an inherent break in the energy distribution of the emitted particles and the Klein-Nishina effect. A comparison is performed between the energy density of the 'external' photon field for the whole BLR $U_{\rm BLR}$ achieved via model fitting and that constrained from the BLR data. The distance from the position of the $γ$-ray radiation area of 3C 454.3 to the central black hole could be constrained at $\sim 0.78$pc ($\sim 4.00 R_{\rm BLR}$, the size of the BLR).

astro-ph.HE↗

GraphGallery: A Platform for Fast Benchmarking and Easy Development of Graph Neural Networks Based Intelligent Software

Graph Neural Networks (GNNs) have recently shown to be powerful tools for representing and analyzing graph data. So far GNNs is becoming an increasingly critical role in software engineering including program analysis, type inference, and code representation. In this paper, we introduce GraphGallery, a platform for fast benchmarking and easy development of GNNs based software. GraphGallery is an easy-to-use platform that allows developers to automatically deploy GNNs even with less domain-specific knowledge. It offers a set of implementations of common GNN models based on mainstream deep learning frameworks. In addition, existing GNNs toolboxes such as PyG and DGL can be easily incorporated into the platform. Experiments demonstrate the reliability of implementations and superiority in fast coding. The official source code of GraphGallery is available at https://github.com/EdisonLeeeee/GraphGallery and a demo video can be found at https://youtu.be/mv7Zs1YeaYo.

cs.AI↗

Lower Bound on the Optimal Access Bandwidth of ($K+2,K,2$)-MDS Array Code with Degraded Read Friendly

Accessing the data in the failed disk (degraded read) with low latency is crucial for an erasure-coded storage system. In this work, the maximum distance separable (MDS) array code with the property of degraded-read friendly (DRF) is discussed. For the DRF MDS array code with 2 redundant nodes and the sub-packetization level of 2, the lower bound of its access bandwidth is derived.

cs.IT↗

Deep Reinforcement Learning with Spatio-temporal Traffic Forecasting for Data-Driven Base Station Sleep Control

To meet the ever increasing mobile traffic demand in 5G era, base stations (BSs) have been densely deployed in radio access networks (RANs) to increase the network coverage and capacity. However, as the high density of BSs is designed to accommodate peak traffic, it would consume an unnecessarily large amount of energy if BSs are on during off-peak time. To save the energy consumption of cellular networks, an effective way is to deactivate some idle base stations that do not serve any traffic demand. In this paper, we develop a traffic-aware dynamic BS sleep control framework, named DeepBSC, which presents a novel data-driven learning approach to determine the BS active/sleep modes while meeting lower energy consumption and satisfactory Quality of Service (QoS) requirements. Specifically, the traffic demands are predicted by the proposed GS-STN model, which leverages the geographical and semantic spatial-temporal correlations of mobile traffic. With accurate mobile traffic forecasting, the BS sleep control problem is cast as a Markov Decision Process that is solved by Actor-Critic reinforcement learning methods. To reduce the variance of cost estimation in the dynamic environment, we propose a benchmark transformation method that provides robust performance indicator for policy update. To expedite the training process, we adopt a Deep Deterministic Policy Gradient (DDPG) approach, together with an explorer network, which can strengthen the exploration further. Extensive experiments with a real-world dataset corroborate that our proposed framework significantly outperforms the existing methods.

cs.NI↗

Analytical Solution of Magnetically Dominated Astrophysical Jets and Winds: Jet Launching, Acceleration, and Collimation

We present an analytical solution of a highly magnetized jet/wind flow. The left side of the general force-free jet/wind equation (the "pulsar" equation) is separated into a rotating and a nonrotating term. The two equations with either term can be solved analytically, and the two solutions match each other very well. Therefore, we obtain a general approximate solution of a magnetically dominated jet/wind, which covers from the nonrelativistic to relativistic regimes, with the drift velocity well matching the cold plasma velocity. The acceleration of a jet includes three stages. (1) The jet flow is located within the Alfvén critical surface (i.e. the light cylinder), has a nonrelativistic speed, and is dominated by toroidal motion. (2) The jet is beyond the Alfvén critical surface where the flow is dominated by poloidal motion and becomes relativistic. The total velocity in these two stages follows the same law $vΓ=ΩR$. (3) The evolution law is replaced by $vΓ\approx1/\left(θ\sqrt{2-ν}\right)$, where $θ$ is the half-opening angle of the jet and $0\leqν\leq2$ is a free parameter determined by the magnetic field configuration. This is because the earlier efficient acceleration finally breaks the causality connection between different parts in the jet, preventing a global solution. The jet has to carry local charges and currents to support an electromagnetic balance. This approximate solution is consistent with known theoretical results and numerical simulations, and it is more convenient to directly compare with observations. This theory may be used to constrain the spin of black holes in astrophysical jets.

astro-ph.HE↗

Decoding PPP Corrections from BDS B2b Signals Using a Software-defined Receiver: an Initial Performance Evaluation

With the rapid development of China's BeiDou Navigation Satellite System(BDS), the application of real-time precise point positioning (RTPPP) based on BDS has become an active research area in the field of Global Navigation Satellite System (GNSS). BDS has provided the service of broadcasting RTPPP information. It indicates that BDS has become the second satellite system that provides RTPPP services, following Galileo among the GNSS, but work based on this direction has yet to be explored. Therefore, this paper evaluates the performance of precise point positioning (PPP) service using a software-defined receiver (SDR). An experiment was carried out tu verify the feasibility of the SDR. The PPP-B2b signal was processed to obtain PPP service information, including orbit corrections, clock corrections, and differential code bias corrections. The time-varying attributes of these corrections of BDS and GPS are evaluated, and the integrity and stability of the PPP service were analyzed. The results show the PPP-B2b signal can stably provide PPP services for staellites in the Asia-Pacific region, including centimeter to decimeter-level orbit corrections and meter-level clock correction for GPS satellites. Finally, detection tip for bitream availability in SDR is proposed. Some content which is not defined in the official document, such as the PPP-B2b frame arrangement, various correction update cycles and the progress of PPP service are discussed.

eess.SP↗

Learning to Sample the Most Useful Training Patches from Images

Some image restoration tasks like demosaicing require difficult training samples to learn effective models. Existing methods attempt to address this data training problem by manually collecting a new training dataset that contains adequate hard samples, however, there are still hard and simple areas even within one single image. In this paper, we present a data-driven approach called PatchNet that learns to select the most useful patches from an image to construct a new training set instead of manual or random selection. We show that our simple idea automatically selects informative samples out from a large-scale dataset, leading to a surprising 2.35dB generalisation gain in terms of PSNR. In addition to its remarkable effectiveness, PatchNet is also resource-friendly as it is applied only during training and therefore does not require any additional computational cost during inference.

cs.CV↗

Stimulated Radiation from Axion Cluster Evolution in Static Spacetimes

If their number density is high enough, clusters of axions can decay to photons via stimulated emission. We study both the special and general relativistic corrections to lasing in such dense axion clusters as they evolve in static spacetimes. Our main results are rate equations for the evolution of axion and photon number densities that include these corrections. We use Schwarzschild spacetime as a detailed example.

hep-ph↗

An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron

In this paper, we concentrate on generating cutting planes for the unsplittable capacitated network design problem. We use the unsplittable flow arc-set polyhedron of the considered problem as a substructure and generate cutting planes by solving the separation problem over it. To relieve the computational burden, we show that, in some special cases, a closed form of the separation problem can be derived. For the general case, a brute-force algorithm, called exact separation algorithm, is employed in solving the separation problem of the considered polyhedron such that the constructed inequality guarantees to be facet-defining. Furthermore, a new technique is presented to accelerate the exact separation algorithm, which significantly decreases the number of iterations in the algorithm. Finally, a comprehensive computational study on the unsplittable capacitated network design problem is presented to demonstrate the effectiveness of the proposed algorithm.

math.OC↗

GAIN: Graph Attention & Interaction Network for Inductive Semi-Supervised Learning over Large-scale Graphs

Graph Neural Networks (GNNs) have led to state-of-the-art performance on a variety of machine learning tasks such as recommendation, node classification and link prediction. Graph neural network models generate node embeddings by merging nodes features with the aggregated neighboring nodes information. Most existing GNN models exploit a single type of aggregator (e.g., mean-pooling) to aggregate neighboring nodes information, and then add or concatenate the output of aggregator to the current representation vector of the center node. However, using only a single type of aggregator is difficult to capture the different aspects of neighboring information and the simple addition or concatenation update methods limit the expressive capability of GNNs. Not only that, existing supervised or semi-supervised GNN models are trained based on the loss function of the node label, which leads to the neglect of graph structure information. In this paper, we propose a novel graph neural network architecture, Graph Attention \& Interaction Network (GAIN), for inductive learning on graphs. Unlike the previous GNN models that only utilize a single type of aggregation method, we use multiple types of aggregators to gather neighboring information in different aspects and integrate the outputs of these aggregators through the aggregator-level attention mechanism. Furthermore, we design a graph regularized loss to better capture the topological relationship of the nodes in the graph. Additionally, we first present the concept of graph feature interaction and propose a vector-wise explicit feature interaction mechanism to update the node embeddings. We conduct comprehensive experiments on two node-classification benchmarks and a real-world financial news dataset. The experiments demonstrate our GAIN model outperforms current state-of-the-art performances on all the tasks.

cs.LG↗

Radial solutions of the hydrodynamic model of semiconductors with sonic boundary

The purpose of this paper is to study radial solutions for steady hydrodynamic model of semiconductors represented by Euler-Poisson equations with sonic boundary. The existence and uniqueness of radial subsonic solution, and the existence of radial supersonic solutions are derived by using the energy method and the compactness method, but under a general condition of the doping profile. In particular, for radial supersonic solutions, it is more difficult to get the related estimates by the effect of high dimensional space and the sonic boundary, so we apply a special iteration to complete the proofs. The results obtained essentially improve and develop the previous studies in the one-dimensional case.

math.AP↗

Nonparametric Quantile Regressions for Panel Data Models with Large T

This paper considers panel data models where the conditional quantiles of the dependent variables are additively separable as unknown functions of the regressors and the individual effects. We propose two estimators of the quantile partial effects while controlling for the individual heterogeneity. The first estimator is based on local linear quantile regressions, and the second is based on local linear smoothed quantile regressions, both of which are easy to compute in practice. Within the large T framework, we provide sufficient conditions under which the two estimators are shown to be asymptotically normally distributed. In particular, for the first estimator, it is shown that $N<<T^{2/(d+4)}$ is needed to ignore the incidental parameter biases, where $d$ is the dimension of the regressors. For the second estimator, we are able to derive the analytical expression of the asymptotic biases under the assumption that $N\approx Th^{d}$, where $h$ is the bandwidth parameter in local linear approximations. Our theoretical results provide the basis of using split-panel jackknife for bias corrections. A Monte Carlo simulation shows that the proposed estimators and the bias-correction method perform well in finite samples.

econ.EM↗

A hybridizable discontinuous Galerkin method for simulation of electrostatic problems with floating potential conductors

In an electrostatic simulation, an equipotential condition with an undefined/floating potential value has to be enforced on the surface of an isolated conductor. If this conductor is charged, a nonzero charge condition is also required. While implementation of these conditions using a traditional finite element method (FEM) is not straightforward, they can be easily discretized and incorporated within a discontinuous Galerkin (DG) method. However, DG discretization results in a larger number of unknowns as compared to FEM. In this work, a hybridizable DG (HDG) method is proposed to alleviate this problem. Floating potential boundary conditions, possibly with different charge values, are introduced on surfaces of each isolated conductor and are weakly enforced in the global problem of HDG. The unknowns of the global HDG problem are those only associated with the nodes on the mesh skeleton and their number is much smaller than the total number of unknowns required by DG. Numerical examples show that the proposed method is as accurate as DG while it improves the computational efficiency significantly.

math.NA↗

Quantile Factor Models

Quantile Factor Models (QFM) represent a new class of factor models for high-dimensional panel data. Unlike Approximate Factor Models (AFM), where only location-shifting factors can be extracted, QFM also allow to recover unobserved factors shifting other relevant parts of the distributions of observed variables. A quantile regression approach, labeled Quantile Factor Analysis (QFA), is proposed to consistently estimate all the quantile-dependent factors and loadings. Their asymptotic distribution is then derived using a kernel-smoothed version of the QFA estimators. Two consistent model selection criteria, based on information criteria and rank minimization, are developed to determine the number of factors at each quantile. Moreover, in contrast to the conditions required for the use of Principal Components Analysis in AFM, QFA estimation remains valid even when the idiosyncratic errors have heavy-tailed distributions. Three empirical applications (regarding macroeconomic, climate and finance panel data) provide evidence that extra factors shifting the quantiles other than the means could be relevant in practice.

econ.EM↗

Stochastic Time-Periodic Tonelli Lagrangian on Compact Manifold

In this paper, we study a class of time-periodic stochastic Tonelli Lagrangians on compact manifolds. Precisely, we discuss the stochastic Mane Critical Value, prove the existence of stochastic Weak KAM solutions of the related Hamilton-Jacobi equation. Furthermore, we survey the global minimizer.

math.DS↗