Yaqing Wang

Yaqing Wang

Auto-generated profile, based on publicly available information

Yaqing Wang

Beijing Institute of Mathematical Sciences and Applications, Beijing, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 June 2020 in ACM Computing Surveys
Verified
Journal Article
Open access
YWYaqing Wang
Yaqing Wang
QYQuanming Yao
Quanming Yao
JKJames T. Kwok
James T. Kwok
LNLionel M. Ni
Lionel M. Ni
Machine learning has been highly successful in data-intensive applications but is often hampered when the data set is small. Recently, Few-shot Learning (FSL) is proposed to tackle this problem. Using prior knowledge, FSL can rapidly generalize to new tasks containing only a few samples with supervised information. In this article, we conduct a thorough survey to fully understand FSL. Starting from a formal definition of FSL, we distinguish FSL from several relevant machine learning problems. We then point out that the core issue in FSL is that the empirical risk minimizer is unreliable. Based on how prior knowledge can be used to handle this core issue, we categorize FSL methods from three perspectives: (i) data, which uses prior knowledge to augment the supervised experience; (ii) model, which uses prior knowledge to reduce the size of the hypothesis space; and (iii) algorithm, which uses prior knowledge to alter the search for the best hypothesis in the given hypothesis space. With this taxonomy, we review and discuss the pros and cons of each category. Promising directions, in the aspects of the FSL problem setups, techniques, applications, and theories, are also proposed to provide insights for future research.1

28 March 2024 in Communications Medicine
Verified
Journal Article
Open access
PDF file
YWYaqing Wang
Yaqing Wang
ZYZaifei Yang
Zaifei Yang
QYQuanming Yao
Quanming Yao
Background: Discovering potential drug-drug interactions (DDIs) is a long-standing challenge in clinical treatments and drug developments. Recently, deep learning techniques have been developed for DDI prediction. However, they generally require a huge number of samples, while known DDIs are rare.Methods: In this work, we present KnowDDI, a graph neural network-based method that addresses the above challenge. KnowDDI enhances drug representations by adaptively leveraging rich neighborhood information from large biomedical knowledge graphs. Then, it learns a knowledge subgraph for each drug-pair to interpret the predicted DDI, where each of the edges is associated with a connection strength indicating the importance of a known DDI or resembling strength between a drug-pair whose connection is unknown. Thus, the lack of DDIs is implicitly compensated by the enriched drug representations and propagated drug similarities.Results: Here we show the evaluation results of KnowDDI on two benchmark DDI datasets. Results show that KnowDDI obtains the state-of-the-art prediction performance with better interpretability. We also find that KnowDDI suffers less than existing works given a sparser knowledge graph. This indicates that the propagated drug similarities play a more important role in compensating for the lack of DDIs when the drug representations are less enriched.Conclusions: KnowDDI nicely combines the efficiency of deep learning techniques and the rich prior knowledge in biomedical knowledge graphs. As an original open-source tool, KnowDDI can help detect possible interactions in a broad range of relevant interaction prediction tasks, such as protein-protein interactions, drug-target interactions and disease-gene interactions, eventually promoting the development of biomedicine and healthcare.

30 May 2018 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
YWYaqing Wang
Yaqing Wang
QYQuanming Yao
Quanming Yao
JKJames Kwok
James Kwok
LNLionel M. Ni
Lionel M. Ni
Convolutional sparse coding (CSC) improves sparse coding by learning a shift-invariant dictionary from the data. However, most existing CSC algorithms operate in the batch mode and are expensive, in terms of both space and time, on large data sets. In this paper, we alleviate these problems by using online learning. The key is a reformulation of the CSC objective so that convolution can be handled easily in the frequency domain and much smaller history matrices are needed. We use the alternating direction method of multipliers (ADMM) to solve the resultant optimization problem, and the ADMM subproblems have efficient closed-form solutions. Theoretical analysis shows that the learned dictionary converges to a stationary point of the optimization problem. Extensive experiments are performed on both standard CSC benchmark data sets and much larger data sets such as the ImageNet. Results show that the proposed algorithm outperforms state-of-the-art batch and online CSC methods by being more scalable, and has faster convergence and better reconstruction performance.

21 February 2024 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
QYQuanming Yao
Quanming Yao
ZSZhenqian Shen
Zhenqian Shen
YWYaqing Wang
Yaqing Wang
DDDejing Dou
Dejing Dou
Molecular property prediction plays a fundamental role in AI-aided drug discovery to identify candidate molecules, which is also essentially a few-shot problem due to lack of labeled data. In this paper, we propose Property-Aware Relation networks (PAR) to handle this problem. We first introduce a property-aware molecular encoder to transform the generic molecular embeddings to property-aware ones. Then, we design a query-dependent relation graph learning module to estimate molecular relation graph and refine molecular embeddings w.r.t. the target property. Thus, the facts that both property-related information and relationships among molecules change across different properties are utilized to better learn and propagate molecular embeddings. Generally, PAR can be regarded as a combination of metric-based and optimization-based few-shot learning method. We further extend PAR to Transferable PAR (T-PAR) to handle the distribution shift, which is common in drug discovery. The keys are joint sampling and relation graph learning schemes, which simultaneously learn molecular embeddings from both source and target domains. Extensive results on benchmark datasets show that PAR and T-PAR consistently outperform existing methods on few-shot and transferable few-shot molecular property prediction tasks, respectively. Besides, ablation and case studies are conducted to validate the rationality of our designs in PAR and T-PAR.

26 April 2023 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
ZWZhen Wang
Zhen Wang
HNHongyi Nie
Hongyi Nie
WZWei Zheng
Wei Zheng
YWYaqing Wang
Yaqing Wang
XLXuelong Li
Xuelong Li
The relational triplet is a format to represent relational facts in the real world, which consists of two entities and a semantic relation between these two entities. Since the relational triplet is the essential component in a knowledge graph (KG), extracting relational triplets from unstructured texts is vital for KG construction and has attached increasing research interest in recent years. In this work, we find that relation correlation is common in real life and could be beneficial for the relational triplet extraction task. However, existing relational triplet extraction works neglect to explore the relation correlation that bottlenecks the model performance. Therefore, to better explore and take advantage of the correlation among semantic relations, we innovatively utilize a three-dimension word relation tensor to describe relations between words in a sentence. Then, we treat the relation extraction task as a tensor learning problem and propose an end-to-end tensor learning model based on Tucker decomposition. Compared with directly capturing correlation among relations in a sentence, learning the correlation of elements in a three-dimension word relation tensor is more feasible and could be addressed through tensor learning methods. To verify the effectiveness of the proposed model, extensive experiments are also conducted on two widely used benchmark datasets, that is, NYT and WebNLG. Results show that our model outperforms the state-of-the-art by a large margin of F1 scores, such as the developed model has an improvement of 3.2% on the NYT dataset compared to the state-of-the-art. Source codes and data can be found at https://github.com/Sirius11311/TLRel.git.

16 June 2023 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
JBJiang Bian
Jiang Bian
JHJizhou Huang
Jizhou Huang
SJShilei Ji
Shilei Ji
YLYuan Liao
Yuan Liao
XLXuhong Li
Xuhong Li
HXHaoyi Xiong
Haoyi Xiong
While recommender systems have been ubiquitously used in digital marketing and online business development, the conversions of online advertising for mobile apps installation and activation sometimes are far from satisfactory, due to the lack of feedback from App-related activities, leading to a poor record of Return on Investment (RoI). Though the advertisers, e.g., App operators and App Store, are granted to log users' app-related activities such as installation, activation, usages, and preferences per the agreement, they usually limit the access to such data from advertisement publishers, due to the privacy concerns. To improve conversions of online advertising under privacy controls, we propose Feynman —a fe derated learning-based advertising platform for ecos y stems-orie n ted m obile a pps recommendatio n . Feynman aims at improving the RoI of mobile app recommendation from an ecosystem's perspective, i.e., per investment in advertising an app ( Goal. 1 ) increasing the number of new installs/users of the app, and then ( Goal. 2 ) increasing the number of new active users (preferably with frequent in-app purchase activities). Incorporating with a federated computing platform, Feynman leverages users' records stored in advertisers to refine the pool of targeting users for ads distribution, and jointly builds the predictive models for users' purchase activities forecasting using features from the Ads publisher and the advertiser. With refined target pools and more accurate models, Feynman has successfully helped several mobile apps in China by attracting more than 100 million users to further enlarge their user populations and revenues from in-app purchases. Note that rather than proposing new techniques for federated learning, the design of Feynman dedicates to show its promising performance in the industrial practices of advertising using federated computing and privacy protected strategies. In three cases that we report in this paper, Feynman outperforms the state-of-the-art plans in terms of several key measurements, including Click-Through Rates (CTR), Conversion Rate (CVR), Cost per Action (CPA), and Non-targeting User Hit-Rates (NTHR).