← Search

Tianqi Chen

15 accepted papers

2025

APE: Faster and Longer Context-Augmented Generation via Adaptive Parallel Encoding

ICLR 2025poster

Context-augmented generation (CAG) techniques, including RAG and ICL, require the efficient combination of multiple contexts to generate responses to user queries. Directly inputting these contexts as a sequence introduces a considerable computational burden by re-encoding the combined selection of…

2025

MagicDec: Breaking the Latency-Throughput Tradeoff for Long Context Generation with Speculative Decoding

ICLR 2025poster

Large Language Models (LLMs) have become more prevalent in long-context applications such as interactive chatbots, document analysis, and agent workflows, but it is challenging to serve long-context requests with low latency and high throughput. Speculative decoding (SD) is a widely used technique t…

2025

Multiverse: Your Language Models Secretly Decide How to Parallelize and Merge Generation

NeurIPS 2025spotlight

Autoregressive Large Language Models (AR-LLMs) frequently exhibit implicit parallelism in sequential generation. Inspired by this, we introduce Multiverse, a new generative model enabling natively parallel generation. Multiverse internalizes a MapReduce paradigm, generating automatically through thr…

Cited by 0SourceScholar
2025

Score Forgetting Distillation: A Swift, Data-Free Method for Machine Unlearning in Diffusion Models

ICLR 2025poster

The machine learning community is increasingly recognizing the importance of fostering trust and safety in modern generative AI (GenAI) models. We posit machine unlearning (MU) as a crucial foundation for developing safe, secure, and trustworthy GenAI models. Traditional MU methods often rely on str…

2024

A Dense Reward View on Aligning Text-to-Image Diffusion with Preference

ICML 2024poster

Aligning text-to-image diffusion model (T2I) with preference has been gaining increasing research attention. While prior works exist on directly optimizing T2I by preference data, these methods are developed under the bandit assumption of a latent reward on the entire diffusion reverse chain, while…

2023

ED-Batch: Efficient Automatic Batching of Dynamic Neural Networks via Learned Finite State Machines

ICML 2023poster

Batching has a fundamental influence on the efficiency of deep neural network (DNN) execution. However, for dynamic DNNs, efficient batching is particularly challenging as the dataflow graph varies per input instance. As a result, state-of-the-art frameworks use heuristics that result in suboptimal…

2023

Learning to Jump: Thinning and Thickening Latent Counts for Generative Modeling

ICML 2023poster

Learning to denoise has emerged as a prominent paradigm to design state-of-the-art deep generative models for natural images. How to use it to model the distributions of both continuous real-valued data and categorical data has been well studied in recently proposed diffusion models. However, it is…

2022

Tensor Program Optimization with Probabilistic Programs

NeurIPS 2022accept

Automatic optimization for tensor programs becomes increasingly important as we deploy deep learning in various environments, and efficient optimization relies on a rich search space and effective search. Most existing efforts adopt a search space which lacks the ability to efficiently enable domain…

Cited by 36SourcePDFScholar
2021

Dynamic Tensor Rematerialization

ICLR 2021spotlight

Checkpointing enables the training of deep learning models under restricted memory budgets by freeing intermediate activations from memory and recomputing them on demand. Current checkpointing techniques statically plan these recomputations offline and assume static computation graphs. We demonstrat…

2021

TenSet: A Large-scale Program Performance Dataset for Learned Tensor Compilers

NeurIPS 2021poster

Search-based tensor compilers can greatly accelerate the execution of machine learning models by generating high-performance tensor programs, such as matrix multiplications and convolutions. These compilers take a high-level mathematical expression as input and search for the fastest low-level imple…

Cited by 50SourcecodeScholar
2018

Learning to Optimize Tensor Programs

NeurIPS 2018spotlight

We introduce a learning-based framework to optimize tensor programs for deep learning workloads. Efficient implementations of tensor operators, such as matrix multiplication and high dimensional convolution are key enablers of effective deep learning systems. However, existing systems rely on manual…

Cited by 527SourcePDFScholar
2015

Efficient Second-Order Gradient Boosting for Conditional Random Fields

AISTATS 2015poster

Conditional random fields (CRFs) are an important class of models for accurate structured prediction, but effective design of the feature functions is a major challenge when applying CRF models to real world data. Gradient boosting, which is used to automatically induce and select feature functions,…

Cited by 61SourcePDFScholar