← Search

Yifang Chen

14 accepted papers

2025

Fundamental Limits of Visual Autoregressive Transformers: Universal Approximation Abilities

ICML 2025poster

We investigate the fundamental limits of transformer-based foundation models, extending our analysis to include Visual Autoregressive (VAR) transformers. VAR represents a big step toward generating images using a novel, scalable, coarse-to-fine ``next-scale prediction'' framework. These models set a…

Cited by 0SourcePDFScholar
2024

An Experimental Design Framework for Label-Efficient Supervised Finetuning of Large Language Models

ACL 2024findings

Supervised finetuning (SFT) on instruction datasets has played a crucial role in achieving the remarkable zero-shot generalization capabilities observed in modern large language models (LLMs). However, the annotation efforts required to produce high quality responses for instructions are becoming pr…

Cited by 17SourcePDFScholar
2024

CLIPLoss and Norm-Based Data Selection Methods for Multimodal Contrastive Learning

NeurIPS 2024spotlight

Data selection has emerged as a core issue for large-scale visual-language model pretaining (e.g., CLIP), particularly with noisy web-curated datasets. Three main data selection approaches are: (1) leveraging external non-CLIP models to aid data selection, (2) training new CLIP-style embedding model…

Cited by 6SourcePDFScholar
2024

Decoding-Time Language Model Alignment with Multiple Objectives

NeurIPS 2024poster

Aligning language models (LMs) to human preferences has emerged as a critical pursuit, enabling these models to better serve diverse user needs. Existing methods primarily focus on optimizing LMs for a single reward function, limiting their adaptability to varied objectives. Here, we propose $\text…

2023

Active representation learning for general task space with applications in robotics

NeurIPS 2023poster

Representation learning based on multi-task pretraining has become a powerful approach in many domains. In particular, task-aware representation learning aims to learn an optimal representation for a specific target task by sampling data from a set of source tasks, while task-agnostic representation…

Cited by 4SourcePDFScholar
2023

Double Compression Detection Based on the De-Blocking Filtering of HEVC Videos

ICASSP 2023accepted

Instead of detecting whether the whole video sequence is double compressed, a frame-level detection result can provide more precise information for video forensic tasks, such as locate tamper point and restore compression history, et al. But the research on frame-level double compression detection i…

Cited by 0SourceScholar
2023

Improved Active Multi-Task Representation Learning via Lasso

ICML 2023poster

To leverage the copious amount of data from source tasks and overcome the scarcity of the target task samples, representation learning based on multi-task pretraining has become a standard approach in many applications. However, up until now, most existing works design a source task selection strate…

Cited by 15SourcePDFScholar
2022

First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach

ICML 2022oral

Obtaining first-order regret bounds—regret bounds scaling not as the worst-case but with some measure of the performance of the optimal policy on a given instance—is a core question in sequential decision-making. While such bounds exist in many settings, they have proven elusive in reinforcement lea…

Cited by 43SourcePDFScholar
2022

Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes

ICML 2022spotlight

Reward-free reinforcement learning (RL) considers the setting where the agent does not have access to a reward function during exploration, but must propose a near-optimal policy for an arbitrary reward function revealed only after exploring. In the the tabular setting, it is well known that this is…

Cited by 70SourcePDFScholar
2021

Improved Corruption Robust Algorithms for Episodic Reinforcement Learning

ICML 2021spotlight

We study episodic reinforcement learning under unknown adversarial corruptions in both the rewards and the transition probabilities of the underlying system. We propose new algorithms which, compared to the existing results in \cite{lykouris2020corruption}, achieve strictly better regret bounds in t…

Cited by 33SourcePDFScholar
2020

Fair Contextual Multi-Armed Bandits: Theory and Experiments

UAI 2020poster

When an AI system interacts with multiple users, it frequently needs to make allocation decisions. For instance, a virtual agent decides whom to pay attention to in a group, or a factory robot selects a worker to deliver a part.Demonstrating fairness in decision making is essential for such systems…

Cited by 79SourcePDFScholar
2018

A Rotation-Invariant Convolutional Neural Network for Image Enhancement Forensics

ICASSP 2018accepted

Many proposed complex convolutional neural network (CNN) models in image forensics are with a large number of parameters, requiring a huge number of training data and having the risk of being overfitting. Considering the desired rotation invariance in the detection of some specific image manipulatio…

Cited by 0SourceScholar