activity
20162023
most citedT-BFA: Targeted Bit-Flip Adversarial Weight Attack

29 citations · 64 across the 12 of their papers we have counts for

collaborators

12 papers

cs.GT2023★ 4 cited

Rethinking Incentives in Recommender Systems: Are Monotone Rewards Always Beneficial?

Fan Yao, Chuanhao Li, Karthik Abinav Sankararaman +5

The past decade has witnessed the flourishing of a new profession as media content creators, who rely on revenue streams from online content recommendation platforms. The reward me…

cs.GT2023★ 3 cited

How Bad is Top- Recommendation under Competing Content Creators?

Fan Yao, Chuanhao Li, Denis Nekipelov +2

Content creators compete for exposure on recommendation platforms, and such strategic behavior leads to a dynamic shift over the content distribution. However, how the creators' co…

cs.LG2022

Learning from a Learning User for Optimal Recommendations

Fan Yao, Chuanhao Li, Denis Nekipelov +2

In real-world recommendation problems, especially those with a formidably large item space, users have to gradually learn to estimate the utility of any fresh recommendations from…

cs.CR2021

DeepSteal: Advanced Model Extractions Leveraging Efficient Weight Stealing in Memories

Adnan Siraj Rakin, Md Hafizul Islam Chowdhuryy, Fan Yao +1

Recent advancements of Deep Neural Networks (DNNs) have seen widespread deployment in multiple security-sensitive domains. The need of resource-intensive training and use of valuab…

cs.GT2021

Uncoupled Bandit Learning towards Rationalizability: Benchmarks, Barriers, and Algorithms

Jibang Wu, Haifeng Xu, Fan Yao

Under the uncoupled learning setup, the last-iterate convergence guarantee towards Nash equilibrium is shown to be impossible in many games. This work studies the last-iterate conv…

cs.LG2021★ 1 cited

Learning the Optimal Recommendation from Explorative Users

Fan Yao, Chuanhao Li, Denis Nekipelov +2

We propose a new problem setting to study the sequential interactions between a recommender system and a user. Instead of assuming the user is omniscient, static, and explicit, as…

cs.LG2021★ 3 cited

RA-BNN: Constructing Robust & Accurate Binary Neural Network to Simultaneously Defend Adversarial Bit-Flip Attack and Improve Accuracy

Adnan Siraj Rakin, Li Yang, Jingtao Li +5

Recently developed adversarial weight attack, a.k.a. bit-flip attack (BFA), has shown enormous success in compromising Deep Neural Network (DNN) performance with an extremely small…

cs.LG2021★ 2 cited

Reversible Action Design for Combinatorial Optimization with Reinforcement Learning

Fan Yao, Renqin Cai, Hongning Wang

Combinatorial optimization problem (COP) over graphs is a fundamental challenge in optimization. Reinforcement learning (RL) has recently emerged as a new framework to tackle these…

cs.LG2020★ 4 cited

PAC-Learning for Strategic Classification

Ravi Sundaram, Anil Vullikanti, Haifeng Xu +1

The study of strategic or adversarial manipulation of testing data to fool a classifier has attracted much recent attention. Most previous works have focused on two extreme situati…

cs.LG2020★ 29 cited

T-BFA: Targeted Bit-Flip Adversarial Weight Attack

Adnan Siraj Rakin, Zhezhi He, Jingtao Li +3

Traditional Deep Neural Network (DNN) security is mostly related to the well-known adversarial input example attack. Recently, another dimension of adversarial attack, namely, atta…

cs.CR2020★ 18 cited

DeepHammer: Depleting the Intelligence of Deep Neural Networks through Targeted Chain of Bit Flips

Fan Yao, Adnan Siraj Rakin, Deliang Fan

Security of machine learning is increasingly becoming a major concern due to the ubiquitous deployment of deep learning in many security-sensitive domains. Many prior studies have…

cs.LG2016

Greedy Step Averaging: A parameter-free stochastic optimization method

Xiatian Zhang, Fan Yao, Yongjun Tian

In this paper we present the greedy step averaging(GSA) method, a parameter-free stochastic optimization algorithm for a variety of machine learning problems. As a gradient-based o…