Publications

Do Enterprise Systems Need Learned World Models? The Importance of Context to Infer Dynamics
Jishnu Sethumadhavan Nair
Rishabh Maheshwary
Surajit Dasgupta
Sravan Ramachandran
Aakash Bhagat
Shruthan Radhakrishna
Pulkit Pattnaik
Johan Obando-Ceron
Shiva Krishna Reddy Malay
Sagar Davasam
Seganrasan Subramanian
Vipul Mittal
Sridhar Krishna Nemala
Christopher Pal
Srinivas Sunkara
Sai Rajeswar
Factorized Self-Supervised Speech Tokenization
Nicol Visser
Hugo Seuté
Herman Kamper
FETTUCCINE: Fast and efficient brain-to-text decoding on mobile devices
Jonathan McCart
Pranav Deevi
Mehdi Azabou
Nanda H Krishna
Caleb A McKinney
Nicholas S Card
Sergey D Stavisky
Chethan Pandarinath
A Foundational Model System for Datacenter Machine Repairs
Yuanlin Wen
Elan S Markowitz
Zubo Gu
Sami Abu-El-Haija
Bryan Perozzi
Aayush Gupta
Venkata Chivukula
Griffin Hadfield
Aravind Akella
Daniel J Frame
Vahab Mirrokni
Amin Vahdat
Frank-LoRA: Federated Rank-Aware LoRA for Fine-Tuning Large Models
Kevin Kuo
Virginia Smith
From Claims to Context: Holistic Information Verification Requires Contextual Signals
From Infrastructure to Interface, the AI Value Chain Drives LLM Homogenization
From Static Policies to Adaptive Priors in Offline Reinforcement Learning
Offline reinforcement learning (RL) has traditionally focused on learning policies for direct deployment under conservative objectives, wher… (see more)e uncertainty outside the offline dataset is treated pessimistically to ensure robustness. We argue that this formulation becomes incomplete when an offline-trained policy is subsequently updated through online interaction, as increasingly occurs in modern intelligent systems through test-time adaptation and online fine-tuning. This position paper argues that, in such settings, the objective of offline RL should extend beyond immediate deployment and instead prioritize learning *adaptive policy priors*: policies that preserve the capacity to improve during subsequent interaction through memory, exploration, and self-correction. We formalize this perspective as *adaptive offline reinforcement learning* (AORL), distinguish it from offline-to-online RL, and explain why adaptability becomes important under distributional shift, limited dataset coverage, and changing test-time conditions. We further discuss Bayesian offline RL as one principled direction for constructing adaptive policy priors by preserving epistemic uncertainty over plausible environments. Finally, we outline connections, open challenges, and research directions for treating offline RL as preparation for future experience rather than as a static deployment problem.
$\gamma$-weakly $\theta$-up-concavity: A Unified Framework for Non-Convex Optimization Beyond DR-Submodular and OSS Functions
Vaneet Aggarwal
GEAR: Generator-Adaptive State Space Models for Associative Recall
Jun Meng
Mohammadhossein Amouei
Zengyu Lin
Xinyu Hu
Benjamin C. M. Fung
GeneZip: Region-Aware Compression for Long Context DNA Modeling
Genomic sequences span billions of base pairs (bp), posing a fundamental challenge for genome-scale foundation models. Existing approaches l… (see more)argely sidestep this barrier by either scaling relatively small models to long contexts or relying on heavy multi-GPU parallelism. Here we introduce GeneZip, a DNA compression model that leverages a key biological prior: genomic information is highly imbalanced. Coding regions comprise only a small fraction (about 2 percent) yet are information-dense, whereas most non-coding sequence is comparatively information-sparse. GeneZip couples HNet-style dynamic routing with a region-aware compression-ratio objective, enabling adaptive allocation of representation budget across genomic regions. As a result, GeneZip learns region-aware compression and achieves 137.6x compression with only 0.31 perplexity increase. On downstream long-context benchmarks, GeneZip achieves comparable or better performance on contact map prediction, expression quantitative trait loci prediction, and enhancer-target gene prediction. By reducing effective sequence length, GeneZip unlocks simultaneous scaling of context and capacity: compared to the prior state-of-the-art model JanusDNA, it enables training models 82.6x larger at 1M-bp context, supporting a 636M-parameter GeneZip model at 1M-bp context. All experiments in this paper can be trained on a single A100 80GB GPU.
GeoWind2Plan: Mission-Time 3D Urban Wind Prediction for Energy-Efficient UAV Planning
Yucheng Zhao
Fuyuan Lyu
Di Zhou
Jiachen Yao
Xue Liu
Anima Anandkumar
Liangzhu Leon Wang
Xiongye Xiao