← Search

Bingbin Liu

14 accepted papers

2026

In Good GRACES: Principled Teacher Selection for Knowledge Distillation

ICLR 2026poster

Knowledge distillation is an efficient strategy to use data generated by large teacher language models to train smaller “capable” student models, but selecting the optimal teacher for a specific student-task combination requires expensive trial-and-error. We propose a lightweight score called GRACE…

Cited by 0SourceScholar
2025

Progressive distillation induces an implicit curriculum

ICLR 2025oral

Knowledge distillation leverages a teacher model to improve the training of a student model. A persistent challenge is that a better teacher does not always yield a better student, to which a common mitigation is to use additional supervision from several “intermediate” teachers. One empirically val…

Cited by 2SourcePDFScholar
2024

Understanding Augmentation-based Self-Supervised Representation Learning via RKHS Approximation and Regression

ICLR 2024spotlight

Data augmentation is critical to the empirical success of modern self-supervised representation learning, such as contrastive learning and masked language modeling. However, a theoretical understanding of the exact role of the augmentation remains limited. Recent work has built the connection betwee…

Cited by 16SourcePDFScholar
2023

Exposing Attention Glitches with Flip-Flop Language Modeling

NeurIPS 2023spotlight

Why do large language models sometimes output factual inaccuracies and exhibit erroneous reasoning? The brittleness of these models, particularly when executing long chains of reasoning, currently seems to be an inevitable price to pay for their advanced capabilities of coherently synthesizing knowl…

Cited by 51SourcePDFScholar
2023

Transformers Learn Shortcuts to Automata

ICLR 2023top-5%

Algorithmic reasoning requires capabilities which are most naturally understood through recurrent models of computation, like the Turing machine. However, Transformer models, while lacking recurrence, are able to perform such reasoning using far fewer layers than the number of reasoning steps. This…

Cited by 213SourcePDFScholar
2023

Transformers are uninterpretable with myopic methods: a case study with bounded Dyck grammars

NeurIPS 2023poster

Transformer interpretability aims to understand the algorithm implemented by a learned Transformer by examining various aspects of the model, such as the weight matrices or the attention patterns. In this work, through a combination of theoretical results and carefully controlled experiments on synt…

Cited by 23SourcePDFScholar
2022

Analyzing and Improving the Optimization Landscape of Noise-Contrastive Estimation

ICLR 2022spotlight

Noise-contrastive estimation (NCE) is a statistically consistent method for learning unnormalized probabilistic models. It has been empirically observed that the choice of the noise distribution is crucial for NCE’s performance. However, such observation has never been made formal or quantitative. I…

Cited by 22SourcePDFScholar
2022

Masked Prediction: A Parameter Identifiability View

NeurIPS 2022accept

The vast majority of work in self-supervised learning have focused on assessing recovered features by a chosen set of downstream tasks. While there are several commonly used benchmark datasets, this lens of feature learning requires assumptions on the downstream tasks which are not inherent to the d…

Cited by 9SourcePDFScholar
2021

Contrastive learning of strong-mixing continuous-time stochastic processes

AISTATS 2021poster

Contrastive learning is a family of self-supervised methods where a model is trained to solve a classification task constructed from unlabeled data. It has recently emerged as one of the leading learning paradigms in the absence of labels across many different domains (e.g. brain imaging, text, imag…

Cited by 6SourcePDFScholar
2020

Spatiotemporal Relationship Reasoning for Pedestrian Intent Prediction

RA-L 2020

Reasoning over visual data is a desirable capability for robotics and vision-based applications. Such reasoning enables forecasting the next events or actions in videos. In recent years, various models have been developed based on convolution operations for prediction or forecasting, but they lack t

Cited by 186SourceScholar
2018

Learning to Decompose and Disentangle Representations for Video Prediction

NeurIPS 2018poster

Our goal is to predict future video frames given a sequence of input frames. Despite large amounts of video data, this remains a challenging task because of the high-dimensionality of video frames. We address this challenge by proposing the Decompositional Disentangled Predictive Auto-Encoder (DDPAE…

2018

Temporal Modular Networks for Retrieving Complex Compositional Activities in Videos

ECCV 2018poster

A major challenge in computer vision is scaling activity understanding to the long tail of complex activities without requiring collecting large quantities of data for new actions. The task of video retrieval using natural language descriptions seeks to address this through rich, unconstrained super…

Cited by 94SourcePDFScholar