Abstract
In the Age of Big Data, graph embedding has received increasing attention for its ability to accommodate the explosion in data volume and diversity, which challenge the foundation of modern recommender systems. Respectively, graph facilitates fusing complex systems of interactions into a unified structure and distributed embedding enables efficient retrieval of entities, as in the case of approximate nearest neighbor (ANN) search. When combined, graph embedding captures relational information beyond entity interaction and towards a problem's underlying structure, as epitomized by struct2vec [20] and PinSage [26]. This session will start by brushing up on the basics about graphs and embedding methods and discussing their merits. We then quickly dive into using the mathematical formulation of graph embedding to derive the modular framework: Sampler-Mapper-Optimizer for Recommendation, or SMORe. We demonstrate existing models used for recommendation, such as MF and BPR, can all be assembled using three basic components: sampler, mapper, and optimizer. The tutorial is accompanied by a hands-on session, where we show how graph embedding can model complex systems through the multi-task learning and the crossplatform data sparsity alleviation tasks.