Recent AI research papers with accessible summaries. Updated daily from arXiv, summarized for developers who don't read papers regularly.
Jinbin Luo, Xiaozhe Yao, Shang Yang et al.
By treating different cache types as flexible pools and overlapping data transfers with computation, TideCache achieves 2x more concurrent requests and 20-59% lower latency—showing that intelligent memory management, not just bigger GPUs, unlocks efficiency gains.
TideCache is a serving system that optimizes GPU memory usage for hybrid LLM architectures by intelligently managing different cache types across GPU and CPU memory. It uses transparent page redistribution, smart prefetching during computation gaps, and adaptive request scheduling to fit more requests and reduce latency on CPU-GPU systems.
Adrià Ciurana Lanau, Harleen Hanspal, Lusine Abrahamyan et al.
By sharing a spatial prototype across layers and using one compact vector per layer, ProtoDiffusion achieves efficient multi-layer image generation that's 19× faster than decomposing flat images, while maintaining high reconstruction quality.
ProtoDiffusion generates multi-layer graphic designs (like Photoshop files) by representing each layer compactly as a single vector, rather than full spatial grids. This reduces memory from N×H×W tokens to H×W+N tokens. The model can generate designs from images or text, automatically determining layer count and layout without requiring them as input.
Ellis Brown, Chris Hoang, Shengyi Qian et al.
For building multimodal models, dedicated vision capacity trained jointly with the language model is more important than using pretrained vision encoders, and this capacity can be efficiently placed early in the backbone rather than as a separate pre-fusion module.
This paper investigates how vision encoders should be designed in multimodal language models by systematically comparing three design choices: using a pretrained visual encoder, dedicating capacity to vision processing, and where to place that capacity.
Jie Wang, Tong Zhu, JiaHao Kuang et al.
ArchSpace enables researchers to test LLM architecture ideas efficiently by predicting large-scale performance from small experiments using scaling laws, creating a shared record of what works and why.
ArchSpace is a public platform for documenting, evaluating, and sharing LLM architecture innovations. It addresses a gap where industry teams test many architectural ideas but rarely publish which succeeded or failed, and academia struggles with small-scale comparisons.
Dayou Du, Woon Yee Ng, Guangming Sheng et al.
You can compress LLM key-value caches to 4-bit precision without significant accuracy loss by carefully handling quantization errors at the algorithm level and co-designing with hardware capabilities—delivering major serving speedups in practice.
BitDecoding-FP4 enables efficient long-context LLM serving by storing key-value caches in ultra-low-precision 4-bit floating-point format while maintaining accuracy.
Tushaar Gangavarapu, Gil Tabak, Clemens JS Schaefer
Linear attention models can be made significantly more efficient by allocating parameters based on sensitivity analysis: use low-rank gates for state erasure (which matters less) and invest savings into wider networks and better readout mechanisms.
Muir improves linear attention models by analyzing how state updates work differently across channels. The key insight is that erasing old information requires less capacity than writing new information, so the model uses low-rank gates for erasure and reinvests those parameters into a wider network.
Ales Kubicek, Andrea Caciolai, Liangzu Peng et al.
LSA enables practical ultra-long context (1M+ tokens) by replacing expensive full attention with hierarchical cluster scoring, achieving 22.7x speedup in prefill and 4.6x in decode while preserving model accuracy.
This paper introduces Latent Sparse Attention (LSA), a method that makes attention efficient at ultra-long context lengths (1M+ tokens) by hierarchically clustering keys in a learned latent space. Instead of comparing queries to every key, queries score clusters of keys, reducing computation from quadratic to subquadratic while maintaining accuracy.
Yuzhe Liu, Haolin Tian, Tonghan Wang
You can transfer pre-computed context between different-sized models in the same family, cutting context processing time by 6-21x—useful when deploying multiple model sizes and reusing the same input across them.
ACCT enables reusing computed context (KV cache) across different LLM sizes within the same family, avoiding redundant computation when switching models. It transforms a source model's KV cache into sparse, compressed states that a smaller target model can directly use, achieving 6.5-21x speedup on context processing while maintaining performance.
Dianye Huang, Jiamei Guo, Yue Zhou et al.
Combining diffusion-based continuous prediction with language models outperforms discrete token prediction for medical measurements, suggesting hybrid architectures better match the continuous nature of real-world quantitative tasks.
This paper presents HAD-VLM, a medical AI system that combines language understanding with precise numerical measurement from ultrasound and X-ray images.
Stephen Chung, Wenyu Du
You can compress n-gram embedding tables to 4-bit precision and save 75% of their memory with minimal performance loss—or use the freed memory to make the model better overall.
This paper shows that n-gram embedding tables in language models can be stored at low precision (4 bits) instead of full precision, reducing memory usage by ~75% while keeping 99% of the performance benefit. The authors test quantization methods on models from scratch and on large existing models like DeepSeek, finding that saved memory can be reinvested to improve overall performance.
Soumik Mukhopadhyay, Long Mai, Abhinav Shrivastava et al.
Pixel diffusion models benefit from adaptive prediction strategies that vary by capacity and data type, and post-hoc high-frequency refinement can significantly improve image quality without expensive retraining.
This paper improves pixel-space diffusion transformers by introducing MFlow, which adaptively learns to blend two prediction strategies (clean image vs. velocity) based on data characteristics and model size. The authors also propose ConvRefiner, a lightweight module that fixes a persistent high-frequency quality deficit in generated images without retraining the main model.
Joshua Williamson, Niall Jeffrey, Lorne Whiteway
Encoding physical symmetries directly into neural network architecture—rather than letting the model learn them—dramatically improves data efficiency and accuracy for scientific problems with inherent geometric structure.
This paper presents a spherical convolutional neural network designed for data naturally living on spheres (like cosmic microwave background maps). By building in rotational symmetry mathematically rather than learning it, the network uses training data more efficiently and achieves better results on cosmology tasks with fewer simulations needed.
Oscar Davis, Daan Roos, Alice Bizeul et al.
Self-conditioning and careful embedding geometry are critical design choices for continuous diffusion language models; simple architectural improvements like DoubleCat can match or exceed discrete diffusion performance without additional computational cost.
This paper investigates how to design better continuous diffusion language models by studying two key factors: self-conditioning (exposing models to realistic inference states during training) and embedding geometry (how word representations are shaped).
Anna Zimmel, Fleur Hendriks, Markus Holzleitner et al.
Bifurcating systems violate the one-to-one assumption in standard neural surrogates; Bi-FORK solves this by treating bifurcations as a generative modeling problem, enabling amortized prediction of all solution branches simultaneously.
Bi-FORK is a generative model that learns one-to-many solution maps in high-dimensional physical systems undergoing bifurcations—where a single input produces multiple equally valid outputs. Using latent flow matching and repulsion-guided sampling, it generates complete trajectories while preserving spatial and temporal coherence, scaling to systems with hundreds of thousands of dimensions.
Sihan Xu, Ji Xie, Zilin Wang et al.
Dynamically predicting and updating conditioning embeddings at each generation step improves diffusion model efficiency and quality—you don't need to reuse the same embedding throughout the entire denoising process.
This paper proposes using predicted embeddings as dynamic conditioning signals in diffusion transformers instead of static embeddings. A separate transformer (NEPA) predicts image embeddings at each denoising step, allowing the conditioning to adapt to the current noise level. The approach achieves competitive image generation quality on ImageNet with significantly less training compute.
Tianjiao Yu, Xinzhuo Li, Yifan Shen et al.
Representing 3D shapes as overlapping 2D slices rather than voxels dramatically reduces computational cost while improving topological correctness—a practical win for efficient 3D generation at scale.
SILSA is a 3D generation framework that uses compact sliding-window slice representations instead of expensive voxel tokens to generate high-resolution 3D shapes. By encoding cross-sections along three axes and adding topology supervision based on persistence diagrams, it achieves better structural quality while using 70% fewer tokens and running 58% faster than competing methods.
Kunxiong Zhu, Zhihao Shu, Hangyu Zheng et al.
Multimodal LLM serving requires rethinking GPU resource allocation around the Encode stage—treating it as a bottleneck control point rather than a separate service unlocks significant throughput gains.
EAServe optimizes serving multimodal LLMs by treating the Encode stage as a control point for the three-stage Encode-Prefill-Decode pipeline. It uses adaptive micro-batching, partial offloading, and GPU partitioning to balance resource utilization across stages, achieving 4.3x higher throughput than existing systems under latency constraints.
Xinyue Zeng, Jiawei Zhang, Yujun Yan et al.
Long-horizon reasoning failures in LLMs stem from structural biases in the reasoning space itself, not just model capacity—and injecting geometric structure into the reasoning process can dramatically improve performance on hard problems.
This paper addresses why large language models struggle with long-horizon reasoning tasks by identifying two key problems: exploration bias (getting stuck in locally plausible but structurally weak paths) and compounding bias (small errors accumulating over many steps).
Richard Zhe Wang
Attention heads need both the ability to abstain from attending and to filter noise from values—their importance shifts with model scale, suggesting future architectures should support both primitives.
This paper identifies two missing capabilities in standard softmax attention: abstention (allowing heads to output nothing instead of always producing weighted combinations) and noise filtering (suppressing interference from mixed features).
Taoyong Cui, Zhongyao Wang, Xinyue Xu et al.
A single learning principle based on factorized predictions can work across radically different domains, suggesting world modeling doesn't need domain-specific architectures—and can even guide real scientific discovery.
JEPA-Anything is a unified framework for building predictive models across completely different domains—from videos to molecules to weather—using a technique called orthogonal predictive factorization. Instead of training separate models for each domain, it learns to decompose predictions into independent factors that work across vision, biology, physics, and clinical data.
Daniel Henrik Nevermann, Claudius Gros
Positional encodings like RoPE and ALiBi don't automatically help transformers generalize to unseen token distances—data diversity and task structure matter more than the encoding scheme itself.
This paper investigates how transformers generalize to different token distances between training and inference, using synthetic copy tasks. It compares positional encoding schemes (RoPE, ALiBi, no encoding) and finds that understanding distance generalization requires rethinking how we use positional information.
Wenkang Wei, Yuan Fang, Renhe Jiang et al.
Language models have a critical handoff point where they transition from using query routing information to relying on internal knowledge—this happens at different layers across models and reveals how they internally organize and access information.
This paper investigates how large language models retrieve and use internal knowledge when answering questions by analyzing how different layers process query information versus stored knowledge.
Linzhan Mou, Jiahui Lei, Zhiyang Dou et al.
For the first time, a single model can animate any skeleton topology (bipedal, quadrupedal, insects, etc.) from text alone—no per-character fine-tuning or reference motions needed at inference time.
UniMate is a foundation model that generates realistic motion for any 3D character skeleton from text descriptions, without needing to retrain for each new character type. It uses a specialized neural architecture that understands skeleton structure through graph-based attention mechanisms, and was trained on a diverse dataset of 13,000+ motion sequences across different creature types.
GeonU Kim, Shin Dong-Yeon, Tae-Hyun Oh
You can generate realistic novel views of mirror scenes by treating reflections as virtual views and using gated attention mechanisms—no retraining needed, just clever use of existing diffusion models.
This paper presents Ref-GeNVS, a method for generating novel views of scenes containing mirrors without requiring additional training. The key innovation is treating mirror reflections as complementary views by estimating the mirror plane and reflecting camera poses, then using a two-stage approach with special attention mechanisms to ensure reflections stay consistent during generation.