← Search

Yingjie Fei

7 accepted papers

2023

Don’t Retrain, Just Rewrite: Countering Adversarial Perturbations by Rewriting Text

ACL 2023long

Can language models transform inputs to protect text classifiers against adversarial attacks? In this work, we present ATINTER, a model that intercepts and learns to rewrite adversarial inputs to make them non-adversarial for a downstream text classifier. Our experiments on four datasets and five at…

2021

Exponential Bellman Equation and Improved Regret Bounds for Risk-Sensitive Reinforcement Learning

NeurIPS 2021poster

We study risk-sensitive reinforcement learning (RL) based on the entropic risk measure. Although existing works have established non-asymptotic regret guarantees for this problem, they leave open an exponential gap between the upper and lower bounds. We identify the deficiencies in existing algorith…

Cited by 72SourcePDFScholar
2021

Risk-Sensitive Reinforcement Learning with Function Approximation: A Debiasing Approach

ICML 2021oral

We study function approximation for episodic reinforcement learning with entropic risk measure. We first propose an algorithm with linear function approximation. Compared to existing algorithms, which suffer from improper regularization and regression biases, this algorithm features debiasing transf…

Cited by 57SourcePDFScholar
2020

Dynamic Regret of Policy Optimization in Non-Stationary Environments

NeurIPS 2020poster

We consider reinforcement learning (RL) in episodic MDPs with adversarial full-information reward feedback and unknown fixed transition kernels. We propose two model-free policy optimization algorithms, POWER and POWER++, and establish guarantees for their dynamic regret. Compared with the c…

Cited by 63SourcePDFScholar
2020

Risk-Sensitive Reinforcement Learning: Near-Optimal Risk-Sample Tradeoff in Regret

NeurIPS 2020spotlight

We study risk-sensitive reinforcement learning in episodic Markov decision processes with unknown transition kernels, where the goal is to optimize the total reward under the risk measure of exponential utility. We propose two provably efficient model-free algorithms, Risk-Sensitive Value Iteration…

Cited by 84SourcePDFScholar
2020

Spectral Frank-Wolfe Algorithm: Strict Complementarity and Linear Convergence

ICML 2020poster

We develop a novel variant of the classical Frank-Wolfe algorithm, which we call spectral Frank-Wolfe, for convex optimization over a spectrahedron. The spectral Frank-Wolfe algorithm has a novel ingredient: it computes a few eigenvectors of the gradient and solves a small-scale subproblem in each i…

Cited by 20SourcePDFScholar