<?xml version='1.0' encoding='UTF-8'?>
<feed xmlns:opensearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:arxiv="http://arxiv.org/schemas/atom" xmlns="http://www.w3.org/2005/Atom">
  <id>https://arxiv.org/api/++jxWhwV9nDeBGSvVr8cfQ3BMlA</id>
  <title>arXiv Query: search_query=all:infinigen&amp;id_list=&amp;start=0&amp;max_results=12</title>
  <updated>2026-09-19T16:47:55Z</updated>
  <link href="https://arxiv.org/api/query?search_query=all:infinigen&amp;start=0&amp;max_results=12&amp;id_list=" type="application/atom+xml"/>
  <opensearch:itemsPerPage>12</opensearch:itemsPerPage>
  <opensearch:totalResults>8</opensearch:totalResults>
  <opensearch:startIndex>0</opensearch:startIndex>
  <entry>
    <id>http://arxiv.org/abs/2609.16215v1</id>
    <title>Where Should the KV Cache Live? Placement Policies Across GPU, CPU, and SSD for Long-Lived Sessions</title>
    <updated>2026-09-14T18:49:07Z</updated>
    <link href="https://arxiv.org/abs/2609.16215v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2609.16215v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>GPU high bandwidth memory is scarce and expensive, and KV caches consume much of it as chats, agent loops, and document question answering accumulate state. Systems such as Mooncake, LMCache, FlexGen, InfiniGen, and AttentionStore extend GPU memory with CPU DRAM and SSD. The harder question is which blocks belong in each tier, when to move or evict them, and whether prefetching helps. We study these choices in a discrete event simulator spanning GPU HBM, CPU DRAM, and SSD, calibrated against a random forest execution time predictor. We compare recency, reuse frequency, predicted reuse, and an EWMA predictor with prefetch lookahead across chat, agent, and document question answering workloads. Tiering supports 73.02 times more concurrent sessions per GPU and lowers cost per session by 62.04 times. These gains come from tier capacities of 1 plus 8 plus 64, not placement policy. Decode is compute bound at batch size one in our setup, so placement barely affects throughput. It mainly changes PCIe migration traffic and time to first token. Recency produces 2.30 times less migration traffic than reuse frequency for chat. Reuse frequency performs best for agents and document question answering. The existing predicted reuse policy is byte identical to recency, making its agent recommendation effectively recency. A genuine EWMA predictor changes behavior but still ranks behind reuse frequency on the workloads prediction was expected to help. Prefetching does not justify its bandwidth cost. Across the policy and cache size grid, even an oracle with knowledge of future requests never beats no prefetch on migration traffic. Workload specific placement can reduce data movement, but the predicted reuse and prefetch recommendations are not supported as implemented.</summary>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-09-14T18:49:07Z</published>
    <arxiv:primary_category term="cs.AI"/>
    <author>
      <name>Srikanta Datta Tumkur</name>
    </author>
    <author>
      <name>Jay Iyer</name>
    </author>
    <author>
      <name>Mehar Simhadri</name>
    </author>
    <author>
      <name>Sai Pavan Kumar</name>
    </author>
    <author>
      <name>Sai Kapil Kumar</name>
    </author>
    <author>
      <name>Ramesh Nampelly</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2605.14399v1</id>
    <title>SceneForge: Structured World Supervision from 3D Interventions</title>
    <updated>2026-05-14T05:38:00Z</updated>
    <link href="https://arxiv.org/abs/2605.14399v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2605.14399v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Many multimodal learning tasks require supervision that remains consistent across edits, viewpoints, and scene-level interventions. However, such supervision is difficult to obtain from observation-level datasets, which do not expose the underlying scene state or how changes propagate through it. We present SceneForge, an intervention-driven framework that generates structured supervision from editable 3D world states. SceneForge represents each scene as a persistent world with semantic, geometric, and physical dependencies. By applying explicit interventions (e.g., object removal or camera variation) and propagating their effects through scene dependencies, SceneForge renders supervision that remains consistent with object structure and scene-level effects. This produces aligned outputs including counterfactual observations, multi-view observations, and effect-aware signals such as shadows and reflections, all derived from a shared world state rather than post hoc image-space processing. We instantiate SceneForge using Infinigen and Blender to construct a licensing-clean indoor supervision resource with a large number of counterfactual pairs and aligned annotations from over 2K scenes, covering both diverse single-view and registered multi-view settings. Under matched training budgets, incorporating SceneForge supervision improves both object removal and scene removal performance across multiple benchmarks in both quantitative and qualitative evaluation. These results indicate that modeling supervision as structured state transitions in editable worlds provides a practical and scalable foundation for intervention-consistent multimodal learning.</summary>
    <category term="cs.CV" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.GR" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-05-14T05:38:00Z</published>
    <arxiv:primary_category term="cs.CV"/>
    <author>
      <name>Jizhizi Li</name>
    </author>
    <author>
      <name>Jiayang Ao</name>
    </author>
    <author>
      <name>Danny Wicks</name>
    </author>
    <author>
      <name>Petru-Daniel Tudosiu</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2604.05012v2</id>
    <title>Comparative Characterization of KV Cache Management Strategies for LLM Inference</title>
    <updated>2026-09-15T16:46:36Z</updated>
    <link href="https://arxiv.org/abs/2604.05012v2" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2604.05012v2" rel="related" type="application/pdf" title="pdf"/>
    <summary>Efficient inference with Large Language Models (LLMs) increasingly relies on Key-Value (KV) caches to store previously computed key and value vectors at each layer. These caches are essential to minimize redundant computation during autoregressive token generation, lowering computational complexity from quadratic to linear. However, the growth of KV caches has posed significant system-level challenges, particularly as model sizes increase, context lengths grow, and concurrent requests compete for limited memory resources. Even though several recent frameworks for KV cache management have emerged, their comparative trade-offs in memory consumption and inference performance have not been fully understood, especially under varying request sizes and model configurations. In this work, we conduct an empirical study of three state-of-the-art KV cache management frameworks: vLLM, InfiniGen, and H2O. These frameworks employ techniques such as tensor offloading, token eviction heuristics, and speculative scheduling to balance memory usage and performance. We evaluate their performance in terms of a range of metrics such as latency, throughput, and memory usage across a spectrum of key parameters including request rates, model sizes, and sparsity levels. Our results pinpoint the conditions for each framework to perform the best, revealing the most suitable selection and configuration of KV cache strategies under memory and performance constraints.</summary>
    <category term="cs.AR" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.AI" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-04-06T16:00:39Z</published>
    <arxiv:primary_category term="cs.AR"/>
    <author>
      <name>Oteo Mamo</name>
    </author>
    <author>
      <name>Olga Kogiou</name>
    </author>
    <author>
      <name>Hyunjin Yi</name>
    </author>
    <author>
      <name>Weikuan Yu</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2603.12759v1</id>
    <title>SAP: Segment Any 4K Panorama</title>
    <updated>2026-03-13T08:02:38Z</updated>
    <link href="https://arxiv.org/abs/2603.12759v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2603.12759v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Promptable instance segmentation is widely adopted in embodied and AR systems, yet the performance of foundation models trained on perspective imagery often degrades on 360° panoramas. In this paper, we introduce Segment Any 4K Panorama (SAP), a foundation model for 4K high-resolution panoramic instance-level segmentation. We reformulate panoramic segmentation as fixed-trajectory perspective video segmentation, decomposing a panorama into overlapping perspective patches sampled along a continuous spherical traversal. This memory-aligned reformulation preserves native 4K resolution while restoring the smooth viewpoint transitions required for stable cross-view propagation. To enable large-scale supervision, we synthesize 183,440 4K-resolution panoramic images with instance segmentation labels using the InfiniGen engine. Trained under this trajectory-aligned paradigm, SAP generalizes effectively to real-world 360° images, achieving +17.2 zero-shot mIoU gain over vanilla SAM2 of different sizes on real-world 4K panorama benchmark.</summary>
    <category term="cs.CV" scheme="http://arxiv.org/schemas/atom"/>
    <published>2026-03-13T08:02:38Z</published>
    <arxiv:comment>Project Page: https://lutao2021.github.io/SAP_Page/</arxiv:comment>
    <arxiv:primary_category term="cs.CV"/>
    <author>
      <name>Lutao Jiang</name>
    </author>
    <author>
      <name>Zidong Cao</name>
    </author>
    <author>
      <name>Weikai Chen</name>
    </author>
    <author>
      <name>Xu Zheng</name>
    </author>
    <author>
      <name>Yuanhuiyi Lyu</name>
    </author>
    <author>
      <name>Zhenyang Li</name>
    </author>
    <author>
      <name>Zeyu HU</name>
    </author>
    <author>
      <name>Yingda Yin</name>
    </author>
    <author>
      <name>Keyang Luo</name>
    </author>
    <author>
      <name>Runze Zhang</name>
    </author>
    <author>
      <name>Kai Yan</name>
    </author>
    <author>
      <name>Shengju Qian</name>
    </author>
    <author>
      <name>Haidi Fan</name>
    </author>
    <author>
      <name>Yifan Peng</name>
    </author>
    <author>
      <name>Xin Wang</name>
    </author>
    <author>
      <name>Hui Xiong</name>
    </author>
    <author>
      <name>Ying-Cong Chen</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2505.10755v3</id>
    <title>Procedural Generation of Articulated Simulation-Ready Assets</title>
    <updated>2025-10-28T11:05:00Z</updated>
    <link href="https://arxiv.org/abs/2505.10755v3" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2505.10755v3" rel="related" type="application/pdf" title="pdf"/>
    <summary>We introduce Infinigen-Articulated, a toolkit for generating realistic, procedurally generated articulated assets for robotics simulation. We include procedural generators for 18 common articulated object categories along with high-level utilities for use creating custom articulated assets in Blender. We also provide an export pipeline to integrate the resulting assets along with their physical properties into common robotics simulators. Experiments demonstrate that assets sampled from these generators are effective for movable object segmentation, training generalizable reinforcement learning policies, and sim-to-real transfer of imitation learning policies.</summary>
    <category term="cs.RO" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.GR" scheme="http://arxiv.org/schemas/atom"/>
    <published>2025-05-15T23:47:58Z</published>
    <arxiv:comment>Updated to include information on newly implemented assets, new experimental results (both simulation and real world), and additional features including material and dynamics parameters</arxiv:comment>
    <arxiv:primary_category term="cs.RO"/>
    <author>
      <name>Abhishek Joshi</name>
    </author>
    <author>
      <name>Beining Han</name>
    </author>
    <author>
      <name>Jack Nugent</name>
    </author>
    <author>
      <name>Max Gonzalez Saez-Diez</name>
    </author>
    <author>
      <name>Yiming Zuo</name>
    </author>
    <author>
      <name>Jonathan Liu</name>
    </author>
    <author>
      <name>Hongyu Wen</name>
    </author>
    <author>
      <name>Stamatis Alexandropoulos</name>
    </author>
    <author>
      <name>Karhan Kayan</name>
    </author>
    <author>
      <name>Anna Calveri</name>
    </author>
    <author>
      <name>Tao Sun</name>
    </author>
    <author>
      <name>Gaowen Liu</name>
    </author>
    <author>
      <name>Yi Shao</name>
    </author>
    <author>
      <name>Alexander Raistrick</name>
    </author>
    <author>
      <name>Jia Deng</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2406.19707v1</id>
    <title>InfiniGen: Efficient Generative Inference of Large Language Models with Dynamic KV Cache Management</title>
    <updated>2024-06-28T07:41:26Z</updated>
    <link href="https://arxiv.org/abs/2406.19707v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2406.19707v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>Transformer-based large language models (LLMs) demonstrate impressive performance across various natural language processing tasks. Serving LLM inference for generating long contents, however, poses a challenge due to the enormous memory footprint of the transient state, known as the key-value (KV) cache, which scales with the sequence length and batch size. In this paper, we present InfiniGen, a novel KV cache management framework tailored for long-text generation, which synergistically works with modern offloading-based inference systems. InfiniGen leverages the key insight that a few important tokens that are essential for computing the subsequent attention layer in the Transformer can be speculated by performing a minimal rehearsal with the inputs of the current layer and part of the query weight and key cache of the subsequent layer. This allows us to prefetch only the essential KV cache entries (without fetching them all), thereby mitigating the fetch overhead from the host memory in offloading-based LLM serving systems. Our evaluation on several representative LLMs shows that InfiniGen improves the overall performance of a modern offloading-based system by up to 3.00x compared to prior KV cache management methods while offering substantially better model accuracy.</summary>
    <category term="cs.LG" scheme="http://arxiv.org/schemas/atom"/>
    <category term="cs.DC" scheme="http://arxiv.org/schemas/atom"/>
    <published>2024-06-28T07:41:26Z</published>
    <arxiv:comment>OSDI 2024</arxiv:comment>
    <arxiv:primary_category term="cs.LG"/>
    <author>
      <name>Wonbeom Lee</name>
    </author>
    <author>
      <name>Jungi Lee</name>
    </author>
    <author>
      <name>Junghwan Seo</name>
    </author>
    <author>
      <name>Jaewoong Sim</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2406.11824v1</id>
    <title>Infinigen Indoors: Photorealistic Indoor Scenes using Procedural Generation</title>
    <updated>2024-06-17T17:57:50Z</updated>
    <link href="https://arxiv.org/abs/2406.11824v1" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2406.11824v1" rel="related" type="application/pdf" title="pdf"/>
    <summary>We introduce Infinigen Indoors, a Blender-based procedural generator of photorealistic indoor scenes. It builds upon the existing Infinigen system, which focuses on natural scenes, but expands its coverage to indoor scenes by introducing a diverse library of procedural indoor assets, including furniture, architecture elements, appliances, and other day-to-day objects. It also introduces a constraint-based arrangement system, which consists of a domain-specific language for expressing diverse constraints on scene composition, and a solver that generates scene compositions that maximally satisfy the constraints. We provide an export tool that allows the generated 3D objects and scenes to be directly used for training embodied agents in real-time simulators such as Omniverse and Unreal. Infinigen Indoors is open-sourced under the BSD license. Please visit https://infinigen.org for code and videos.</summary>
    <category term="cs.CV" scheme="http://arxiv.org/schemas/atom"/>
    <published>2024-06-17T17:57:50Z</published>
    <arxiv:comment>Accepted to CVPR 2024</arxiv:comment>
    <arxiv:primary_category term="cs.CV"/>
    <author>
      <name>Alexander Raistrick</name>
    </author>
    <author>
      <name>Lingjie Mei</name>
    </author>
    <author>
      <name>Karhan Kayan</name>
    </author>
    <author>
      <name>David Yan</name>
    </author>
    <author>
      <name>Yiming Zuo</name>
    </author>
    <author>
      <name>Beining Han</name>
    </author>
    <author>
      <name>Hongyu Wen</name>
    </author>
    <author>
      <name>Meenal Parakh</name>
    </author>
    <author>
      <name>Stamatis Alexandropoulos</name>
    </author>
    <author>
      <name>Lahav Lipson</name>
    </author>
    <author>
      <name>Zeyu Ma</name>
    </author>
    <author>
      <name>Jia Deng</name>
    </author>
  </entry>
  <entry>
    <id>http://arxiv.org/abs/2306.09310v2</id>
    <title>Infinite Photorealistic Worlds using Procedural Generation</title>
    <updated>2023-06-26T17:20:37Z</updated>
    <link href="https://arxiv.org/abs/2306.09310v2" rel="alternate" type="text/html"/>
    <link href="https://arxiv.org/pdf/2306.09310v2" rel="related" type="application/pdf" title="pdf"/>
    <summary>We introduce Infinigen, a procedural generator of photorealistic 3D scenes of the natural world. Infinigen is entirely procedural: every asset, from shape to texture, is generated from scratch via randomized mathematical rules, using no external source and allowing infinite variation and composition. Infinigen offers broad coverage of objects and scenes in the natural world including plants, animals, terrains, and natural phenomena such as fire, cloud, rain, and snow. Infinigen can be used to generate unlimited, diverse training data for a wide range of computer vision tasks including object detection, semantic segmentation, optical flow, and 3D reconstruction. We expect Infinigen to be a useful resource for computer vision research and beyond. Please visit https://infinigen.org for videos, code and pre-generated data.</summary>
    <category term="cs.CV" scheme="http://arxiv.org/schemas/atom"/>
    <published>2023-06-15T17:46:16Z</published>
    <arxiv:comment>Accepted to CVPR 2023, Camera Ready Version. Update 06/26/23: Change the open-source license to BSD</arxiv:comment>
    <arxiv:primary_category term="cs.CV"/>
    <author>
      <name>Alexander Raistrick</name>
    </author>
    <author>
      <name>Lahav Lipson</name>
    </author>
    <author>
      <name>Zeyu Ma</name>
    </author>
    <author>
      <name>Lingjie Mei</name>
    </author>
    <author>
      <name>Mingzhe Wang</name>
    </author>
    <author>
      <name>Yiming Zuo</name>
    </author>
    <author>
      <name>Karhan Kayan</name>
    </author>
    <author>
      <name>Hongyu Wen</name>
    </author>
    <author>
      <name>Beining Han</name>
    </author>
    <author>
      <name>Yihan Wang</name>
    </author>
    <author>
      <name>Alejandro Newell</name>
    </author>
    <author>
      <name>Hei Law</name>
    </author>
    <author>
      <name>Ankit Goyal</name>
    </author>
    <author>
      <name>Kaiyu Yang</name>
    </author>
    <author>
      <name>Jia Deng</name>
    </author>
  </entry>
</feed>
