arXiv subjects

Chao Liu

Publications and source records attributed to Chao Liu.

At least 271 records · Page 15Linked to original sources

arXiv2022

S4OD: Semi-Supervised learning for Single-Stage Object Detection

Single-stage detectors suffer from extreme foreground-background class imbalance, while two-stage detectors do not. Therefore, in semi-supervised object detection, two-stage detectors can deliver remarkable performance by only selecting high-quality pseudo labels based on classification scores. However, directly applying this strategy to single-stage detectors would aggravate the class imbalance with fewer positive samples. Thus, single-stage detectors have to consider both quality and quantity of pseudo labels simultaneously. In this paper, we design a dynamic self-adaptive threshold (DSAT) strategy in classification branch, which can automatically select pseudo labels to achieve an optimal trade-off between quality and quantity. Besides, to assess the regression quality of pseudo labels in single-stage detectors, we propose a module to compute the regression uncertainty of boxes based on Non-Maximum Suppression. By leveraging only 10% labeled data from COCO, our method achieves 35.0% AP on anchor-free detector (FCOS) and 32.9% on anchor-based detector (RetinaNet).

cs.CV↗

arXiv2022

Planets Across Space and Time (PAST). III. Morphology of the Planetary Radius Valley as a Function of Stellar Age and Metallicity in the Galactic Context Revealed by the LAMOST-Gaia-Kepler Sample

The radius valley, a dip in the radius distribution of exoplanets at ~1.9 Earth radii separates compact rocky Super-Earths and Sub-Neptunes with lower density. Various hypotheses have been put forward to explain the radius valley. Characterizing the radius valley morphology and its correlation to stellar properties will provide crucial observation constraints on its origin mechanism and deepen the understanding of planet formation and evolution. In this paper, the third part of the Planets Across the Space and Time (PAST) series, using the LAMOST-Gaia-Kepler catalog, we perform a systematical investigation into how the radius valley morphology varies in the Galactic context, i.e., thin/thick galactic disks, stellar age and metallicity abundance ([Fe/H] and [alpha/Fe]). We find that (1) The valley becomes more prominent with the increase of both age and [Fe/H]. (2) The number ratio of super-Earths to sub-Neptunes monotonically increases with age but decreases with [Fe/H] and [alpha/Fe]. (3) The average radius of planets above the valley (2.1-6 Earth radii) decreases with age but increases with [Fe/H]. (4) In contrast, the average radius of planets below the valley (R < 1.7 Earth radii) is broadly independent on age and metallicity. Our results demonstrate that the valley morphology as well as the whole planetary radius distribution evolves on a long timescale of giga-years, and metallicities (not only Fe but also other metal elements, e.g., Mg, Si, Ca, Ti) play important roles in planet formation and in the long term planetary evolution.

astro-ph.EP↗

arXiv2022

Identification of new classical Be stars from the LAMOST MRS survey

Be stars are B-type main-sequence stars that display broad Balmer emission lines in their spectra. Identification of Be population is essential to further examine the formation and evolutionary models. We report the detection of classical Be (CBe) stars from observations with the Large sky Area Multi-Object fiber Spectroscopic Telescope Medium Resolution Survey of Date Release 7 (LAMOST MRS DR7). We used a deep convolutional neural network, the ResNet, with an 18-layer module to examine the morphology of the H alpha profile. We identified 1,162 candidate Be stars from the collection of 2,260,387 spectra for 789,918 stars in the database. The ResNet network achieves a Be star classification accuracy of 99.5%. Among the detections, 151 of these are prior known Be stars cross-matched from the literature. By applying a three-step test, we identified 183 new CBe stars. We find that 41 CBe stars are members of known open clusters. Based upon an investigation of the kinematics of the identified CBe stars from the Gaia EDR3 astrometric solutions, we identified 16 new runaways. These new identifications will provide a reference for future follow-ups to further investigate their physical properties.

astro-ph.SR↗

arXiv2022

Overview of the LAMOST survey in the first decade

The Large Sky Area Multi-Object Fiber Spectroscopic Telescope (LAMOST), also known as the Guoshoujing Telescope, is a major national scientific facility for astronomical research located in Xinglong, China. Beginning with a pilot survey in 2011, LAMOST has been surveying the night sky for more than 10 years. The LAMOST survey covers various objects in the Universe, from normal stars to peculiar ones, from the Milky Way to other galaxies, and from stellar black holes and their companions to quasars that ignite ancient galaxies. Until the latest data release 8, the LAMOST survey has released spectra for more than 10 million stars, ~220,000 galaxies, and ~71,000 quasars. With this largest celestial spectra database ever constructed, LAMOST has helped astronomers to deepen their understanding of the Universe, especially for our Milky Way galaxy and the millions of stars within it. In this article, we briefly review the characteristics, observations, and scientific achievements of LAMOST. In particular, we show how astrophysical knowledge about the Milky Way has been improved by LAMOST data.

astro-ph.GA↗

arXiv2022

Implementation of an Automated Learning System for Non-experts

Automated machine learning systems for non-experts could be critical for industries to adopt artificial intelligence to their own applications. This paper detailed the engineering system implementation of an automated machine learning system called YMIR, which completely relies on graphical interface to interact with users. After importing training/validation data into the system, a user without AI knowledge can label the data, train models, perform data mining and evaluation by simply clicking buttons. The paper described: 1) Open implementation of model training and inference through docker containers. 2) Implementation of task and resource management. 3) Integration of Labeling software. 4) Implementation of HCI (Human Computer Interaction) with a rebuilt collaborative development paradigm. We also provide subsequent case study on training models with the system. We hope this paper can facilitate the prosperity of our automated machine learning community from industry application perspective. The code of the system has already been released to GitHub (https://github.com/industryessentials/ymir).

cs.HC↗

arXiv2022

Precognition in Task-oriented Dialogue Understanding: Posterior Regularization by Future Context

Task-oriented dialogue systems have become overwhelmingly popular in recent researches. Dialogue understanding is widely used to comprehend users' intent, emotion and dialogue state in task-oriented dialogue systems. Most previous works on such discriminative tasks only models current query or historical conversations. Even if in some work the entire dialogue flow was modeled, it is not suitable for the real-world task-oriented conversations as the future contexts are not visible in such cases. In this paper, we propose to jointly model historical and future information through the posterior regularization method. More specifically, by modeling the current utterance and past contexts as prior, and the entire dialogue flow as posterior, we optimize the KL distance between these distributions to regularize our model during training. And only historical information is used for inference. Extensive experiments on two dialogue datasets validate the effectiveness of our proposed method, achieving superior results compared with all baseline models.

cs.CL↗

arXiv2022

CodeMatcher: Searching Code Based on Sequential Semantics of Important Query Words

To accelerate software development, developers frequently search and reuse existing code snippets from a large-scale codebase, e.g., GitHub. Over the years, researchers proposed many information retrieval based models for code search, but they fail to connect the semantic gap between query and code. An early successful deep learning based model DeepCS solved this issue by learning the relationship between pairs of code methods and corresponding natural language descriptions. Two major advantages of DeepCS are the capability of understanding irrelevant/noisy keywords and capturing sequential relationships between words in query and code. In this paper, we proposed an IR-based model CodeMatcher that inherits the advantages of DeepCS, while it can leverage the indexing technique in the IR-based model to accelerate the search response time substantially. CodeMatcher first collects metadata for query words to identify irrelevant/noisy ones, then iteratively performs fuzzy search with important query words on the codebase that is indexed by the Elasticsearch tool, and finally reranks a set of returned candidate code according to how the tokens in the candidate code snippet sequentially matched the important words in a query. We verified its effectiveness on a large-scale codebase with ~41k repositories. Experimental results showed that CodeMatcher achieves an MRR of 0.60, outperforming DeepCS, CodeHow, and UNIF by 82%, 62%, and 46% respectively. Our proposed model is over 1.2k times faster than DeepCS. Moreover, CodeMatcher outperforms GitHub and Google search by 46% and 33% respectively in terms of MRR. We also observed that: fusing the advantages of IR-based and DL-based models is promising; improving the quality of method naming helps code search, since method name plays an important role in connecting query and code.

cs.SE↗

arXiv2022

Rigorous proof of slightly nonlinear Jeans instability in the expanding Newtonian universe

Due to the nonlinearity of the Euler{Poisson equations, it is possible that the nonlinear Jeans instability may lead to a faster density growing rate than the rate in the standard theory of linearized Jeans instability, which motivates us to study the nonlinear Jeans instability. The aim of this article is to develop a method proving the Jeans instability for slightly nonlinear Euler-Poisson equations in the expanding Newtonian universe. The standard proofs of the Jeans instability rely on the Fourier analysis. However, it is difficult to generalize Fourier method to a nonlinear setting, and thus there is no result in the nonlinear analysis of Jeans instability. We firstly develop a non-Fourier-based method to reprove the linearized Jeans instability in the expanding Newtonian universe. Secondly, we generalize this idea to a slightly nonlinear case. This method relies on the Cauchy problem of the Fuchsian system due to the recent developments of this system in mathematics. The fully nonlinear Jeans instability for the Euler-Poisson and Einstein-Euler equations are in progress.

math.AP↗

arXiv2022

Sparse-Dyn: Sparse Dynamic Graph Multi-representation Learning via Event-based Sparse Temporal Attention Network

Dynamic graph neural networks have been widely used in modeling and representation learning of graph structure data. Current dynamic representation learning focuses on either discrete learning which results in temporal information loss or continuous learning that involves heavy computation. In this work, we proposed a novel dynamic graph neural network, Sparse-Dyn. It adaptively encodes temporal information into a sequence of patches with an equal amount of temporal-topological structure. Therefore, while avoiding the use of snapshots which causes information loss, it also achieves a finer time granularity, which is close to what continuous networks could provide. In addition, we also designed a lightweight module, Sparse Temporal Transformer, to compute node representations through both structural neighborhoods and temporal dynamics. Since the fully-connected attention conjunction is simplified, the computation cost is far lower than the current state-of-the-arts. Link prediction experiments are conducted on both continuous and discrete graph datasets. Through comparing with several state-of-the-art graph embedding baselines, the experimental results demonstrate that Sparse-Dyn has a faster inference speed while having competitive performance.

cs.LG↗

arXiv2022

A Robust Hot Subdwarfs Identification Method Based on Deep Learning

Hot subdwarf star is a particular type of star that is crucial for studying binary evolution and atmospheric diffusion processes. In recent years, identifying Hot subdwarfs by machine learning methods has become a hot topic, but there are still limitations in automation and accuracy. In this paper, we proposed a robust identification method based on the convolutional neural network (CNN). We first constructed the dataset using the spectral data of LAMOS DR7-V1. We then constructed a hybrid recognition model including an 8-class classification model and a binary classification model. The model achieved an accuracy of 96.17% on the testing set. To further validate the accuracy of the model, we selected 835 Hot subdwarfs that were not involved in the training process from the identified LAMOST catalog (2428, including repeated observations) as the validation set. An accuracy of 96.05% was achieved. On this basis, we used the model to filter and classify all 10,640,255 spectra of LAMOST DR7-V1, and obtained a catalog of 2393 Hot subdwarf candidates, of which 2067 have been confirmed. We found 25 new Hot subdwarfs among the remaining candidates by manual validation. The overall accuracy of the model is 87.42%. Overall, the model presented in this study can effectively identify specific spectra with robust results and high accuracy, and can be further applied to the classification of large-scale spectra and the search of specific targets.

astro-ph.SR↗

arXiv2022

Recursive Least Squares Policy Control with Echo State Network

The echo state network (ESN) is a special type of recurrent neural networks for processing the time-series dataset. However, limited by the strong correlation among sequential samples of the agent, ESN-based policy control algorithms are difficult to use the recursive least squares (RLS) algorithm to update the ESN's parameters. To solve this problem, we propose two novel policy control algorithms, ESNRLS-Q and ESNRLS-Sarsa. Firstly, to reduce the correlation of training samples, we use the leaky integrator ESN and the mini-batch learning mode. Secondly, to make RLS suitable for training ESN in mini-batch mode, we present a new mean-approximation method for updating the RLS correlation matrix. Thirdly, to prevent ESN from over-fitting, we use the L1 regularization technique. Lastly, to prevent the target state-action value from overestimation, we employ the Mellowmax method. Simulation results show that our algorithms have good convergence performance.

cs.LG↗

arXiv2022

A bimodal distribution of haze in Pluto's atmosphere

Pluto, Titan, and Triton make up a unique class of solar system bodies, with icy surfaces and chemically reducing atmospheres rich in organic photochemistry and haze formation. Hazes play important roles in these atmospheres, with physical and chemical processes highly dependent on particle sizes, but the haze size distribution in reducing atmospheres is currently poorly understood. Here we report observational evidence that Pluto's haze particles are bimodally distributed, which successfully reproduces the full phase scattering observations from New Horizons. Combined with previous simulations of Titan's haze, this result suggests that haze particles in reducing atmospheres undergo rapid shape change near pressure levels ~0.5Pa and favors a photochemical rather than a dynamical origin for the formation of Titan's detached haze. It also demonstrates that both oxidizing and reducing atmospheres can produce multi-modal hazes, and encourages reanalysis of observations of hazes on Titan and Triton.

astro-ph.EP↗

arXiv2022

A Low-Cost, Highly Customizable Solution for Position Estimation in Modular Robots

Accurate position sensing is important for state estimation and control in robotics. Reliable and accurate position sensors are usually expensive and difficult to customize. Incorporating them into systems that have very tight volume constraints such as modular robots are particularly difficult. PaintPots are low-cost, reliable, and highly customizable position sensors, but their performance is highly dependent on the manufacturing and calibration process. This paper presents a Kalman filter with a simplified observation model developed to deal with the non-linearity issues that result in the use of low-cost microcontrollers. In addition, a complete solution for the use of PaintPots in a variety of sensing modalities including manufacturing, characterization, and estimation is presented for an example modular robot, SMORES-EP. This solution can be easily adapted to a wide range of applications.

cs.RO↗

arXiv2022

On-demand Integrated Quantum Memory for Polarization Qubits

Photonic polarization qubits are widely used in quantum computation and quantum communication due to the robustness in transmission and the easy qubit manipulation. An integrated quantum memory for polarization qubits is a fundamental building block for large-scale integrated quantum networks. However, on-demand storing polarization qubits in an integrated quantum memory is a long-standing challenge due to the anisotropic absorption of solids and the polarization-dependent features of microstructures. Here we demonstrate a reliable on-demand quantum memory for polarization qubits, using a depressed-cladding waveguide fabricated in a 151Eu3+: Y2SiO5 crystal. The site-2 151Eu3+ ions in Y2SiO5 crystal provides a near-uniform absorption for arbitrary polarization states and a new pump sequence is developed to prepare a wideband and enhanced absorption profile. A fidelity of 99.4\pm0.6% is obtained for the qubit storage process with an input of 0.32 photons per pulse, together with a storage bandwidth of 10 MHz. This reliable integrated quantum memory for polarization qubits reveals the potential for use in the construction of integrated quantum networks.

quant-ph↗

arXiv2022

Graph Decipher: A transparent dual-attention graph neural network to understand the message-passing mechanism for the node classification

Graph neural networks can be effectively applied to find solutions for many real-world problems across widely diverse fields. The success of graph neural networks is linked to the message-passing mechanism on the graph, however, the message-aggregating behavior is still not entirely clear in most algorithms. To improve functionality, we propose a new transparent network called Graph Decipher to investigate the message-passing mechanism by prioritizing in two main components: the graph structure and node attributes, at the graph, feature, and global levels on a graph under the node classification task. However, the computation burden now becomes the most significant issue because the relevance of both graph structure and node attributes are computed on a graph. In order to solve this issue, only relevant representative node attributes are extracted by graph feature filters, allowing calculations to be performed in a category-oriented manner. Experiments on seven datasets show that Graph Decipher achieves state-of-the-art performance while imposing a substantially lower computation burden under the node classification task. Additionally, since our algorithm has the ability to explore the representative node attributes by category, it is utilized to alleviate the imbalanced node classification problem on multi-class graph datasets.

cs.LG↗

arXiv2021

The Spectroscopic Binaries from LAMOST Medium-Resolution Survey (MRS). I. Searching for Double-lined Spectroscopic Binaries (SB2s) with Convolutional Neural Network

We developed a convolutional neural network (CNN) model to distinguish the double-lined spectroscopic binaries (SB2s) from others based on single exposure medium-resolution spectra ($R\sim 7,500$). The training set consists of a large set of mock spectra of single stars and binaries synthesized based on the MIST stellar evolutionary model and ATLAS9 atmospheric model. Our model reaches a novel theoretic false positive rate by adding a proper penalty on the negative sample (e.g., 0.12\% and 0.16\% for the blue/red arm when the penalty parameter $Λ=16$). Tests show that the performance is as expected and favors FGK-type Main-sequence binaries with high mass ratio ($q \geq 0.7$) and large radial velocity separation ($Δv \geq 50\,\mathrm{km\,s^{-1}}$). Although the real false positive rate can not be estimated reliably, validating on eclipsing binaries identified from Kepler light curves indicates that our model predicts low binary probabilities at eclipsing phases (0, 0.5, and 1.0) as expected. The color-magnitude diagram also helps illustrate its feasibility and capability of identifying FGK MS binaries from spectra. We conclude that this model is reasonably reliable and can provide an automatic approach to identify SB2s with period $\lesssim 10$ days. This work yields a catalog of binary probabilities for over 5 million spectra of 1 million sources from the LAMOST medium-resolution survey (MRS), and a catalog of 2198 SB2 candidates whose physical properties will be analyzed in our following-up paper. Data products are made publicly available at the journal as well as our Github website.

astro-ph.SR↗

arXiv2021

Trusted And Confidential Program Analysis

We develop the concept of Trusted and Confidential Program Analysis (TCPA) which enables program certification to be used where previously there was insufficient trust. Imagine a scenario where a producer may not be trusted to certify its own software (perhaps by a foreign regulator), and the producer is unwilling to release its sources and detailed design to any external body. We present a protocol that can, using trusted computing based on encrypted sources, create certification via which all can trust the delivered object code without revealing the unencrypted sources to any party. Furthermore, we describe a realization of TCPA with trusted execution environments (TEE) that enables general and efficient computation. We have implemented the TCPA protocol in a system called TCWasm for web assembly architectures. In our evaluation with 33 benchmark cases, TCWasm managed to finish the analysis with relatively slight overheads.

cs.CR↗

arXiv2021

A Catalog of LAMOST Variable Sources Based on Time-domain Photometry of ZTF

The identification and analysis of different variable sources is a hot issue in astrophysical research. The Large Sky Area Multi-Object Fiber Spectroscopic Telescope (LAMOST) spectroscopic survey has accumulated massive spectral data but contains no information about variable sources. Although a few related studies present variable source catalogs for the LAMOST, the studies still have a few deficiencies regarding the type and number of variable sources identified. In this study, we presented a statistical modeling approach to identify variable source candidates. We first crossed the Kepler, Sloan Digital Sky Survey (SDSS), and Zwicky Transient Facility (ZTF) catalogs to obtain light curves data of variable and non-variable sources. The data are then modeled statistically using commonly used variability parameters, respectively. And then, an optimal variable source identification model is determined using the Receiver Operating Characteristic (ROC) curve and four credible evaluation indices such as precision, accuracy, recall, and F1score. Based on this identification model, a catalog of LAMOST variable sources (including 631,769 variable source candidates with a probability greater than 95% and so on) is obtained. To validate the correctness of the catalog, we performed a two-by-two cross-comparison with the GAIA catalog and other published variable source catalogs. We achieved the correct rate ranging from 50% to 100%. Among the 123,756 sources cross-matched, our variable source catalog identifies 85,669 with a correct rate of 69%, which indicates that the variable source catalog presented in this study is credible.

astro-ph.SR↗