A particle scheme based on implicit Euler time stepping and spatial sampling is proved to converge for first-order MFGs under displacement monotonicity, handling non-separable Hamiltonians and singular data for arbitrary horizons.
Max , Quantizing for minimum distortion , Trans
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
UltraQuant applies 4-bit KV caching with TurboQuant-style rotation and custom AMD kernels to context-heavy agent workloads, delivering 3.47x P50 TTFT reduction in cache-pressured rounds and 1.63x throughput gain over FP8.
citing papers explorer
-
Numerical analysis of first-order mean field games under displacement monotonicity
A particle scheme based on implicit Euler time stepping and spatial sampling is proved to converge for first-order MFGs under displacement monotonicity, handling non-separable Hamiltonians and singular data for arbitrary horizons.
-
UltraQuant: 4-bit KV Caching for Context-Heavy Agents
UltraQuant applies 4-bit KV caching with TurboQuant-style rotation and custom AMD kernels to context-heavy agent workloads, delivering 3.47x P50 TTFT reduction in cache-pressured rounds and 1.63x throughput gain over FP8.