Yozen Liu

Yozen Liu

Auto-generated profile, based on publicly available information

Yozen Liu

Snap Inc., Santa Monica, CA, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications

18 July 2023
Verified
Conference Paper
Open access
JSJiahui Shi
Jiahui Shi
VCVivek Chaurasiya
Vivek Chaurasiya
YLYozen Liu
Yozen Liu
SVShubham Vij
Shubham Vij
YWYan Wu
Yan Wu
JYJun Yu
Jun Yu
Friend recommendation systems in online social and professional networks such as Snapchat helps users find friends and build connections, leading to better user engagement and retention. Traditional friend recommendation systems take advantage of the principle of locality and use graph traversal to retrieve friend candidates, e.g. Friends-of-Friends (FoF). While this approach has been adopted and shown efficacy in companies with large online networks such as Linkedin and Facebook, it suffers several challenges: (i) discrete graph traversal offers limited reach in cold-start settings, (ii) it is expensive and infeasible in realtime settings beyond 1 or 2 hop requests owing to latency constraints, and (iii) it cannot well-capture the complexity of graph topology or connection strengths, forcing one to resort to other mechanisms to rank and find top-K candidates. In this paper, we proposed a new Embedding Based Retrieval (EBR) system for retrieving friend candidates, which complements the traditional FoF retrieval by retrieving candidates beyond 2-hop, and providing a natural way to rank FoF candidates. Through online A/B test, we observe statistically significant improvements in the number of friendships made with EBR as an additional retrieval source in both low- and high-density network markets. Our contributions in this work include deploying a novel retrieval system to a large-scale friend recommendation system at Snapchat, generating embeddings for billions of users using Graph Neural Networks, and building EBR infrastructure in production to support Snapchat scale.

4 August 2023
Verified
Conference Paper
Open access
WSWilliam Shiao
William Shiao
USUday Singh Saini
Uday Singh Saini
YLYozen Liu
Yozen Liu
TZTong Zhao
Tong Zhao
NSNeil Shah
Neil Shah
EPEvangelos E. Papalexakis
Evangelos E. Papalexakis
Self-supervised learning on graphs has made large strides in achieving great performance in various downstream tasks. However, many state-of-the-art methods suffer from a number of impediments, which prevent them from realizing their full potential. For instance, contrastive methods typically require negative sampling, which is often computationally costly. While non-contrastive methods avoid this expensive step, most existing methods either rely on overly complex architectures or dataset-specific augmentations. In this paper, we ask: Can we borrow from classical unsupervised machine learning literature in order to overcome those obstacles? Guided by our key insight that the goal of distance-based clustering closely resembles that of contrastive learning: both attempt to pull representations of similar items together and dissimilar items apart. As a result, we propose CARL-G - a novel clustering-based framework for graph representation learning that uses a loss inspired by Cluster Validation Indices (CVIs), i.e., internal measures of cluster quality (no ground truth required). CARL-G is adaptable to different clustering methods and CVIs, and we show that with the right choice of clustering method and CVI, CARL-G outperforms node classification baselines on 4/5 datasets with up to a 79× training speedup compared to the best-performing baseline. CARL-G also performs at par or better than baselines in node clustering and similarity search tasks, training up to 1,500× faster than the best-performing baseline. Finally, we also provide theoretical foundations for the use of CVI-inspired losses in graph representation learning.

3 August 2025
Verified
Conference Paper
Open access
TZTong Zhao
Tong Zhao
YLYozen Liu
Yozen Liu
MKMatthew Kolodner
Matthew Kolodner
KMKyle Montemayor
Kyle Montemayor
EGElham Ghazizadeh
Elham Ghazizadeh
NSNeil Shah
Neil Shah

22 April 2025
Verified
Conference Paper
Open access
XWXinyi Wu
Xinyi Wu
DLDonald Loveland
Donald Loveland
RCRunjin Chen
Runjin Chen
YLYozen Liu
Yozen Liu
XCXin Chen
Xin Chen
TZTong Zhao
Tong Zhao

10 July 2024
Verified
Conference Paper
Open access
QFQixiang Fang
Qixiang Fang
ZZZhihan Zhou
Zhihan Zhou
FBFrancesco Barbieri
Francesco Barbieri
YLYozen Liu
Yozen Liu
LNLeonardo Neves
Leonardo Neves
RDRon Dotsch
Ron Dotsch
Learning general-purpose user representations based on user behavioral logs is an increasingly popular user modeling approach. It benefits from easily available, privacy-friendly yet expressive data, and does not require extensive re-tuning of the upstream user model for different downstream tasks. While this approach has shown promise in search engines and e-commerce applications, its fit for instant messaging platforms, a cornerstone of modern digital communication, remains largely uncharted. We explore this research gap using Snapchat data as a case study. Specifically, we implement a Transformer-based user model with customized training objectives and show that the model can produce high-quality user representations across a broad range of evaluation tasks, among which we introduce three new downstream tasks that concern pivotal topics in user research: user safety, engagement and churn. We also tackle the challenge of efficient extrapolation of long sequences at inference time, by applying a novel positional encoding method.