activity
20212023
most citedImproved Fine-Tuning by Better Leveraging Pre-Training Data

24 citations · 50 across the 16 of their papers we have counts for

collaborators

16 papers

cs.LG2023★ 1 cited

Supported Trust Region Optimization for Offline Reinforcement Learning

Yixiu Mao, Hongchang Zhang, Chen Chen +2

Offline reinforcement learning suffers from the out-of-distribution issue and extrapolation error. Most policy constraint methods regularize the density of the trained policy towar…

cs.AI2023★ 2 cited

Counterfactual Conservative Q Learning for Offline Multi-agent Reinforcement Learning

Jianzhun Shao, Yun Qu, Chen Chen +2

Offline multi-agent reinforcement learning is challenging due to the coupling effect of both distribution shift issue common in offline setting and the high dimension issue common…

cs.LG2023★ 2 cited

DIVERSIFY: A General Framework for Time Series Out-of-distribution Detection and Generalization

Wang Lu, Jindong Wang, Xinwei Sun +4

Time series remains one of the most challenging modalities in machine learning research. The out-of-distribution (OOD) detection and generalization on time series tend to suffer du…

cs.LG2023★ 1 cited

TWINS: A Fine-Tuning Framework for Improved Transferability of Adversarial Robustness and Generalization

Ziquan Liu, Yi Xu, Xiangyang Ji +1

Recent years have seen the ever-increasing importance of pre-trained models and their downstream training in deep learning research and applications. At the same time, the defense…

cs.CV2022

Beyond Instance Discrimination: Relation-aware Contrastive Self-supervised Learning

Yifei Zhang, Chang Liu, Yu Zhou +3

Contrastive self-supervised learning (CSL) based on instance discrimination typically attracts positive samples while repelling negatives to learn representations with pre-defined…

cs.LG2022★ 1 cited

Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning

Zihan Zhang, Yuhang Jiang, Yuan Zhou +1

In this paper, we study the episodic reinforcement learning (RL) problem modeled by finite-horizon Markov Decision Processes (MDPs) with constraint on the number of batches. The mu…

cs.CV2022★ 2 cited

RBP-Pose: Residual Bounding Box Projection for Category-Level Pose Estimation

Ruida Zhang, Yan Di, Zhiqiang Lou +3

Category-level object pose estimation aims to predict the 6D pose as well as the 3D metric size of arbitrary objects from a known set of categories. Recent methods harness shape pr…

cs.RO2022

6D Robotic Assembly Based on RGB-only Object Pose Estimation

Bowen Fu, Sek Kun Leong, Xiaocong Lian +1

Vision-based robotic assembly is a crucial yet challenging task as the interaction with multiple objects requires high levels of precision. In this paper, we propose an integrated…

cs.CV2022★ 2 cited

SSP-Pose: Symmetry-Aware Shape Prior Deformation for Direct Category-Level Object Pose Estimation

Ruida Zhang, Yan Di, Fabian Manhardt +2

Category-level pose estimation is a challenging problem due to intra-class shape variations. Recent methods deform pre-computed shape priors to map the observed point cloud into th…

cs.LG2022★ 1 cited

Prototype-Anchored Learning for Learning with Imperfect Annotations

Xiong Zhou, Xianming Liu, Deming Zhai +3

The success of deep neural networks greatly relies on the availability of large amounts of high-quality annotated data, which however are difficult or expensive to obtain. The resu…

cs.CV2022★ 3 cited

Learning Towards the Largest Margins

Xiong Zhou, Xianming Liu, Deming Zhai +3

One of the main challenges for feature representation in deep learning-based classification is the design of appropriate loss functions that exhibit strong discriminative power. Th…

cs.CV2022★ 6 cited

An Empirical Study on Distribution Shift Robustness From the Perspective of Pre-Training and Data Augmentation

Ziquan Liu, Yi Xu, Yuanhong Xu +5

The performance of machine learning models under distribution shift has been the focus of the community in recent years. Most of current methods have been proposed to improve the r…

cs.LG2022★ 2 cited

Horizon-Free Reinforcement Learning in Polynomial Time: the Power of Stationary Policies

Zihan Zhang, Xiangyang Ji, Simon S. Du

This paper gives the first polynomial-time algorithm for tabular Markov Decision Processes (MDP) that enjoys a regret bound \emph{independent on the planning horizon}. Specifically…

cs.CV2021★ 24 cited

Improved Fine-Tuning by Better Leveraging Pre-Training Data

Ziquan Liu, Yi Xu, Yuanhong Xu +5

As a dominant paradigm, fine-tuning a pre-trained model on the target data is widely used in many deep learning applications, especially for small data sets. However, recent studie…

cs.LG2021★ 3 cited

Wasserstein Unsupervised Reinforcement Learning

Shuncheng He, Yuhang Jiang, Hongchang Zhang +2

Unsupervised reinforcement learning aims to train agents to learn a handful of policies or skills in environments without external reward. These pre-trained policies can accelerate…

cs.LG2021

Improved Variance-Aware Confidence Sets for Linear Bandits and Linear Mixture MDP

Zihan Zhang, Jiaqi Yang, Xiangyang Ji +1

This paper presents new \emph{variance-aware} confidence sets for linear bandits and linear mixture Markov Decision Processes (MDPs). With the new confidence sets, we obtain the fo…