← Search

Li Kevin Wenliang

14 accepted papers

2025

Understanding Prompt Tuning and In-Context Learning via Meta-Learning

NeurIPS 2025spotlight

Prompting is one of the main ways to adapt a pretrained model to target tasks. Besides manually constructing prompts, many prompt optimization methods have been proposed in the literature. Method development is mainly empirically driven, with less emphasis on a conceptual understanding of prompting.…

Cited by 0SourcecodeScholar
2024

Amortized Planning with Large-Scale Transformers: A Case Study on Chess

NeurIPS 2024poster

This paper uses chess, a landmark planning problem in AI, to assess transformers’ performance on a planning task where memorization is futile — even at a large scale. To this end, we release ChessBench, a large-scale benchmark dataset of 10 million chess games with legal move and value annotations (…

2024

Distributional Bellman Operators over Mean Embeddings

ICML 2024poster

We propose a novel algorithmic framework for distributional reinforcement learning, based on learning finite-dimensional mean embeddings of return distributions. The framework reveals a wide variety of new algorithms for dynamic programming and temporal-difference algorithms that rely on the sketch…

2024

Language Modeling Is Compression

ICLR 2024poster

It has long been established that predictive models can be transformed into lossless compressors and vice versa. Incidentally, in recent years, the machine learning community has focused on training increasingly large and powerful self-supervised (language) models. Since these large language models…

2024

Learning Universal Predictors

ICML 2024poster

Meta-learning has emerged as a powerful approach to train neural networks to learn new tasks quickly from limited data by pre-training them on a broad set of tasks. But, what are the limits of meta-learning? In this work, we explore the potential of amortizing the most powerful universal predictor,…

2024

Near-Minimax-Optimal Distributional Reinforcement Learning with a Generative Model

NeurIPS 2024poster

We propose a new algorithm for model-based distributional reinforcement learning (RL), and prove that it is minimax-optimal for approximating return distributions in the generative model regime (up to logarithmic factors), the first result of this kind for any distributional RL algorithm. Our analys…

Cited by 3SourcePDFScholar
2023

Memory-Based Meta-Learning on Non-Stationary Distributions

ICML 2023poster

Memory-based meta-learning is a technique for approximating Bayes-optimal predictors. Under fairly general conditions, minimizing sequential prediction error, measured by the log loss, leads to implicit meta-learning. The goal of this work is to investigate how far this interpretation can be realize…

2023

Neural Networks and the Chomsky Hierarchy

ICLR 2023top-25%

Reliable generalization lies at the heart of safe ML and AI. However, understanding when and how neural networks generalize remains one of the most important unsolved problems in the field. In this work, we conduct an extensive empirical study (20'910 models, 15 tasks) to investigate whether insight…

2023

Self-Predictive Universal AI

NeurIPS 2023poster

Reinforcement Learning (RL) algorithms typically utilize learning and/or planning techniques to derive effective policies. The integration of both approaches has proven to be highly successful in addressing complex sequential decision-making challenges, as evidenced by algorithms such as AlphaZero a…

Cited by 5SourcePDFScholar
2021

GRIN: Generative Relation and Intention Network for Multi-agent Trajectory Prediction

NeurIPS 2021poster

Learning the distribution of future trajectories conditioned on the past is a crucial problem for understanding multi-agent systems. This is challenging because humans make decisions based on complex social relations and personal intents, resulting in highly complex uncertainties over trajectories.…

Cited by 50SourcePDFScholar
2021

On the Value of Infinite Gradients in Variational Autoencoder Models

NeurIPS 2021spotlight

A number of recent studies of continuous variational autoencoder (VAE) models have noted, either directly or indirectly, the tendency of various parameter gradients to drift towards infinity during training. Because such gradients could potentially contribute to numerical instabilities, and are oft…

Cited by 13SourcePDFScholar
2020

COT-GAN: Generating Sequential Data via Causal Optimal Transport

NeurIPS 2020poster

We introduce COT-GAN, an adversarial algorithm to train implicit generative models optimized for producing sequential data. The loss function of this algorithm is formulated using ideas from Causal Optimal Transport (COT), which combines classic optimal transport methods with an additional temporal…

2019

A neurally plausible model for online recognition and postdiction in a dynamical environment

NeurIPS 2019poster

Humans and other animals are frequently near-optimal in their ability to integrate noisy and ambiguous sensory data to form robust percepts---which are informed both by sensory evidence and by prior expectations about the structure of the environment. It is suggested that the brain does so using the…