Bin Ren

Bin Ren

Auto-generated profile, based on publicly available information

Bin Ren

College of William & Mary, Williamsburg, USA

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
3 November 2022
Verified
Book Chapter
Closed access
PDF file
ZKZhenglun Kong
Zhenglun Kong
PDPeiyan Dong
Peiyan Dong
XMXiaolong Ma
Xiaolong Ma
XMXin Meng
Xin Meng
WNWei Niu
Wei Niu
YWYanzhi Wang
Yanzhi Wang

9 November 2022
Verified
Book Chapter
Closed access
PDF file
YWYushu Wu
Yushu Wu
YGYifan Gong
Yifan Gong
PZPu Zhao
Pu Zhao
YLYanyu Li
Yanyu Li
ZZZheng Zhan
Zheng Zhan
YWYanzhi Wang
Yanzhi Wang

22 February 2020
Verified
Conference Paper
Open access
YCYu Chen
Yu Chen
IPIvy B. Peng
Ivy B. Peng
ZPZhen Peng
Zhen Peng
XLXu Liu
Xu Liu
BRBin Ren
Bin Ren

1 November 2018
Verified
Conference Paper
Open access
ZPZhen Peng
Zhen Peng
APAlexander Powell
Alexander Powell
BWBo Wu
Bo Wu
TBTekin Bicer
Tekin Bicer
BRBin Ren
Bin Ren

27 April 2024
Verified
Conference Paper
Open access
WNWei Niu
Wei Niu
MSMusfiqur Rahman Sanim
Musfiqur Rahman Sanim
ZSZhihao Shu
Zhihao Shu
JGJiexiong Guan
Jiexiong Guan
XSXipeng Shen
Xipeng Shen
BRBin Ren
Bin Ren
This work is motivated by recent developments in Deep Neural Networks, particularly the Transformer architectures underlying applications such as ChatGPT, and the need for performing inference on mobile devices. Focusing on emerging transformers (specifically the ones with computationally efficient Swin-like architectures) and large models (e.g., Stable Diffusion and LLMs) based on transformers, we observe that layout transformations between the computational operators cause a significant slowdown in these applications. This paper presents SmartMem, a comprehensive framework for eliminating most layout transformations, with the idea that multiple operators can use the same tensor layout through careful choice of layout and implementation of operations. Our approach is based on classifying the operators into four groups, and considering combinations of producer-consumer edges between the operators. We develop a set of methods for searching such layouts. Another component of our work is developing efficient memory layouts for 2.5 dimensional memory commonly seen in mobile devices. Our experimental results show that SmartMem outperforms 5 state-of-the-art DNN execution frameworks on mobile devices across 18 varied neural networks, including CNNs, Transformers with both local and global attention, as well as LLMs. In particular, compared to DNNFusion, SmartMem achieves an average speedup of 2.8×, and outperforms TVM and MNN with speedups of 6.9× and 7.9×, respectively, on average.

7 March 2024 in ACM Transactions on Recommender Systems
Verified
Journal Article
Open access
DLDong Li
Dong Li
RJRuoming Jin
Ruoming Jin
ZLZhenming Liu
Zhenming Liu
BRBin Ren
Bin Ren
JGJing Gao
Jing Gao
ZLZhi Liu
Zhi Liu
Personalized recommender systems play a crucial role in modern society, especially in e-commerce, news, and ads areas. Correctly evaluating and comparing candidate recommendation models is as essential as constructing ones. The common offline evaluation strategy is holding out some user-interacted items from training data and evaluating the performance of recommendation models based on how many items they can retrieve. Specifically, for any hold-out item or so-called target item for a user, the recommendation models try to predict the probability that the user would interact with the item and rank it among overall items, which is called global evaluation . Intuitively, a good recommendation model would assign high probabilities to such hold-out/target items. Based on the specific ranks, some metrics like Recall@K and NDCG@K can be calculated to further quantify the quality of the recommender model. Instead of ranking the target items among all items, Koren first proposed to rank them among a small sampled set of items , then quantified the performance of the models, which is called sampling evaluation . Ever since then, there has been a large amount of work adopting sampling evaluation due to its efficiency and frugality. In recent work, Rendle and Krichene argued that the sampling evaluation is “inconsistent” with respect to a global evaluation in terms of offline top- K metrics. In this work, we first investigate the “inconsistent” phenomenon by taking a glance at the connections between sampling evaluation and global evaluation. We reveal the approximately linear relationship between sampling with respect to its global counterpart in terms of the top- K Recall metric. Second, we propose a new statistical perspective of the sampling evaluation—to estimate the global rank distribution of the entire population. After the estimated rank distribution is obtained, the approximation of the global metric can be further derived. Third, we extend the work of Krichene and Rendle, directly optimizing the error with ground truth, providing not only a comprehensive empirical study but also a rigorous theoretical understanding of the proposed metric estimators. To address the “blind spot” issue, where accurately estimating metrics for small top- K values in sampling evaluation is challenging, we propose a novel adaptive sampling method that generalizes the expectation-maximization algorithm to this setting. Last but not least, we also study the user sampling evaluation effect. This series of works outlines a clear roadmap for sampling evaluation and establishes a foundational theoretical framework. Extensive empirical studies validate the reliability of the sampling methods presented.