597 citations · 2.9k across the 64 of their papers we have counts for
65 papers
Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs
Han Zhong, Jiayi Huang, Lin F. Yang +1
Despite a large amount of effort in dealing with heavy-tailed error in machine learning, little is known when moments of the error can become non-existential: the random noise …
Non-convex Distributionally Robust Optimization: Non-asymptotic Analysis
Jikai Jin, Bohang Zhang, Haiyang Wang +1
Distributionally robust optimization (DRO) is a widely-used approach to learn models that are robust against distribution shift. Compared with the standard optimization setting, th…
Boosting the Certified Robustness of L-infinity Distance Nets
Bohang Zhang, Du Jiang, Di He +1
Recently, Zhang et al. (2021) developed a new neural network architecture based on -distance functions, which naturally possesses certified robustness by…
Near-Optimal Reward-Free Exploration for Linear Mixture MDPs with Plug-in Solver
Xiaoyu Chen, Jiachen Hu, Lin F. Yang +1
Although model-based reinforcement learning (RL) approaches are considered more sample efficient, existing algorithms are usually relying on sophisticated planning algorithm to cou…
Multi-stage Optimization based Adversarial Training
Xiaosen Wang, Chuanbiao Song, Liwei Wang +1
In the field of adversarial robustness, there is a common practice that adopts the single-step adversarial training for quickly developing adversarially robust models. However, the…
Stable, Fast and Accurate: Kernelized Attention with Relative Positional Encoding
Shengjie Luo, Shanda Li, Tianle Cai +6
The attention module, which is a crucial component in Transformer, cannot scale efficiently to long sequences due to its quadratic complexity. Many works focus on approximating the…