<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>2025s on Philipp Krähenbühl</title><link>http://www.philkr.net/2025/</link><description>Recent content in 2025s on Philipp Krähenbühl</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Mon, 01 Dec 2025 00:00:00 +0000</lastBuildDate><atom:link href="http://www.philkr.net/2025/index.xml" rel="self" type="application/rss+xml"/><item><title>PerceptionLM: Open-Access Data and Models for Detailed Visual Understanding</title><link>http://www.philkr.net/2025/cho2025perceptionlm/</link><pubDate>Mon, 01 Dec 2025 00:00:00 +0000</pubDate><guid>http://www.philkr.net/2025/cho2025perceptionlm/</guid><description>&lt;p>Vision-language models are integral to computer vision research, yet many high-performing models remain closed-source, obscuring their data, design and training recipe. The research community has responded by using distillation from black-box models to label training data, achieving strong benchmark results, at the cost of measurable scientific progress. However, without knowing the details of the teacher model and its data sources, scientific progress remains difficult to measure. In this paper, we study building a Perception Language Model (PLM) in a fully open and reproducible framework for transparent research in image and video understanding. We analyze standard training pipelines without distillation from proprietary models and explore large-scale synthetic data to identify critical data gaps, particularly in detailed video understanding. To bridge these gaps, we release 2.8M human-labeled instances of fine-grained video question-answer pairs and spatio-temporally grounded video captions. Additionally, we introduce PLM-VideoBench, a suite for evaluating challenging video understanding tasks focusing on the ability to reason about &amp;ldquo;what&amp;rdquo;, &amp;ldquo;where&amp;rdquo;, &amp;ldquo;when&amp;rdquo;, and &amp;ldquo;how&amp;rdquo; of a video. We make our work fully reproducible by providing data, training recipes, code &amp;amp; models. &lt;a href="https://github.com/facebookresearch/perception_models" target="_blank">github.com/facebookresearch/perception_models&lt;/a>&lt;/p></description></item><item><title>Long-term Traffic Simulation with Interleaved Autoregressive Motion and Scenario Generation</title><link>http://www.philkr.net/2025/yang2025longterm/</link><pubDate>Wed, 01 Oct 2025 00:00:00 +0000</pubDate><guid>http://www.philkr.net/2025/yang2025longterm/</guid><description>&lt;p>An ideal traffic simulator replicates the realistic long-term point-to-point trip that a self-driving system experiences during deployment. Prior models and benchmarks focus on closed-loop motion simulation for initial agents in a scene. This is problematic for long-term simulation. Agents enter and exit the scene as the ego vehicle enters new regions. We propose InfGen, a unified next-token prediction model that performs interleaved closed-loop motion simulation and scene generation. InfGen automatically switches between closed-loop motion simulation and scene generation mode. It enables stable long-term rollout simulation. InfGen performs at the state-of-the-art in short-term (9s) traffic simulation, and significantly outperforms all other methods in long-term (30s) simulation. The code and model of InfGen will be released at &lt;a href="https://orangesodahub.github.io/InfGen" target="_blank">orangesodahub.github.io/InfGen&lt;/a>&lt;/p></description></item><item><title>Robust Autonomy Emerges from Self-Play</title><link>http://www.philkr.net/2025/cusumano-towner2025robust/</link><pubDate>Tue, 01 Jul 2025 00:00:00 +0000</pubDate><guid>http://www.philkr.net/2025/cusumano-towner2025robust/</guid><description>&lt;p>Self-play has powered breakthroughs in two-player and multi-player games. Here we show that self-play is a surprisingly effective strategy in another domain. We show that robust and naturalistic driving emerges entirely from self-play in simulation at unprecedented scale &amp;ndash; 1.6&lt;del>billion&lt;/del>km of driving. This is enabled by Gigaflow, a batched simulator that can synthesize and train on 42 years of subjective driving experience per hour on a single 8-GPU node. The resulting policy achieves state-of-the-art performance on three independent autonomous driving benchmarks. The policy outperforms the prior state of the art when tested on recorded real-world scenarios, amidst human drivers, without ever seeing human data during training. The policy is realistic when assessed against human references and achieves unprecedented robustness, averaging 17.5 years of continuous driving between incidents in simulation.&lt;/p></description></item><item><title>Cut Your Losses in Large-Vocabulary Language Models</title><link>http://www.philkr.net/2025/wijmans2025cut/</link><pubDate>Sat, 05 Apr 2025 00:00:00 +0000</pubDate><guid>http://www.philkr.net/2025/wijmans2025cut/</guid><description>&lt;p>As language models grow ever larger, so do their vocabularies. This has shifted the memory footprint of LLMs during training disproportionately to one single layer: the cross-entropy in the loss computation. Cross-entropy builds up a logit matrix with entries for each pair of input tokens and vocabulary items and, for small models, consumes an order of magnitude more memory than the rest of the LLM combined. We propose Cut Cross-Entropy (CCE), a method that computes the cross-entropy loss without materializing the logits for all tokens into global memory. Rather, CCE only computes the logit for the correct token and evaluates the log-sum-exp over all logits on the fly. We implement a custom kernel that performs the matrix multiplications and the log-sum-exp reduction over the vocabulary in flash memory, making global memory consumption for the cross-entropy computation negligible. This has a dramatic effect. Taking the Gemma 2 (2B) model as an example, CCE reduces the memory footprint of the loss computation from 24 GB to 1 MB, and the total training-time memory consumption of the classifier head from 28 GB to 1 GB. To improve the throughput of CCE, we leverage the inherent sparsity of softmax and propose to skip elements of the gradient computation that have a negligible (i.e., below numerical precision) contribution to the gradient. Experiments demonstrate that the dramatic reduction in memory consumption is accomplished without sacrificing training speed or convergence.&lt;/p></description></item><item><title>Distilling Structural Representations into Protein Sequence Models</title><link>http://www.philkr.net/2025/ouyang-zhang2025distilling/</link><pubDate>Fri, 04 Apr 2025 00:00:00 +0000</pubDate><guid>http://www.philkr.net/2025/ouyang-zhang2025distilling/</guid><description>&lt;p>Protein language (or sequence) models, like the popular ESM2, are now widely used tools for extracting evolution-based protein representations and have achieved significant success on core downstream biological tasks. A major open problem is how to obtain representations that best capture both the sequence evolutionary history and the atomic structural properties of proteins in general. We introduce Implicit Sequence Model, a sequence-only input model with structurally-enriched representations that outperforms state-of-the-art sequence models on several well-studied benchmarks including mutation stability assessment and structure prediction. Our key innovations are a microenvironment-based Autoencoder for generating structure tokens and a self-supervised training objective that distills these tokens into ESM2&amp;rsquo;s pre-trained model. Notably, we make ISM&amp;rsquo;s structure-enriched weights easily accessible for any application using the ESM2 framework.&lt;/p></description></item><item><title>Does Spatial Cognition Emerge in Frontier Models?</title><link>http://www.philkr.net/2025/ramakrishnan2025does/</link><pubDate>Thu, 03 Apr 2025 00:00:00 +0000</pubDate><guid>http://www.philkr.net/2025/ramakrishnan2025does/</guid><description>&lt;p>Not yet. We present SPACE, a benchmark that systematically evaluates spatial cognition in frontier models. Our benchmark builds on decades of research in cognitive science. It evaluates large-scale mapping abilities that are brought to bear when an organism traverses physical environments, smaller-scale reasoning about object shapes and layouts, and cognitive infrastructure such as spatial attention and memory. For many tasks, we instantiate parallel presentations via text and images, allowing us to benchmark both large language models and large multimodal models. Results suggest that contemporary frontier models fall short of the spatial intelligence of animals, performing near chance level on a number of classic tests of animal cognition. Code and data are available: &lt;a href="https://github.com/apple/ml-space-benchmark" target="_blank">github.com/apple/ml-space-benchmark&lt;/a>&lt;/p></description></item><item><title>Image and Video Tokenization with Binary Spherical Quantization</title><link>http://www.philkr.net/2025/zhao2025image/</link><pubDate>Wed, 02 Apr 2025 00:00:00 +0000</pubDate><guid>http://www.philkr.net/2025/zhao2025image/</guid><description>&lt;p>We propose a new transformer-based image and video tokenizer with Binary Spherical Quantization (BSQ). BSQ projects the high-dimensional visual embedding to a lower-dimensional hypersphere and then applies binary quantization. BSQ is (1) parameter-efficient without an explicit codebook, (2) scalable to arbitrary token dimensions, and (3) compact: compressing visual data by up to 100$\times$ with minimal distortion. Our tokenizer uses a transformer encoder and decoder with simple block-wise causal masking to support variable-length videos as input. The resulting BSQ-ViT achieves state-of-the-art visual reconstruction quality on image and video reconstruction benchmarks with 2.4$\times$ throughput compared to the best prior methods. Furthermore, by learning an autoregressive prior for adaptive arithmetic coding, BSQ-ViT achieves comparable results on video compression with state-of-the-art video compression standards. BSQ-ViT also enables masked language models to achieve competitive image synthesis quality to GAN- and diffusion-based methods.&lt;/p></description></item><item><title>Language-Image Models with 3D Understanding</title><link>http://www.philkr.net/2025/cho2025language/</link><pubDate>Tue, 01 Apr 2025 00:00:00 +0000</pubDate><guid>http://www.philkr.net/2025/cho2025language/</guid><description>&lt;p>Multi-modal large language models (MLLMs) have shown incredible capabilities in a variety of 2D vision and language tasks. We extend MLLMs&amp;rsquo; perceptual capabilities to ground and reason about images in 3-dimensional space. To that end, we first develop a large-scale pre-training dataset for 2D and 3D called LV3D by combining multiple existing 2D and 3D recognition datasets under a common task formulation: as multi-turn question-answering. Next, we introduce a new MLLM named Cube-LLM and pre-train it on LV3D. We show that pure data scaling makes a strong 3D perception capability without 3D specific architectural design or training objective. Cube-LLM exhibits intriguing properties similar to LLMs: (1) Cube-LLM can apply chain-of-thought prompting to improve 3D understanding from 2D context information. (2) Cube-LLM can follow complex and diverse instructions and adapt to versatile input and output formats. (3) Cube-LLM can be visually prompted such as 2D box or a set of candidate 3D boxes from specialists. Our experiments on outdoor benchmarks demonstrate that Cube-LLM significantly outperforms existing baselines by 21.3 points of AP-BEV on the Talk2Car dataset for 3D grounded reasoning and 17.7 points on the DriveLM dataset for complex reasoning about driving scenarios, respectively. Cube-LLM also shows competitive results in general MLLM benchmarks such as refCOCO for 2D grounding with (87.0) average score, as well as visual question answering benchmarks such as VQAv2, GQA, SQA, POPE, etc. for complex reasoning. Our project is available at &lt;a href="https://janghyuncho.github.io/Cube-LLM" target="_blank">janghyuncho.github.io/Cube-LLM&lt;/a>.&lt;/p></description></item></channel></rss>