arXiv subjects

Yuhao Yang

Publications and source records attributed to Yuhao Yang.

40 records · Page 3Linked to original sources

arXiv2022

Knowledge Graph Contrastive Learning for Recommendation

Knowledge Graphs (KGs) have been utilized as useful side information to improve recommendation quality. In those recommender systems, knowledge graph information often contains fruitful facts and inherent semantic relatedness among items. However, the success of such methods relies on the high quality knowledge graphs, and may not learn quality representations with two challenges: i) The long-tail distribution of entities results in sparse supervision signals for KG-enhanced item representation; ii) Real-world knowledge graphs are often noisy and contain topic-irrelevant connections between items and entities. Such KG sparsity and noise make the item-entity dependent relations deviate from reflecting their true characteristics, which significantly amplifies the noise effect and hinders the accurate representation of user's preference. To fill this research gap, we design a general Knowledge Graph Contrastive Learning framework (KGCL) that alleviates the information noise for knowledge graph-enhanced recommender systems. Specifically, we propose a knowledge graph augmentation schema to suppress KG noise in information aggregation, and derive more robust knowledge-aware representations for items. In addition, we exploit additional supervision signals from the KG augmentation process to guide a cross-view contrastive learning paradigm, giving a greater role to unbiased user-item interactions in gradient descent and further suppressing the noise. Extensive experiments on three public datasets demonstrate the consistent superiority of our KGCL over state-of-the-art techniques. KGCL also achieves strong performance in recommendation scenarios with sparse user-item interactions, long-tail and noisy KG entities. Our implementation codes are available at https://github.com/yuh-yang/KGCL-SIGIR22

cs.IR↗

arXiv2021

Abnormal Staebler-Wronski effect of amorphous silicon

Great achievements in last five years, such as record-efficient amorphous/crystalline silicon heterojunction (SHJ) solar cells and cutting-edge perovskite/SHJ tandem solar cells, place hydrogenated amorphous silicon (a-Si:H) at the forefront of emerging photovoltaics. Due to the extremely low doping efficiency of trivalent boron (B) in amorphous tetravalent silicon, light harvesting of aforementioned devices are limited by their fill factors (FF), which is a direct metric of the charge carrier transport. It is challenging but crucial to develop highly conductive doped a-Si:H for minimizing the FF losses. Here we report intensive light soaking can efficiently boost the dark conductance of B-doped a-Si:H "thin" films, which is an abnormal Staebler-Wronski effect. By implementing this abnormal effect to SHJ solar cells, we achieve a certificated power conversion efficiency (PCE) of 25.18% (26.05% on designated area) with FF of 85.42% on a 244.63-cm2 wafer. This PCE is one of the highest reported values for total-area "top/rear" contact silicon solar cells. The FF reaches 98.30 per cent of its Shockley-Queisser limit.

physics.app-ph↗

arXiv2019

BigDL: A Distributed Deep Learning Framework for Big Data

This paper presents BigDL (a distributed deep learning framework for Apache Spark), which has been used by a variety of users in the industry for building deep learning applications on production big data platforms. It allows deep learning applications to run on the Apache Hadoop/Spark cluster so as to directly process the production data, and as a part of the end-to-end data analysis pipeline for deployment and management. Unlike existing deep learning frameworks, BigDL implements distributed, data parallel training directly on top of the functional compute model (with copy-on-write and coarse-grained operations) of Spark. We also share real-world experience and "war stories" of users that have adopted BigDL to address their challenges(i.e., how to easily build end-to-end data analysis and deep learning pipelines for their production data).

cs.DC↗

arXiv2016

Learning Social Circles in Ego Networks based on Multi-View Social Graphs

In social network analysis, automatic social circle detection in ego-networks is becoming a fundamental and important task, with many potential applications such as user privacy protection or interest group recommendation. So far, most studies have focused on addressing two questions, namely, how to detect overlapping circles and how to detect circles using a combination of network structure and network node attributes. This paper asks an orthogonal research question, that is, how to detect circles based on network structures that are (usually) described by multiple views? Our investigation begins with crawling ego-networks from Twitter and employing classic techniques to model their structures by six views, including user relationships, user interactions and user content. We then apply both standard and our modified multi-view spectral clustering techniques to detect social circles in these ego-networks. Based on extensive automatic and manual experimental evaluations, we deliver two major findings: first, multi-view clustering techniques perform better than common single-view clustering techniques, which only use one view or naively integrate all views for detection, second, the standard multi-view clustering technique is less robust than our modified technique, which selectively transfers information across views based on an assumption that sparse network structures are (potentially) incomplete. In particular, the second finding makes us believe a direct application of standard clustering on potentially incomplete networks may yield biased results. We lightly examine this issue in theory, where we derive an upper bound for such bias by integrating theories of spectral clustering and matrix perturbation, and discuss how it may be affected by several network characteristics.

cs.SI↗