Yifang Chen
14 papers · 2019–2025 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+5 more ↓ Show less ↑
π Renaissance Researcher (6) πΊοΈ Taxonomy Completionist (30) π Interdisciplinary Bridge π Conference Polyglot (5) π Academic Marathon (6)
π§
Keyword Pioneer
π
Cross-Pollinator
(14)
ποΈ
Keyword Collector
(71)
π
Century Club
(14)
π₯
Unstoppable
(7)
Conferences
ICML (6)
NIPS (4)
COLT (2)
ACL (1)
UAI (1)
Top co-authors
Keywords
active learning
(5)
reinforcement learning
(3)
representation learning
(3)
contextual bandit
(3)
multi-task learning
(3)
dynamic regret
(2)
regret bound
(2)
linear mdp
(2)
sample complexity
(2)
pac learning
(1)
multimodal learning
(1)
preference learning
(1)
adversarial learning
(1)
transfer learning
(1)
corruption robustness
(1)
binary classification
(1)
robust reinforcement learning
(1)
language model alignment
(1)
episodic learning
(1)
model merging
(1)
Papers
Fundamental Limits of Visual Autoregressive Transformers: Universal Approximation Abilities
ICML 2025
CLIPLoss and Norm-Based Data Selection Methods for Multimodal Contrastive Learning
NIPS 2024
Decoding-Time Language Model Alignment with Multiple Objectives
NIPS 2024
An Experimental Design Framework for Label-Efficient Supervised Finetuning of Large Language Models
ACL 2024
Improved Active Multi-Task Representation Learning via Lasso
ICML 2023
Active representation learning for general task space with applications in robotics
NIPS 2023
Active Multi-Task Representation Learning
ICML 2022
Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes
ICML 2022
First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach
ICML 2022
Corruption Robust Active Learning
NIPS 2021
Improved Corruption Robust Algorithms for Episodic Reinforcement Learning
ICML 2021
Fair Contextual Multi-Armed Bandits: Theory and Experiments
UAI 2020
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal and Parameter-free
COLT 2019
Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information
COLT 2019