arXiv subjects

Peng Jiang

Publications and source records attributed to Peng Jiang.

At least 253 records · Page 14Linked to original sources

arXiv2023

Atlas of dynamic spectra of fast radio burst FRB 20201124A

Fast radio bursts (FRBs) are highly dispersed millisecond-duration radio bursts, of which the physical origin is still not fully understood. FRB 20201124A is one of the most actively repeating FRBs. In this paper, we present the collection of 1863 burst dynamic spectra of FRB 20201124A measured with the Five-hundred-meter Aperture Spherical radio Telescope (FAST). The current collection, taken from the observation during the FRB active phase from April to June 2021, is the largest burst sample detected in any FRB so far. The standard PSRFITs format is adopted, including dynamic spectra of the burst, and the time information of the dynamic spectra, in addition, mask files help readers to identify the pulse positions are also provided.

astro-ph.HE↗

arXiv2022

Automated Optical Inspection of FAST's Reflector Surface using Drones and Computer Vision

The Five-hundred-meter Aperture Spherical radio Telescope (FAST) is the world's largest single-dish radio telescope. Its large reflecting surface achieves unprecedented sensitivity but is prone to damage, such as dents and holes, caused by naturally-occurring falling objects. Hence, the timely and accurate detection of surface defects is crucial for FAST's stable operation. Conventional manual inspection involves human inspectors climbing up and examining the large surface visually, a time-consuming and potentially unreliable process. To accelerate the inspection process and increase its accuracy, this work makes the first step towards automating the inspection of FAST by integrating deep-learning techniques with drone technology. First, a drone flies over the surface along a predetermined route. Since surface defects significantly vary in scale and show high inter-class similarity, directly applying existing deep detectors to detect defects on the drone imagery is highly prone to missing and misidentifying defects. As a remedy, we introduce cross-fusion, a dedicated plug-in operation for deep detectors that enables the adaptive fusion of multi-level features in a point-wise selective fashion, depending on local defect patterns. Consequently, strong semantics and fine-grained details are dynamically fused at different positions to support the accurate detection of defects of various scales and types. Our AI-powered drone-based automated inspection is time-efficient, reliable, and has good accessibility, which guarantees the long-term and stable operation of FAST.

cs.CV↗

arXiv2022

Optical flux and spectral variability of BL Lacertae during its historical high outburst in 2020

BL Lacertae had undergone a series of historical high flux activity over a year, from August 2020 in the optical to VHE $γ$-rays. In this paper, we report on optical flux and spectral variability of the first historical maxima outburst event during October-November in g, r and i bands with the 1.26m telescope at Xinglong observatory, China. We detected significant intranight variations with amplitude rising up to $\sim 30$%, when the fastest variability timescale is found to be a few tens of minutes, giving an emitting region size of the order $10^{-3}$ pc, which corresponds to $\sim 100$ Schwarzschild radius of the central black hole, likely coming from some jet mini-structures. Unlike on intranight timescale, a clear frequency dependent pattern along with symmetric timescales ($\sim$ 11d) of flux variation are detected on long timescale. The spectral evolution was predominated by flattening of the spectra with increasing brightness i.e., a bluer-when-brighter trend in 96% of the cases. On the night before the outburst peak, the color indices clustered in two distinct branches in color--magnitude diagram within a period of $\sim$ 6 hours that is connected to a hard-soft-hard spectral evolution trend extracted from time-resolved spectra. Such trend has never seen in BL Lac or any other blazars before to the best of our knowledge. The results obtained in this study can be explained in the context of shock induced particle acceleration or magnetic re-connection in the jet where turbulent processes most likely resulted the asymmetric flux variation on nightly timescale.

astro-ph.HE↗

arXiv2022

Radio continuum and OH line emission of high-z OH megamaser galaxies

We present the study of arcsecond scale radio continuum and OH line emission of a sample of known OH megamaser galaxies with $z \geq$ 0.15 using archival Very Large Array (VLA) data. And also the results of our pilot Five hundred meter aperture spherical radio telescope (FAST) observations of 12 of these OHM galaxies. The arcsecond-scale resolution images show that the OH emission is distributed in one compact structure and spatially associated with radio continuum emission. Furthermore, nearly all the fitted components are likely smaller than the beam size ($\sim$ 1.4"), which indicates that the broad OH line profiles of these sources originated from one masing region or that more components are distributed in sub-arcsec scales. The radio parameters, including brightness temperature, spectral index, and q-index, show no significant differences with the low-redshift OHM galaxies, which have significantly lower OH line luminosities. Because these parameters are indicators of the central power sources (AGN, starburst, or both), our results indicate that the presence of radio AGN in the nuclei may not be essential for the formation of OH emission. Over 1/3 of OHMs in this sample (6/17) show possible variable features likely caused by interstellar scintillation due to small angular sizes. We might underestimate this value because these sources are associated with this sample's highest OH line flux densities. Those with low OH line flux densities might need higher sensitivity observations to study the variabilities. These results support the compact nature of OH maser emission and a starburst origin for the OHMs in our selected sample.

astro-ph.GA↗

arXiv2022

Estimation of Solar Observations with the Five-hundred-meter Aperture Spherical Radio Telescope (FAST)

We present the estimation of the solar observation with the Five-hundred-meter Aperture Spherical radio Telescope (FAST). For both the quite Sun and the Sun with radio bursts, when pointing directly to the Sun, the total power received by FAST would be out of the safe operational range of the signal chain, even resulting in the damage to the receiver. As a conclusion, the Sun should be kept at least $\sim 2^{\circ}$ away from the main beam during the observing at $\sim 1.25 {\ \rm GHz}$. The separation for lower frequency should be larger. For simplicity, the angular separation between the FAST beam and the Sun is suggested to be $\sim 5^{\circ}$ for observations on 200 MHz or higher bands.

astro-ph.IM↗

arXiv2022

Real-time Short Video Recommendation on Mobile Devices

Short video applications have attracted billions of users in recent years, fulfilling their various needs with diverse content. Users usually watch short videos on many topics on mobile devices in a short period of time, and give explicit or implicit feedback very quickly to the short videos they watch. The recommender system needs to perceive users' preferences in real-time in order to satisfy their changing interests. Traditionally, recommender systems deployed at server side return a ranked list of videos for each request from client. Thus it cannot adjust the recommendation results according to the user's real-time feedback before the next request. Due to client-server transmitting latency, it is also unable to make immediate use of users' real-time feedback. However, as users continue to watch videos and feedback, the changing context leads the ranking of the server-side recommendation system inaccurate. In this paper, we propose to deploy a short video recommendation framework on mobile devices to solve these problems. Specifically, we design and deploy a tiny on-device ranking model to enable real-time re-ranking of server-side recommendation results. We improve its prediction accuracy by exploiting users' real-time feedback of watched videos and client-specific real-time features. With more accurate predictions, we further consider interactions among candidate videos, and propose a context-aware re-ranking method based on adaptive beam search. The framework has been deployed on Kuaishou, a billion-user scale short video application, and improved effective view, like and follow by 1.28%, 8.22% and 13.6% respectively.

cs.IR↗

arXiv2022

Physics-driven Deep Learning Inversion for Direct Current Resistivity Survey Data

The direct-current (DC) resistivity method is a commonly used geophysical technique for surveying adverse geological conditions. Inversion can reconstruct the resistivity model from data, which is an important step in the geophysical survey. However, the inverse problem is a serious ill-posed problem that makes it easy to obtain incorrect inversion results. Deep learning (DL) provides new avenues for solving inverse problems, and has been widely studied. Currently, most DL inversion methods for resistivity are purely data-driven and depend heavily on labels (real resistivity models). However, real resistivity models are difficult to obtain through field surveys. An inversion network may not be effectively trained without labels. In this study, we built an unsupervised learning resistivity inversion scheme based on the physical law of electric field propagation. First, a forward modeling process was embedded into the network training, which converted the predicted model to predicted data and formed a data misfit to the observation data. Unsupervised training independent of the real model was realized using the data misfit as a loss function. Moreover, a dynamic smoothing constraint was imposed on the loss function to alleviate the ill-posed inverse problem. Finally, a transfer learning scheme was applied to adapt the trained network with simulated data to field data. Numerical simulations and field tests showed that the proposed method can accurately locate and depict geological targets.

physics.geo-ph↗

arXiv2022

Seamlessly Unifying Attributes and Items: Conversational Recommendation for Cold-Start Users

Static recommendation methods like collaborative filtering suffer from the inherent limitation of performing real-time personalization for cold-start users. Online recommendation, e.g., multi-armed bandit approach, addresses this limitation by interactively exploring user preference online and pursuing the exploration-exploitation (EE) trade-off. However, existing bandit-based methods model recommendation actions homogeneously. Specifically, they only consider the items as the arms, being incapable of handling the item attributes, which naturally provide interpretable information of user's current demands and can effectively filter out undesired items. In this work, we consider the conversational recommendation for cold-start users, where a system can both ask the attributes from and recommend items to a user interactively. This important scenario was studied in a recent work. However, it employs a hand-crafted function to decide when to ask attributes or make recommendations. Such separate modeling of attributes and items makes the effectiveness of the system highly rely on the choice of the hand-crafted function, thus introducing fragility to the system. To address this limitation, we seamlessly unify attributes and items in the same arm space and achieve their EE trade-offs automatically using the framework of Thompson Sampling. Our Conversational Thompson Sampling (ConTS) model holistically solves all questions in conversational recommendation by choosing the arm with the maximal reward to play. Extensive experiments on three benchmark datasets show that ConTS outperforms the state-of-the-art methods Conversational UCB (ConUCB) and Estimation-Action-Reflection model in both metrics of success rate and average number of conversation turns.

cs.IR↗

arXiv2022

Sensitive Multi-beam Targeted SETI Observations towards 33 Exoplanet Systems with FAST

As a major approach to looking for life beyond the Earth, the search for extraterrestrial intelligence (SETI) is committed to detecting technosignatures such as engineered radio signals that are indicative of technologically capable life. In this paper, we report a targeted SETI campaign employing an observation strategy named multi-beam coincidence matching (MBCM) at the Five-hundred-meter Aperture Spherical radio Telescope (FAST) towards 33 known exoplanet systems, searching for ETI narrow-band drifting signals across 1.05-1.45 GHz in two orthogonal linear polarization directions separately. A signal at 1140.604 MHz detected from the observation towards Kepler-438 originally peaked our interest because its features are roughly consistent with assumed ETI technosignatures. However, evidences such as its polarization characteristics are almost able to eliminate the possibility of an extraterrestrial origin. Our observations achieve an unprecedented sensitivity since the minimum equivalent isotropic radiated power (EIRP) we are able to detect reaches 1.48 x10^9 W.

astro-ph.EP↗

arXiv2022

Deeply Supervised Layer Selective Attention Network: Towards Label-Efficient Learning for Medical Image Classification

Labeling medical images depends on professional knowledge, making it difficult to acquire large amount of annotated medical images with high quality in a short time. Thus, making good use of limited labeled samples in a small dataset to build a high-performance model is the key to medical image classification problem. In this paper, we propose a deeply supervised Layer Selective Attention Network (LSANet), which comprehensively uses label information in feature-level and prediction-level supervision. For feature-level supervision, in order to better fuse the low-level features and high-level features, we propose a novel visual attention module, Layer Selective Attention (LSA), to focus on the feature selection of different layers. LSA introduces a weight allocation scheme which can dynamically adjust the weighting factor of each auxiliary branch during the whole training process to further enhance deeply supervised learning and ensure its generalization. For prediction-level supervision, we adopt the knowledge synergy strategy to promote hierarchical information interactions among all supervision branches via pairwise knowledge matching. Using the public dataset, MedMNIST, which is a large-scale benchmark for biomedical image classification covering diverse medical specialties, we evaluate LSANet on multiple mainstream CNN architectures and various visual attention modules. The experimental results show the substantial improvements of our proposed method over its corresponding counterparts, demonstrating that LSANet can provide a promising solution for label-efficient learning in the field of medical image classification.

cs.CV↗

arXiv2022

KuaiRand: An Unbiased Sequential Recommendation Dataset with Randomly Exposed Videos

Recommender systems deployed in real-world applications can have inherent exposure bias, which leads to the biased logged data plaguing the researchers. A fundamental way to address this thorny problem is to collect users' interactions on randomly expose items, i.e., the missing-at-random data. A few works have asked certain users to rate or select randomly recommended items, e.g., Yahoo!, Coat, and OpenBandit. However, these datasets are either too small in size or lack key information, such as unique user ID or the features of users/items. In this work, we present KuaiRand, an unbiased sequential recommendation dataset containing millions of intervened interactions on randomly exposed videos, collected from the video-sharing mobile App, Kuaishou. Different from existing datasets, KuaiRand records 12 kinds of user feedback signals (e.g., click, like, and view time) on randomly exposed videos inserted in the recommendation feeds in two weeks. To facilitate model learning, we further collect rich features of users and items as well as users' behavior history. By releasing this dataset, we enable the research of advanced debiasing large-scale recommendation scenarios for the first time. Also, with its distinctive features, KuaiRand can support various other research directions such as interactive recommendation, long sequential behavior modeling, and multi-task learning. The dataset and its news will be available at https://kuairand.com.

cs.IR↗

arXiv2022

KuaiRec: A Fully-observed Dataset and Insights for Evaluating Recommender Systems

The progress of recommender systems is hampered mainly by evaluation as it requires real-time interactions between humans and systems, which is too laborious and expensive. This issue is usually approached by utilizing the interaction history to conduct offline evaluation. However, existing datasets of user-item interactions are partially observed, leaving it unclear how and to what extent the missing interactions will influence the evaluation. To answer this question, we collect a fully-observed dataset from Kuaishou's online environment, where almost all 1,411 users have been exposed to all 3,327 items. To the best of our knowledge, this is the first real-world fully-observed data with millions of user-item interactions. With this unique dataset, we conduct a preliminary analysis of how the two factors - data density and exposure bias - affect the evaluation results of multi-round conversational recommendation. Our main discoveries are that the performance ranking of different methods varies with the two factors, and this effect can only be alleviated in certain cases by estimating missing interactions for user simulation. This demonstrates the necessity of the fully-observed dataset. We release the dataset and the pipeline implementation for evaluation at https://kuairec.com

cs.IR↗

arXiv2022

The Neural-Prediction based Acceleration Algorithm of Column Generation for Graph-Based Set Covering Problems

Set covering problem is an important class of combinatorial optimization problems, which has been widely applied and studied in many fields. In this paper, we propose an improved column generation algorithm with neural prediction (CG-P) for solving graph-based set covering problems. We leverage a graph neural network based neural prediction model to predict the probability to be included in the final solution for each edge. Our CG-P algorithm constructs a reduced graph that only contains the edges with higher predicted probability, and this graph reduction process significantly speeds up the solution process. We evaluate the CG-P algorithm on railway crew scheduling problems and it outperforms the baseline column generation algorithm. We provide two solution modes for our CG-P algorithm. In the optimal mode, we can obtain a solution with an optimality guarantee while reducing the time cost to 63.12%. In the fast mode, we can obtain a sub-optimal solution with a 7.62% optimality gap in only 2.91% computation time.

cs.LG↗

arXiv2022

Contrastive Learning of Features between Images and LiDAR

Image and Point Clouds provide different information for robots. Finding the correspondences between data from different sensors is crucial for various tasks such as localization, mapping, and navigation. Learning-based descriptors have been developed for single sensors; there is little work on cross-modal features. This work treats learning cross-modal features as a dense contrastive learning problem. We propose a Tuple-Circle loss function for cross-modality feature learning. Furthermore, to learn good features and not lose generality, we developed a variant of widely used PointNet++ architecture for point cloud and U-Net CNN architecture for images. Moreover, we conduct experiments on a real-world dataset to show the effectiveness of our loss function and network structure. We show that our models indeed learn information from both images as well as LiDAR by visualizing the features.

cs.CV↗

arXiv2022

Deconfounding Duration Bias in Watch-time Prediction for Video Recommendation

Watch-time prediction remains to be a key factor in reinforcing user engagement via video recommendations. It has become increasingly important given the ever-growing popularity of online videos. However, prediction of watch time not only depends on the match between the user and the video but is often mislead by the duration of the video itself. With the goal of improving watch time, recommendation is always biased towards videos with long duration. Models trained on this imbalanced data face the risk of bias amplification, which misguides platforms to over-recommend videos with long duration but overlook the underlying user interests. This paper presents the first work to study duration bias in watch-time prediction for video recommendation. We employ a causal graph illuminating that duration is a confounding factor that concurrently affects video exposure and watch-time prediction -- the first effect on video causes the bias issue and should be eliminated, while the second effect on watch time originates from video intrinsic characteristics and should be preserved. To remove the undesired bias but leverage the natural effect, we propose a Duration Deconfounded Quantile-based (D2Q) watch-time prediction framework, which allows for scalability to perform on industry production systems. Through extensive offline evaluation and live experiments, we showcase the effectiveness of this duration-deconfounding framework by significantly outperforming the state-of-the-art baselines. We have fully launched our approach on Kuaishou App, which has substantially improved real-time video consumption due to more accurate watch-time predictions.

cs.IR↗

arXiv2022

Feature-aware Diversified Re-ranking with Disentangled Representations for Relevant Recommendation

Relevant recommendation is a special recommendation scenario which provides relevant items when users express interests on one target item (e.g., click, like and purchase). Besides considering the relevance between recommendations and trigger item, the recommendations should also be diversified to avoid information cocoons. However, existing diversified recommendation methods mainly focus on item-level diversity which is insufficient when the recommended items are all relevant to the target item. Moreover, redundant or noisy item features might affect the performance of simple feature-aware recommendation approaches. Faced with these issues, we propose a Feature Disentanglement Self-Balancing Re-ranking framework (FDSB) to capture feature-aware diversity. The framework consists of two major modules, namely disentangled attention encoder (DAE) and self-balanced multi-aspect ranker. In DAE, we use multi-head attention to learn disentangled aspects from rich item features. In the ranker, we develop an aspect-specific ranking mechanism that is able to adaptively balance the relevance and diversity for each aspect. In experiments, we conduct offline evaluation on the collected dataset and deploy FDSB on KuaiShou app for online A/B test on the function of relevant recommendation. The significant improvements on both recommendation quality and user experience verify the effectiveness of our approach.

cs.IR↗

arXiv2022

SFE-AI at SemEval-2022 Task 11: Low-Resource Named Entity Recognition using Large Pre-trained Language Models

Large scale pre-training models have been widely used in named entity recognition (NER) tasks. However, model ensemble through parameter averaging or voting can not give full play to the differentiation advantages of different models, especially in the open domain. This paper describes our NER system in the SemEval 2022 task11: MultiCoNER. We proposed an effective system to adaptively ensemble pre-trained language models by a Transformer layer. By assigning different weights to each model for different inputs, we adopted the Transformer layer to integrate the advantages of diverse models effectively. Experimental results show that our method achieves superior performances in Farsi and Dutch.

cs.CL↗

arXiv2022

Constrained Reinforcement Learning for Short Video Recommendation

The wide popularity of short videos on social media poses new opportunities and challenges to optimize recommender systems on the video-sharing platforms. Users provide complex and multi-faceted responses towards recommendations, including watch time and various types of interactions with videos. As a result, established recommendation algorithms that concern a single objective are not adequate to meet this new demand of optimizing comprehensive user experiences. In this paper, we formulate the problem of short video recommendation as a constrained Markov Decision Process (MDP), where platforms want to optimize the main goal of user watch time in long term, with the constraint of accommodating the auxiliary responses of user interactions such as sharing/downloading videos. To solve the constrained MDP, we propose a two-stage reinforcement learning approach based on actor-critic framework. At stage one, we learn individual policies to optimize each auxiliary response. At stage two, we learn a policy to (i) optimize the main response and (ii) stay close to policies learned at the first stage, which effectively guarantees the performance of this main policy on the auxiliaries. Through extensive simulations, we demonstrate effectiveness of our approach over alternatives in both optimizing the main goal as well as balancing the others. We further show the advantage of our approach in live experiments of short video recommendations, where it significantly outperforms other baselines in terms of watch time and interactions from video views. Our approach has been fully launched in the production system to optimize user experiences on the platform.

cs.LG↗