activity
20172026
most citedPhi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone

163 citations · 375 across the 36 of their papers we have counts for

collaborators
Showing cs.LGShow all

26 papers · 1 filter

cs.LG2025

EMA Without the Lag: Bias-Corrected Iterate Averaging Schemes

Adam Block, Cyril Zhang

Stochasticity in language model fine-tuning, often caused by the small batch sizes typically used in this regime, can destabilize training by introducing large oscillations in gene…

cs.LG2024★ 3 cited

Can large language models explore in-context?

Akshay Krishnamurthy, Keegan Harris, Dylan J. Foster +2

We investigate the extent to which contemporary Large Language Models (LLMs) can engage in exploration, a core capability in reinforcement learning and decision making. We focus on…

cs.LG2023

Pareto Frontiers in Neural Feature Learning: Data, Compute, Width, and Luck

Benjamin L. Edelman, Surbhi Goel, Sham Kakade +2

In modern deep learning, algorithmic choices (such as width, depth, and learning rate) are known to modulate nuanced resource tradeoffs. This work investigates how these complexiti…

cs.LG2023

Butterfly Effects of SGD Noise: Error Amplification in Behavior Cloning and Autoregression

Adam Block, Dylan J. Foster, Akshay Krishnamurthy +2

This work studies training instabilities of behavior cloning with deep neural networks. We observe that minibatch SGD updates to the policy network during training result in sharp…

cs.LG2023★ 9 cited

Exposing Attention Glitches with Flip-Flop Language Modeling

Bingbin Liu, Jordan T. Ash, Surbhi Goel +2

Why do large language models sometimes output factual inaccuracies and exhibit erroneous reasoning? The brittleness of these models, particularly when executing long chains of reas…

cs.LG2023

Learning Hidden Markov Models Using Conditional Samples

Sham M. Kakade, Akshay Krishnamurthy, Gaurav Mahajan +1

This paper is concerned with the computational complexity of learning the Hidden Markov Model (HMM). Although HMMs are some of the most widely used tools in sequential and time ser…

cs.LG2022

Neural Active Learning on Heteroskedastic Distributions

Savya Khosla, Chew Kin Whye, Jordan T. Ash +3

Models that can actively seek out the best quality training data hold the promise of more accurate, adaptable, and efficient machine learning. Active learning techniques often tend…

cs.LG2022★ 11 cited

Transformers Learn Shortcuts to Automata

Bingbin Liu, Jordan T. Ash, Surbhi Goel +2

Algorithmic reasoning requires capabilities which are most naturally understood through recurrent models of computation, like the Turing machine. However, Transformer models, while…

cs.LG2022

Recurrent Convolutional Neural Networks Learn Succinct Learning Algorithms

Surbhi Goel, Sham Kakade, Adam Tauman Kalai +1

Neural networks (NNs) struggle to efficiently solve certain problems, such as learning parities, even when there are simple learning algorithms for those problems. Can NNs discover…

cs.LG2022★ 12 cited

Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit

Boaz Barak, Benjamin L. Edelman, Surbhi Goel +3

There is mounting evidence of emergent phenomena in the capabilities of deep learning methods as we scale up datasets, model sizes, and training times. While there are some account…

cs.LG2022★ 15 cited

Understanding Contrastive Learning Requires Incorporating Inductive Biases

Nikunj Saunshi, Jordan Ash, Surbhi Goel +5

Contrastive learning is a popular form of self-supervised learning that encourages augmentations (views) of the same input to have more similar representations compared to augmenta…

cs.LG2021

Machine Learning for Mechanical Ventilation Control (Extended Abstract)

Daniel Suo, Naman Agarwal, Wenhan Xia +12

Mechanical ventilation is one of the most widely used therapies in the ICU. However, despite broad application from anaesthesia to COVID-related life support, many injurious challe…

cs.LG2021

Anti-Concentrated Confidence Bonuses for Scalable Exploration

Jordan T. Ash, Cyril Zhang, Surbhi Goel +2

Intrinsic rewards play a central role in handling the exploration-exploitation trade-off when designing sequential decision-making algorithms, in both foundational theory and state…

cs.LG2021★ 15 cited

Inductive Biases and Variable Creation in Self-Attention Mechanisms

Benjamin L. Edelman, Surbhi Goel, Sham Kakade +1

Self-attention, an architectural motif designed to model long-range interactions in sequential data, has driven numerous recent breakthroughs in natural language processing and bey…

cs.LG2021★ 2 cited

Acceleration via Fractal Learning Rate Schedules

Naman Agarwal, Surbhi Goel, Cyril Zhang

In practical applications of iterative first-order optimization, the learning rate schedule remains notoriously difficult to understand and expensive to tune. We demonstrate the pr…

cs.LG2021★ 4 cited

Machine Learning for Mechanical Ventilation Control

Daniel Suo, Naman Agarwal, Wenhan Xia +12

We consider the problem of controlling an invasive mechanical ventilator for pressure-controlled ventilation: a controller must let air in and out of a sedated patient's lungs acco…

cs.LG2020★ 4 cited

Stochastic Optimization with Laggard Data Pipelines

Naman Agarwal, Rohan Anil, Tomer Koren +2

State-of-the-art optimization is steadily shifting towards massively parallel pipelines with extremely large batch sizes. As a consequence, CPU-bound preprocessing and disk/memory/…

cs.LG2020★ 8 cited

Disentangling Adaptive Gradient Methods from Learning Rates

Naman Agarwal, Rohan Anil, Elad Hazan +2

We investigate several confounding factors in the evaluation of optimization algorithms for deep learning. Primarily, we take a deeper look at how adaptive gradient methods interac…

cs.LG2020★ 6 cited

No-Regret Prediction in Marginally Stable Systems

Udaya Ghai, Holden Lee, Karan Singh +2

We consider the problem of online prediction in a marginally stable linear dynamical system subject to bounded adversarial or (non-isotropic) stochastic perturbations. This poses t…

cs.LG2019★ 3 cited

Robust guarantees for learning an autoregressive filter

Holden Lee, Cyril Zhang

The optimal predictor for a linear dynamical system (with hidden state and Gaussian noise) takes the form of an autoregressive linear filter, namely the Kalman filter. However, a f…

cs.LG2019

Extreme Tensoring for Low-Memory Preconditioning

Xinyi Chen, Naman Agarwal, Elad Hazan +2

State-of-the-art models are now trained with billions of parameters, reaching hardware limits in terms of memory consumption. This has created a recent demand for memory-efficient…

cs.LG2018★ 10 cited

Efficient Full-Matrix Adaptive Regularization

Naman Agarwal, Brian Bullins, Xinyi Chen +4

Adaptive regularization methods pre-multiply a descent direction by a preconditioning matrix. Due to the large number of parameters of machine learning problems, full-matrix precon…

cs.LG2018★ 17 cited

Spectral Filtering for General Linear Dynamical Systems

Elad Hazan, Holden Lee, Karan Singh +2

We give a polynomial-time algorithm for learning latent-state linear dynamical systems without system identification, and without assumptions on the spectral radius of the system's…

cs.LG2017★ 5 cited

Learning Linear Dynamical Systems via Spectral Filtering

Elad Hazan, Karan Singh, Cyril Zhang

We present an efficient and practical algorithm for the online prediction of discrete-time linear dynamical systems with a symmetric transition matrix. We circumvent the non-convex…