Event Tensor is a new compiler abstraction for dynamic megakernels that enables high-performance persistent GPU kernels with state-of-the-art LLM serving latency and reduced warmup overhead.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
verdicts
UNVERDICTED 5representative citing papers
SEVerA uses Formally Guarded Generative Models and a three-stage Search-Verification-Learning process to synthesize self-evolving agents that satisfy hard formal constraints while improving task performance.
MultiMat shows multimodal large models plus constrained search produce higher-quality procedural material graphs than text-only baselines on a new production dataset.
A generative model writes programs in a relational constraint DSL and uses bootstrapping to learn object placement distributions that align more closely with human annotations than data-driven or LLM baselines.
SWE-RL uses RL on software evolution data to train LLMs achieving 41% on SWE-bench Verified with generalization to other reasoning tasks.
citing papers explorer
-
Event Tensor: A Unified Abstraction for Compiling Dynamic Megakernel
Event Tensor is a new compiler abstraction for dynamic megakernels that enables high-performance persistent GPU kernels with state-of-the-art LLM serving latency and reduced warmup overhead.
-
SEVerA: Verified Synthesis of Self-Evolving Agents
SEVerA uses Formally Guarded Generative Models and a three-stage Search-Verification-Learning process to synthesize self-evolving agents that satisfy hard formal constraints while improving task performance.
-
MultiMat: Multimodal Program Synthesis for Procedural Materials using Large Multimodal Models
MultiMat shows multimodal large models plus constrained search produce higher-quality procedural material graphs than text-only baselines on a new production dataset.
-
Learning to Place Objects with Programs and Iterative Self Training
A generative model writes programs in a relational constraint DSL and uses bootstrapping to learn object placement distributions that align more closely with human annotations than data-driven or LLM baselines.
-
SWE-RL: Advancing LLM Reasoning via Reinforcement Learning on Open Software Evolution
SWE-RL uses RL on software evolution data to train LLMs achieving 41% on SWE-bench Verified with generalization to other reasoning tasks.