activity
20122024
most citedChain-of-Thought Prompting Elicits Reasoning in Large Language Models

4.3k citations · 6.9k across the 51 of their papers we have counts for

collaborators
Showing 2022Show all

10 papers · 1 filter

cs.LG2022★ 7 cited

Score-based Continuous-time Discrete Diffusion Models

Haoran Sun, Lijun Yu, Bo Dai +2

Score-based modeling through stochastic differential equations (SDEs) has provided a new perspective on diffusion models, and demonstrated superior performance on continuous data.…

cs.LG2022★ 86 cited

What learning algorithm is in-context learning? Investigations with linear models

Ekin Akyürek, Dale Schuurmans, Jacob Andreas +2

Neural sequence models, especially transformers, exhibit a remarkable capacity for in-context learning. They can construct new predictors from sequences of labeled examples $(x, f(…

cs.LG2022

Optimal Scaling for Locally Balanced Proposals in Discrete Spaces

Haoran Sun, Hanjun Dai, Dale Schuurmans

Optimal scaling has been well studied for Metropolis-Hastings (M-H) algorithms in continuous spaces, but a similar understanding has been lacking in discrete spaces. Recently, a fa…

cs.LG2022★ 1 cited

Spectral Decomposition Representation for Reinforcement Learning

Tongzheng Ren, Tianjun Zhang, Lisa Lee +3

Representation learning often plays a critical role in reinforcement learning by managing the curse of dimensionality. A representative class of algorithms exploits a spectral deco…

cs.CL2022★ 29 cited

Rationale-Augmented Ensembles in Language Models

Xuezhi Wang, Jason Wei, Dale Schuurmans +3

Recent research has shown that rationales, or step-by-step chains of thought, can be used to improve performance in multi-step reasoning tasks. We reconsider rationale-augmented pr…

cs.LG2022★ 2 cited

Making Linear MDPs Practical via Contrastive Representation Learning

Tianjun Zhang, Tongzheng Ren, Mengjiao Yang +3

It is common to address the curse of dimensionality in Markov decision processes (MDPs) by exploiting low-rank representations. This motivates much of the recent theoretical study…

cs.AI2022★ 324 cited

Least-to-Most Prompting Enables Complex Reasoning in Large Language Models

Denny Zhou, Nathanael Schärli, Le Hou +8

Chain-of-thought prompting has demonstrated remarkable performance on various natural language reasoning tasks. However, it tends to perform poorly on tasks which requires solving…

cs.CL2022★ 721 cited

Self-Consistency Improves Chain of Thought Reasoning in Language Models

Xuezhi Wang, Jason Wei, Dale Schuurmans +5

Chain-of-thought prompting combined with pre-trained large language models has achieved encouraging results on complex reasoning tasks. In this paper, we propose a new decoding str…

math.OC2022★ 2 cited

On the Global Convergence Rates of Decentralized Softmax Gradient Play in Markov Potential Games

Runyu Zhang, Jincheng Mei, Bo Dai +2

Softmax policy gradient is a popular algorithm for policy optimization in single-agent reinforcement learning, particularly since projection is not needed for each gradient update.…

cs.CL2022★ 4.3k cited

Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

Jason Wei, Xuezhi Wang, Dale Schuurmans +6

We explore how generating a chain of thought -- a series of intermediate reasoning steps -- significantly improves the ability of large language models to perform complex reasoning…