arXiv subjects

Min Li

Publications and source records attributed to Min Li.

At least 217 records · Page 12Linked to original sources

arXiv2022

RAR-PINN algorithm for the data-driven vector-soliton solutions and parameter discovery of coupled nonlinear equations

This work aims to provide an effective deep learning framework to predict the vector-soliton solutions of the coupled nonlinear equations and their interactions. The method we propose here is a physics-informed neural network (PINN) combining with the residual-based adaptive refinement (RAR-PINN) algorithm. Different from the traditional PINN algorithm which takes points randomly, the RAR-PINN algorithm uses an adaptive point-fetching approach to improve the training efficiency for the solutions with steep gradients. A series of experiment comparisons between the RAR-PINN and traditional PINN algorithms are implemented to a coupled generalized nonlinear Schrödinger (CGNLS) equation as an example. The results indicate that the RAR-PINN algorithm has faster convergence rate and better approximation ability, especially in modeling the shape-changing vector-soliton interactions in the coupled systems. Finally, the RAR-PINN method is applied to perform the data-driven discovery of the CGNLS equation, which shows the dispersion and nonlinear coefficients can be well approximated.

math.NA↗

arXiv2022

DeepGate: Learning Neural Representations of Logic Gates

Applying deep learning (DL) techniques in the electronic design automation (EDA) field has become a trending topic. Most solutions apply well-developed DL models to solve specific EDA problems. While demonstrating promising results, they require careful model tuning for every problem. The fundamental question on "How to obtain a general and effective neural representation of circuits?" has not been answered yet. In this work, we take the first step towards solving this problem. We propose DeepGate, a novel representation learning solution that effectively embeds both logic function and structural information of a circuit as vectors on each gate. Specifically, we propose transforming circuits into unified and-inverter graph format for learning and using signal probabilities as the supervision task in DeepGate. We then introduce a novel graph neural network that uses strong inductive biases in practical circuits as learning priors for signal probability prediction. Our experimental results show the efficacy and generalization capability of DeepGate.

cs.LG↗

arXiv2022

FKreg: A MATLAB toolbox for fast Multivariate Kernel Regression

Kernel smooth is the most fundamental technique for data density and regression estimation. However, time-consuming is the biggest obstacle for the application that the direct evaluation of kernel smooth for $N$ samples needs ${O}\left( {{N}^{2}} \right)$ operations. People have developed fast smooth algorithms using the idea of binning with FFT. Unfortunately, the accuracy is not controllable, and the implementation for multivariable and its bandwidth selection for the fast method is not available. Hence, we introduce a new MATLAB toolbox for fast multivariate kernel regression with the idea of non-uniform FFT (NUFFT), which implemented the algorithm for $M$ gridding points with ${O}\left( N+M\log M \right)$ complexity and accuracy controllability. The bandwidth selection problem utilizes the Fast Monte-Carlo algorithm to estimate the degree of freedom (DF), saving enormous cross-validation time even better when data share the same grid space for multiple regression. Up to now, this is the first toolbox for fast-binning high-dimensional kernel regression. Moreover, the estimation for local polynomial regression, the conditional variance for the heteroscedastic model, and the complex-valued datasets are also implemented in this toolbox. The performance is demonstrated with simulations and an application on the quantitive EEG.

stat.ME↗

arXiv2022

113 km Free-Space Time-Frequency Dissemination at the 19th Decimal Instability

Optical clock networks play important roles in various fields, such as precise navigation, redefinition of "second" unit, and gravitational tests. To establish a global-scale optical clock network, it is essential to disseminate time and frequency with a stability of $10^{-19}$ over a long-distance free-space link. However, such attempts were limited to dozens of kilometers in mirror-folded configuration. Here, we take a crucial step toward future satellite-based time-frequency disseminations. By developing the key technologies, including high-power frequency combs, high-stability and high-efficiency optical transceiver systems, and efficient linear optical sampling, we demonstrate free-space time-frequency dissemination over two independent links with femtosecond time deviation, $3\times10^{-19}$ at 10,000 s residual instability and $1.6\times10^{-20}\pm 4.3\times10^{-19}$ offset. This level of the stability retains for an increased channel loss up to 89 dB. Our work can not only be directly used in ground-based application, but also firmly laid the groundwork for future satellite time-frequency dissemination.

physics.ins-det↗

arXiv2022

Linear-Quadratic Large-Population Problem with Partial Information: Hamiltonian Approach and Riccati Approach

This paper studies a class of partial information linear-quadratic mean-field game problems. A general stochastic large-population system is considered, where the diffusion term of the dynamic of each agent can depend on the state and control. We study both the control constrained case and unconstrained case. In control constrained case, by using Hamiltonian approach and convex analysis, the explicit decentralized strategies can be obtained through projection operator. The corresponding Hamiltonian type consistency condition system is derived, which turns out to be a nonlinear mean-field forward-backward stochastic differential equation with projection operator. The well-posedness of such kind of equations is proved by using discounting method. Moreover, the corresponding $\varepsilon$-Nash equilibrium property is verified. In control unconstrained case, the decentralized strategies can be further represented explicitly as the feedback of filtered state through Riccati approach. The existence and uniqueness of a solution to a new Riccati type consistency condition system is also discussed. As an application, a general inter-bank borrowing and lending problem is studied to illustrate that the effect of partial information cannot be ignored.

math.OC↗

arXiv2022

Ill_posedness for a two_component Novikov system in Besov space

In this paper, we consider the Cauchy problem for a two-component Novikov system on the line. By specially constructed initial data $(ρ_0, u_0)$ in $B_{p, \infty}^{s-1}(\mathbb{R})\times B_{p, \infty}^s(\mathbb{R})$ with $s>\max\{2+\frac{1}{p}, \frac{5}{2}\}$ and $1\leq p \leq \infty$, we show that any energy bounded solution starting from $(ρ_0, u_0)$ does not converge back to $(ρ_0, u_0)$ in the metric of $B_{p, \infty}^{s-1}(\mathbb{R})\times B_{p, \infty}^s(\mathbb{R})$ as time goes to zero, thus results in discontinuity of the data-to-solution map and ill-posedness.

math.AP↗

arXiv2022

Maximum Temperatures in Evolving Protoplanetary Discs and Composition of Planetary Building Blocks

The maximum temperature and radial temperature profile in a protoplanetary disc are important for the condensation of different elements in the disc. We simulate the evolution of a set of protoplanetary discs from the collapse of their progenitor molecular cloud cores as well as the dust decoupling within the discs as they evolve. We show how the initial properties of the cloud cores affect the thermal history of the protoplanetary discs using a simple viscous disc model. Our results show that the maximum midplane temperature in the disc occurs within 0.5 AU. It increases with the initial cloud temperature and decreases with its angular velocity and the viscosity of the disc. From the observed properties of the molecular cloud cores we find the median value of the maximum temperature is around 1250 K, with roughly 90% of them being less than 1500 K - a value that is lower than the 50% condensation temperatures of most refractory elements. Therefore, only cloud cores with high initial temperatures or low angular velocities and/or low viscosities within the planet-forming discs will result in refractory-rich planetesimals. To reproduce the volatile depletion pattern of CM, CO, and CV chondrites and the terrestrial planets in Solar system, one must either have rare properties of the initial molecular cloud cores like high core temperature, or other sources of energy to heat the disc to sufficiently high temperatures. Alternatively, the volatile depletion observed in these chondrites may be inherited from the progenitor molecular cloud.

astro-ph.EP↗

arXiv2022

Hierarchical Graph Convolutional Skeleton Transformer for Action Recognition

Graph convolutional networks (GCNs) have emerged as dominant methods for skeleton-based action recognition. However, they still suffer from two problems, namely, neighborhood constraints and entangled spatiotemporal feature representations. Most studies have focused on improving the design of graph topology to solve the first problem but they have yet to fully explore the latter. In this work, we design a disentangled spatiotemporal transformer (DSTT) block to overcome the above limitations of GCNs in three steps: (i) feature disentanglement for spatiotemporal decomposition;(ii) global spatiotemporal attention for capturing correlations in the global context; and (iii) local information enhancement for utilizing more local information. Thereon, we propose a novel architecture, named Hierarchical Graph Convolutional skeleton Transformer (HGCT), to employ the complementary advantages of GCN (i.e., local topology, temporal dynamics and hierarchy) and Transformer (i.e., global context and dynamic attention). HGCT is lightweight and computationally efficient. Quantitative analysis demonstrates the superiority and good interpretability of HGCT.

cs.CV↗

arXiv2021

KddRES: A Multi-level Knowledge-driven Dialogue Dataset for Restaurant Towards Customized Dialogue System

Compared with CrossWOZ (Chinese) and MultiWOZ (English) dataset which have coarse-grained information, there is no dataset which handle fine-grained and hierarchical level information properly. In this paper, we publish a first Cantonese knowledge-driven Dialogue Dataset for REStaurant (KddRES) in Hong Kong, which grounds the information in multi-turn conversations to one specific restaurant. Our corpus contains 0.8k conversations which derive from 10 restaurants with various styles in different regions. In addition to that, we designed fine-grained slots and intents to better capture semantic information. The benchmark experiments and data statistic analysis show the diversity and rich annotations of our dataset. We believe the publish of KddRES can be a necessary supplement of current dialogue datasets and more suitable and valuable for small and middle enterprises (SMEs) of society, such as build a customized dialogue system for each restaurant. The corpus and benchmark models are publicly available.

cs.CL↗

arXiv2021

Testability-Aware Low Power Controller Design with Evolutionary Learning

XORNet-based low power controller is a popular technique to reduce circuit transitions in scan-based testing. However, existing solutions construct the XORNet evenly for scan chain control, and it may result in sub-optimal solutions without any design guidance. In this paper, we propose a novel testability-aware low power controller with evolutionary learning. The XORNet generated from the proposed genetic algorithm (GA) enables adaptive control for scan chains according to their usages, thereby significantly improving XORNet encoding capacity, reducing the number of failure cases with ATPG and decreasing test data volume. Experimental results indicate that under the same control bits, our GA-guided XORNet design can improve the fault coverage by up to 2.11%. The proposed GA-guided XORNets also allows reducing the number of control bits, and the total testing time decreases by 20.78% on average and up to 47.09% compared to the existing design without sacrificing test coverage.

cs.LG↗

arXiv2021

AppealNet: An Efficient and Highly-Accurate Edge/Cloud Collaborative Architecture for DNN Inference

This paper presents AppealNet, a novel edge/cloud collaborative architecture that runs deep learning (DL) tasks more efficiently than state-of-the-art solutions. For a given input, AppealNet accurately predicts on-the-fly whether it can be successfully processed by the DL model deployed on the resource-constrained edge device, and if not, appeals to the more powerful DL model deployed at the cloud. This is achieved by employing a two-head neural network architecture that explicitly takes inference difficulty into consideration and optimizes the tradeoff between accuracy and computation/communication cost of the edge/cloud collaborative architecture. Experimental results on several image classification datasets show up to more than 40% energy savings compared to existing techniques without sacrificing accuracy.

cs.LG↗

arXiv2021

Mean square stability of stochastic theta method for stochastic differential equations driven by fractional Brownian motion

In this paper, we study the mean-square stability of the solution and its stochastic theta scheme for the following stochastic differential equations drive by fractional Brownian motion with Hurst parameter $H\in (\frac 12,1)$: $$ dX(t)=f(t,X(t))dt+g(t,X(t))dB^{H}(t). $$ Firstly, we consider the special case when $f(t,X)=-λκt^{κ-1}X$ and $g(t,X)=μX$. The solution is explicit and is mean-square stable when $κ\geq 2H$. It is proved that if the parameter $2H\leqκ\le 3/2$ and $\frac{\sqrt{3/2}\cdot e}{\sqrt{3/2}\cdot e+1} (\approx 0.77)\leq θ\leq 1$ or $κ>3/2$ and $1/2<θ\le 1$, the stochastic theta method reproduces the mean-square stability; and that if $0<θ<\frac 12$, the numerical method does not preserve this stability unconditionally. Secondly, we study the stability of the solution and its stochastic theta scheme for nonlinear equations. Due to the presence of long memory, even the problem of stability in the mean square sense of the solution has not been well studied since the conventional techniques powerful for stochastic differential equations driven by Brownian motion are no longer applicable. Let alone the stability of numerical schemes. We need to develop a completely new set of techniques to deal with this difficulty. Numerical examples are carried out to illustrate our theoretical results.

math.NA↗

arXiv2021

Photon return on-sky test for by-product Rayleigh plume of sodium laser guide star

The sodium laser guide star (sLGS) adaptive optics (AO) system has become an essential component for large ground-based optical/infrared telescope. The performance of the AO system can be significantly hindered if the on-sky spot profile of its sLGS is degraded by the turbulence along the laser launching uplink path. One effective method to overcome this problem is to perform real-time pre-correction on the laser before it is launched onto the sky to counter this turbulence effect especially for the lower altitude where turbulence is stronger. The by-product Rayleigh backscatter generated by large molecule and aerosols at low altitude when projecting sLGS is a perfect candidate for real time detection of low altitude turbulence. It is therefore important to evaluate whether this by-product of a sodium laser guide star could achieve suitable performance for wavefront sensing. In this paper, we attempt to answer the question regarding to the achievable photon return of such Rayleigh backscattered plume. A comparison between results from our field test and theoretical model of MSISE-90 was presented. We showed that the greatest differences is less than 20% which hints the applicability of using the defocused Rayleigh plume as wavefront sensing signal for different turbulence strengths. The result also showed that in case of strong (Fried parameter (r0) of 5 cm) or moderate (r0 of 10 cm) turbulence, the optimum center for range gating is 9 km, and the corresponding value of range gate depths are 3 km, 1.1 km, 0.56 km and 0.28 km when subaperture sizes are 3 cm, 5 cm, 7 cm and 10 cm, with the maximum pulse repetition frequency at 1500 Hz.

astro-ph.IM↗

arXiv2021

Short term minutes-time scale temporal variation statistics of sodium layer dynamics

The brightness and height of the sodium laser guide star of adaptive optics could vary significantly due to the temporal dynamics of sodium column density and the mean height of sodium layer. To measure these dynamics, an independent sodium Lidar is a necessity. Without such an instrument, it is almost impossible to discern the cause of the brightness variation of laser guide star from the sodium layer's dynamics or other factors from the laser itself. For applications such as characterizing the performance of sodium laser for sodium laser guide star generation, minutes scale short term statistics of the sodium layers' abundance and height is extremely helpful for estimating the contribution of sodium layer's variation to the variation of laser guide star's brightness. In this paper, we analyzed our previous measurement of sodium layer dynamics that has been gathered in two winters, and presented the temporal variation statistics of sodium column density and mean height within minute time scale based on our measurements.

astro-ph.IM↗

arXiv2021

Disentangle pathways in strong field molecular photoionization byangular distribution of dissociation fragments

In strong field ionization, the pump pulse not only photoionizes the molecule, but also drives efficient population exchanges between its ionic ground and excited states.In this study, we investigated the population dynamics accompanying strong field molecular photoionization, using angular distribution of dissociative fragments after ionization.Our results reveal that the first and higher order processes of the post-ionization population redistribution mechanism (PPRM) in the ion core can be disentangled and classified by {its} angle-resolved kinetic energy release (KER) spectra.We demonstrate that the imprints of PPRM in the KER spectra can be used to determine the branching ratio of the population exchange pathways of different orders, by exploiting the pump intensity dependent variation of the spectra.

physics.chem-ph↗

arXiv2021

A Pseudo Label-wise Attention Network for Automatic ICD Coding

Automatic International Classification of Diseases (ICD) coding is defined as a kind of text multi-label classification problem, which is difficult because the number of labels is very large and the distribution of labels is unbalanced. The label-wise attention mechanism is widely used in automatic ICD coding because it can assign weights to every word in full Electronic Medical Records (EMR) for different ICD codes. However, the label-wise attention mechanism is computational redundant and costly. In this paper, we propose a pseudo label-wise attention mechanism to tackle the problem. Instead of computing different attention modes for different ICD codes, the pseudo label-wise attention mechanism automatically merges similar ICD codes and computes only one attention mode for the similar ICD codes, which greatly compresses the number of attention modes and improves the predicted accuracy. In addition, we apply a more convenient and effective way to obtain the ICD vectors, and thus our model can predict new ICD codes by calculating the similarities between EMR vectors and ICD vectors. Extensive experiments show the superior performance of our model. On the public MIMIC-III dataset and private Xiangya dataset, our model achieves micro f1 of 0.583 and 0.806, respectively, which outperforms other competing models. Furthermore, we verify the ability of our model in predicting new ICD codes. The case study shows how pseudo label-wise attention works, and demonstrates the effectiveness of pseudo label-wise attention mechanism.

cs.CL↗

arXiv2021

Ill-posedness for the higher dimensional Camassa-Holm equations in Besov spaces

In the paper, by constructing a initial data $u_{0}\in B^σ_{p,\infty}$ with $σ-2>\max\{1+\frac 1 p, \frac 3 2\}$, we prove that the corresponding solution to the higher dimensional Camassa-Holm equations starting from $u_{0}$ is discontinuous at $t=0$ in the norm of $B^σ_{p,\infty}$, which implies that the ill-posedness for the higher dimensional Camassa-Holm equations in $B^σ_{p,\infty}$.

math.AP↗

arXiv2021

RFCBF: enhance the performance and stability of Fast Correlation-Based Filter

Feature selection is a preprocessing step which plays a crucial role in the domain of machine learning and data mining. Feature selection methods have been shown to be effctive in removing redundant and irrelevant features, improving the learning algorithm's prediction performance. Among the various methods of feature selection based on redundancy, the fast correlation-based filter (FCBF) is one of the most effective. In this paper, we proposed a novel extension of FCBF, called RFCBF, which combines resampling technique to improve classification accuracy. We performed comprehensive experiments to compare the RFCBF with other state-of-the-art feature selection methods using the KNN classifier on 12 publicly available data sets. The experimental results show that the RFCBF algorithm yields significantly better results than previous state-of-the-art methods in terms of classification accuracy and runtime.

cs.LG↗