Ruofei Zhang

Ruofei Zhang

Auto-generated profile, based on publicly available information

Ruofei Zhang

Apple Inc

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
21 August 2011
Verified
Conference Paper
Open access
PDF file
YCYing Cui
Ying Cui
RZRuofei Zhang
Ruofei Zhang
WLWei Li
Wei Li
JMJianchang Mao
Jianchang Mao
Display advertising has been a significant source of revenue for publishers and ad networks in online advertising ecosystem. One important business model in online display advertising is Ad Exchange marketplace, also called non-guaranteed delivery (NGD), in which advertisers buy targeted page views and audiences on a spot market through real-time auction. In this paper, we describe a bid landscape forecasting system in NGD marketplace for any advertiser campaign specified by a variety of targeting attributes. In the system, the impressions that satisfy the campaign targeting attributes are partitioned into multiple mutually exclusive samples. Each sample is one unique combination of quantified attribute values. We develop a divide-and-conquer approach that breaks down the campaign-level forecasting problem. First, utilizing a novel star-tree data structure, we forecast the bid for each sample using non-linear regression by gradient boosting decision trees. Then we employ a mixture-of-log-normal model to generate campaign-level bid distribution based on the sample-level forecasted distributions. The experiment results of a system developed with our approach show that it can accurately forecast the bid distributions for various campaigns running on the world's largest NGD advertising exchange system, outperforming two baseline methods in term of forecasting errors.

19 July 2018
Verified
Conference Paper
Open access
TYTing Ye
Ting Ye
HZHucheng Zhou
Hucheng Zhou
WZWill Y. Zou
Will Y. Zou
BGBin Gao
Bin Gao
RZRuofei Zhang
Ruofei Zhang

1 January 2020
Verified
Conference Paper
Open access
PDF file
ZFZhihao Fan
Zhihao Fan
YGYeyun Gong
Yeyun Gong
ZWZhongyu Wei
Zhongyu Wei
SWSiyuan Wang
Siyuan Wang
YHYameng Huang
Yameng Huang
RZRuofei Zhang
Ruofei Zhang
Zhihao Fan, Yeyun Gong, Zhongyu Wei, Siyuan Wang, Yameng Huang, Jian Jiao, Xuanjing Huang, Nan Duan, Ruofei Zhang. Proceedings of the 28th International Conference on Computational Linguistics. 2020.

28 October 2024
Verified
Conference Paper
Open access
ZZZiyang Zhou
Ziyang Zhou
PWPinghui Wang
Pinghui Wang
ZLZi Liang
Zi Liang
RZRuofei Zhang
Ruofei Zhang
HBHaitao Bai
Haitao Bai
Deep neural networks are widely used in retrieval systems. However, they are notoriously vulnerable to attack. Among the various forms of adversarial attacks, the patch attack is one of the most threatening forms. This type of attack can introduce cognitive biases into the retrieval system by inserting deceptive patches into images. Despite the seriousness of this threat, there are still no well-established solutions in image retrieval systems. In this paper, we propose the Pre-denosing Augmented Image Retrieval (PAIR) model, a new approach designed to protect image retrieval systems against adversarial patch attacks. The core strategy of PAIR is to dynamically and randomly reconstruct entire images based on their semantic content. This purifies well-designed patch attacks while preserving the semantic integrity of the images. Furthermore, we present a novel training strategy that incorporates a semantic discriminator. This discriminator significantly improves PAIR's ability to capture real semantics and reconstruct images. Experiments show that PAIR significantly outperforms existing defense methods. It effectively reduces the success rate of two state-of-the-art patch attack methods to below 5%, achieving a 14% improvement over current leading methods. Moreover, in defending against global perturbation attacks, PAIR also achieves competitive results.

16 July 2013 in arXiv
Verified
Preprint
Open access
PDF file
AJAli Jalali
Ali Jalali
JAJavad Azimi
Javad Azimi
XFXiaoli Fern
Xiaoli Fern
RZRuofei Zhang
Ruofei Zhang
The problem of optimizing unknown costly-to-evaluate functions has been studied for a long time in the context of Bayesian Optimization. Algorithms in this field aim to find the optimizer of the function by asking only a few function evaluations at locations carefully selected based on a posterior model. In this paper, we assume the unknown function is Lipschitz continuous. Leveraging the Lipschitz property, we propose an algorithm with a distinct exploration phase followed by an exploitation phase. The exploration phase aims to select samples that shrink the search space as much as possible. The exploitation phase then focuses on the reduced search space and selects samples closest to the optimizer. Considering the Expected Improvement (EI) as a baseline, we empirically show that the proposed algorithm significantly outperforms EI.

1 January 2022
Verified
Conference Paper
Open access
PDF file
HLHaonan Li
Haonan Li
YHYameng Huang
Yameng Huang
YGYeyun Gong
Yeyun Gong
JJJian Jiao
Jian Jiao
RZRuofei Zhang
Ruofei Zhang
NDNan Duan
Nan Duan
Haonan Li, Yameng Huang, Yeyun Gong, Jian Jiao, Ruofei Zhang, Timothy Baldwin, Nan Duan. Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies: Industry Track. 2022.