<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Research Areas | Ravid Shwartz-Ziv</title><link>https://www.ravid-shwartz-ziv.com/research/</link><atom:link href="https://www.ravid-shwartz-ziv.com/research/index.xml" rel="self" type="application/rss+xml"/><description>Research Areas</description><generator>Source Themes Academic (https://sourcethemes.com/academic/)</generator><language>en-us</language><image><url>https://www.ravid-shwartz-ziv.com/img/ravid-shwartz-ziv-social-v2.png</url><title>Research Areas</title><link>https://www.ravid-shwartz-ziv.com/research/</link></image><item><title>Memory, Personalization, and Continual Learning</title><link>https://www.ravid-shwartz-ziv.com/research/memory-continual-learning/</link><pubDate>Wed, 26 Aug 2026 00:00:00 +0000</pubDate><guid>https://www.ravid-shwartz-ziv.com/research/memory-continual-learning/</guid><description>&lt;p>AI systems need several kinds of memory. They must use information from the current context, retain useful knowledge over longer periods, adapt to new experience, and sometimes personalize behavior without damaging capabilities learned earlier. Treating all of these as one problem hides the tradeoffs that matter.&lt;/p>
&lt;p>I am interested in four practical questions:&lt;/p>
&lt;ul>
&lt;li>How can a fixed-size state retain the right information from a long context?&lt;/li>
&lt;li>How can a model update one association without interfering with many others?&lt;/li>
&lt;li>What should be stored in weights, external memory, or an agent&amp;rsquo;s working context?&lt;/li>
&lt;li>How can a system learn continually while measuring what it preserves and what it forgets?&lt;/li>
&lt;/ul>
&lt;h2 id="memory-under-a-fixed-budget">Memory under a fixed budget&lt;/h2>
&lt;p>My essay &lt;strong>
&lt;a href="https://www.the-information-bottleneck.com/p/editing-a-compressed-memory" target="_blank" rel="noopener">Editing a Compressed Memory&lt;/a>&lt;/strong> explains one concrete version of the problem. Linear attention replaces a growing key-value cache with a fixed-size recurrent state. This makes memory and decoding costs independent of context length, but introduces interference when many associations share the same representation. Delta-style updates, decay, and gating provide progressively more selective ways to edit that state.&lt;/p>
&lt;p>This form of in-context memory is different from personalization across sessions or continual learning in model weights. The common question is what information a bounded system should preserve, how it should update that information, and how we can evaluate the resulting behavior.&lt;/p>
&lt;p>For agents, memory must also interact with planning and verification. &lt;strong>
&lt;a href="https://www.ravid-shwartz-ziv.com/publication/minitap/">Minitap&lt;/a>&lt;/strong> studies a mobile-agent system that separates these responsibilities across specialized components, making failures easier to detect and recover from.&lt;/p>
&lt;p>
&lt;a href="https://www.ravid-shwartz-ziv.com/#podcast">Read my writing and podcast conversations&lt;/a> or
&lt;a href="https://www.ravid-shwartz-ziv.com/#contact">discuss a collaboration&lt;/a>.&lt;/p></description></item><item><title>Model Compression and Efficient AI</title><link>https://www.ravid-shwartz-ziv.com/research/model-compression-efficient-ai/</link><pubDate>Wed, 26 Aug 2026 00:00:00 +0000</pubDate><guid>https://www.ravid-shwartz-ziv.com/research/model-compression-efficient-ai/</guid><description>&lt;p>Efficient AI is not one technique. A system can reduce the precision of its weights, reuse or remove redundant layers, change the structure of a linear transformation, or select a better internal representation for a downstream task. Each choice saves a different resource and risks losing a different capability.&lt;/p>
&lt;p>My work connects three levels of compression:&lt;/p>
&lt;h2 id="models-and-weights">Models and weights&lt;/h2>
&lt;p>&lt;strong>
&lt;a href="https://www.ravid-shwartz-ziv.com/publication/task-aware-quantization/">You Had One Job&lt;/a>&lt;/strong> treats mixed-precision quantization as a task-conditioned allocation problem. It uses hidden representations and output sensitivity to identify which transformer layers deserve more precision under a fixed bit budget.&lt;/p>
&lt;p>&lt;strong>
&lt;a href="https://www.ravid-shwartz-ziv.com/publication/inuit/">When Attention Collapses / Inheritune&lt;/a>&lt;/strong> studies redundant transformer layers and how useful layers can be reused to construct smaller language models. &lt;strong>
&lt;a href="https://www.ravid-shwartz-ziv.com/publication/ndlinear/">NdLinear&lt;/a>&lt;/strong> replaces a flattened linear map with transformations along the dimensions of a tensor, reducing parameters when the structure of the task supports that factorization.&lt;/p>
&lt;h2 id="representations">Representations&lt;/h2>
&lt;p>&lt;strong>
&lt;a href="https://www.ravid-shwartz-ziv.com/publication/layer-by-layer/">Layer by Layer&lt;/a>&lt;/strong> shows that intermediate representations can outperform final-layer embeddings. &lt;strong>
&lt;a href="https://www.ravid-shwartz-ziv.com/publication/attention-sinks-compression-valleys/">Attention Sinks and Compression Valleys&lt;/a>&lt;/strong> connects large residual-stream activations, attention sinks, and representational compression across model depth.&lt;/p>
&lt;p>Representational compression is not automatically a smaller model. It explains which information is retained and where a model&amp;rsquo;s computation becomes concentrated. That understanding can guide practical choices about layers, embeddings, and downstream systems.&lt;/p>
&lt;h2 id="inference">Inference&lt;/h2>
&lt;p>Efficient inference also depends on how a model generates. &lt;strong>
&lt;a href="https://www.ravid-shwartz-ziv.com/publication/minp/">Min-p&lt;/a>&lt;/strong> adapts a sampling cutoff to the model&amp;rsquo;s confidence. My essay &lt;strong>
&lt;a href="https://www.the-information-bottleneck.com/p/speculative-decoding-from-zero-to" target="_blank" rel="noopener">Speculative decoding, from zero to DSpark&lt;/a>&lt;/strong> explains how drafting, verification, and scheduling turn otherwise idle computation into higher serving throughput.&lt;/p>
&lt;p>
&lt;a href="https://www.ravid-shwartz-ziv.com/#work">Explore selected systems&lt;/a> or
&lt;a href="https://www.ravid-shwartz-ziv.com/publication/">see all publications&lt;/a>.&lt;/p></description></item><item><title>World Models and Predictive Representations</title><link>https://www.ravid-shwartz-ziv.com/research/world-models/</link><pubDate>Wed, 26 Aug 2026 00:00:00 +0000</pubDate><guid>https://www.ravid-shwartz-ziv.com/research/world-models/</guid><description>&lt;p>World models learn useful structure about how an environment changes. The goal is not simply to generate a realistic next frame. A useful model should support prediction, planning, and action in a representation where the important dynamics are easier to learn and reason about.&lt;/p>
&lt;p>My work in this area asks three related questions:&lt;/p>
&lt;ul>
&lt;li>What should a model predict so that its representation captures the structure needed for downstream decisions?&lt;/li>
&lt;li>How should we evaluate a world model beyond visual realism or a single probing task?&lt;/li>
&lt;li>When an agent learns from imagined trajectories, how do errors in learned dynamics and rewards affect policy optimization?&lt;/li>
&lt;/ul>
&lt;h2 id="related-research">Related research&lt;/h2>
&lt;p>&lt;strong>
&lt;a href="https://www.ravid-shwartz-ziv.com/publication/training-in-imagination/">On Training in Imagination&lt;/a>&lt;/strong> directly studies policies trained on trajectories produced by learned dynamics and reward models. It analyzes how model error, regularity, sampling, and noisy rewards shape return estimates and optimization.&lt;/p>
&lt;p>The broader program also includes joint-embedding predictive architectures. &lt;strong>
&lt;a href="https://www.ravid-shwartz-ziv.com/publication/s-jepa/">S-JEPA&lt;/a>&lt;/strong> learns predictive speech representations with soft targets, while &lt;strong>
&lt;a href="https://www.ravid-shwartz-ziv.com/publication/hp-jepa/">HP-JEPA&lt;/a>&lt;/strong> studies latent prediction over graphs at multiple resolutions. These are representation-learning systems relevant to the world-model agenda; they are not presented as complete environment simulators.&lt;/p>
&lt;p>My background in information theory and computational neuroscience shapes how I approach these systems: a representation should retain the information needed for prediction and action while exposing dynamics in a form that models can use efficiently.&lt;/p>
&lt;p>
&lt;a href="https://www.ravid-shwartz-ziv.com/publication/">See all publications&lt;/a> or
&lt;a href="https://www.ravid-shwartz-ziv.com/#contact">share a research idea&lt;/a>.&lt;/p></description></item></channel></rss>