activity
20182025
most citedA2BCD: An Asynchronous Accelerated Block Coordinate Descent Algorithm With Optimal Complexity

8 citations · 19 across the 7 of their papers we have counts for

collaborators

7 papers

cs.LG2025

RecoMind: A Reinforcement Learning Framework for Optimizing In-Session User Satisfaction in Recommendation Systems

Mehdi Ben Ayed, Fei Feng, Jay Adams +3

Existing web-scale recommendation systems commonly use supervised learning methods that prioritize immediate user feedback. Although reinforcement learning (RL) offers a solution t…

cs.LG2021★ 2 cited

Provably Correct Optimization and Exploration with Non-linear Policies

Fei Feng, Wotao Yin, Alekh Agarwal +1

Policy optimization methods remain a powerful workhorse in empirical Reinforcement Learning (RL), with a focus on neural policies that can easily reason over complex and continuous…

cs.LG2020★ 2 cited

Provably Efficient Exploration for Reinforcement Learning Using Unsupervised Learning

Fei Feng, Ruosong Wang, Wotao Yin +2

Motivated by the prevailing paradigm of using unsupervised learning for efficient exploration in reinforcement learning (RL) problems [tang2017exploration,bellemare2016unifying], w…

cs.LG2019★ 6 cited

How Does an Approximate Model Help in Reinforcement Learning?

Fei Feng, Wotao Yin, Lin F. Yang

One of the key approaches to save samples in reinforcement learning (RL) is to use knowledge from an approximate model such as its simulator. However, how much does an approximate…

math.OC2019

Acceleration of SVRG and Katyusha X by Inexact Preconditioning

Yanli Liu, Fei Feng, Wotao Yin

Empirical risk minimization is an important class of optimization problems with many popular machine learning applications, and stochastic variance reduction methods are popular ch…

math.OC2018★ 1 cited

AsyncQVI: Asynchronous-Parallel Q-Value Iteration for Discounted Markov Decision Processes with Near-Optimal Sample Complexity

Yibo Zeng, Fei Feng, Wotao Yin

In this paper, we propose AsyncQVI, an asynchronous-parallel Q-value iteration for discounted Markov decision processes whose transition and reward can only be sampled through a ge…

math.OC2018★ 8 cited

A2BCD: An Asynchronous Accelerated Block Coordinate Descent Algorithm With Optimal Complexity

Robert Hannah, Fei Feng, Wotao Yin

In this paper, we propose the Asynchronous Accelerated Nonuniform Randomized Block Coordinate Descent algorithm (A2BCD), the first asynchronous Nesterov-accelerated algorithm that…