activity
20122025
most citedUnderspecification Presents Challenges for Credibility in Modern Machine Learning

430 citations · 607 across the 19 of their papers we have counts for

collaborators

19 papers

cs.LG2025

Contextually Guided Transformers via Low-Rank Adaptation

Andrey Zhmoginov, Jihwan Lee, Max Vladymyrov +1

Large Language Models (LLMs) based on Transformers excel at text processing, but their reliance on prompts for specialized behavior introduces computational overhead. We propose a…

cs.CL2025★ 1 cited

How new data permeates LLM knowledge and how to dilute it

Chen Sun, Renat Aksitov, Andrey Zhmoginov +5

Large language models learn and continually learn through the accumulation of gradient-based updates, but how individual pieces of new information affect existing knowledge, leadin…

cs.LG2025

Long Context In-Context Compression by Getting to the Gist of Gisting

Aleksandar Petrov, Mark Sandler, Andrey Zhmoginov +2

Long context processing is critical for the adoption of LLMs, but existing methods often introduce architectural complexity that hinders their practical adoption. Gisting, an in-co…

cs.CL2024

Learning and Unlearning of Fabricated Knowledge in Language Models

Chen Sun, Nolan Andrew Miller, Andrey Zhmoginov +2

What happens when a new piece of knowledge is introduced into the training data and how long does it last while a large language model (LM) continues to train? We investigate this…

cs.LG2024

Narrowing the Focus: Learned Optimizers for Pretrained Models

Gus Kristiansen, Mark Sandler, Andrey Zhmoginov +4

In modern deep learning, the models are learned by applying gradient updates using an optimizer, which transforms the updates based on various statistics. Optimizers are often hand…

cs.LG2024

Linear Transformers are Versatile In-Context Learners

Max Vladymyrov, Johannes von Oswald, Mark Sandler +1

Recent research has demonstrated that transformers, particularly linear attention models, implicitly execute gradient-descent-like algorithms on data provided in-context during the…

cs.LG2023★ 5 cited

Uncovering mesa-optimization algorithms in Transformers

Johannes von Oswald, Maximilian Schlegel, Alexander Meulemans +10

Some autoregressive models exhibit in-context learning capabilities: being able to learn as an input sequence is processed, without undergoing any parameter changes, and without be…

cs.LG2023★ 2 cited

Training trajectories, mini-batch losses and the curious role of the learning rate

Mark Sandler, Andrey Zhmoginov, Max Vladymyrov +1

Stochastic gradient descent plays a fundamental role in nearly all applications of deep learning. However its ability to converge to a global minimum remains shrouded in mystery. I…

cs.LG2023★ 5 cited

Continual HyperTransformer: A Meta-Learner for Continual Few-Shot Learning

Max Vladymyrov, Andrey Zhmoginov, Mark Sandler

We focus on the problem of learning without forgetting from multiple tasks arriving sequentially, where each task is defined using a few-shot episode of novel or already seen class…

cs.LG2022★ 89 cited

Transformers learn in-context by gradient descent

Johannes von Oswald, Eyvind Niklasson, Ettore Randazzo +4

At present, the mechanisms of in-context learning in Transformers are not well understood and remain mostly an intuition. In this paper, we suggest that training Transformers on au…

cs.LG2022★ 1 cited

Decentralized Learning with Multi-Headed Distillation

Andrey Zhmoginov, Mark Sandler, Nolan Miller +2

Decentralized learning with private data is a central problem in machine learning. We propose a novel distillation-based decentralized learning technique that allows multiple agent…

cs.CV2022★ 4 cited

Fine-tuning Image Transformers using Learnable Memory

Mark Sandler, Andrey Zhmoginov, Max Vladymyrov +1

In this paper we propose augmenting Vision Transformer models with learnable memory tokens. Our approach allows the model to adapt to new tasks, using few parameters, while optiona…

cs.LG2022★ 9 cited

GradMax: Growing Neural Networks using Gradient Information

Utku Evci, Bart van Merriënboer, Thomas Unterthiner +2

The architecture and the parameters of neural networks are often optimized independently, which requires costly retraining of the parameters whenever the architecture is modified.…

cs.LG2022★ 18 cited

HyperTransformer: Model Generation for Supervised and Semi-Supervised Few-Shot Learning

Andrey Zhmoginov, Mark Sandler, Max Vladymyrov

In this work we propose a HyperTransformer, a Transformer-based model for supervised and semi-supervised few-shot learning that generates weights of a convolutional neural network…

cs.LG2021★ 2 cited

Meta-Learning Bidirectional Update Rules

Mark Sandler, Max Vladymyrov, Andrey Zhmoginov +4

In this paper, we introduce a new type of generalized neural network where neurons and synapses maintain multiple states. We show that classical gradient-based backpropagation in n…

cs.LG2020★ 430 cited

Underspecification Presents Challenges for Credibility in Modern Machine Learning

Alexander D'Amour, Katherine Heller, Dan Moldovan +37

ML models often exhibit unexpectedly poor behavior when they are deployed in real-world domains. We identify underspecification as a key reason for these failures. An ML pipeline i…

cs.LG2019★ 1 cited

No Pressure! Addressing the Problem of Local Minima in Manifold Learning Algorithms

Max Vladymyrov

Nonlinear embedding manifold learning methods provide invaluable visual insights into the structure of high-dimensional data. However, due to a complicated nonconvex objective func…

astro-ph.IM2016★ 17 cited

NEWS: Nuclear Emulsions for WIMP Search

A. Aleksandrov, A. Anokhina, T. Asada +56

Nowadays there is compelling evidence for the existence of dark matter in the Universe. A general consensus has been expressed on the need for a directional sensitive detector to c…

cs.LG2012★ 23 cited

Partial-Hessian Strategies for Fast Learning of Nonlinear Embeddings

Max Vladymyrov, Miguel Carreira-Perpinan

Stochastic neighbor embedding (SNE) and related nonlinear manifold learning algorithms achieve high-quality low-dimensional representations of similarity data, but are notoriously…