Google engineers Ashok Chandrasekar and Jason Kramberger describe why published LLM inference benchmarks failed to reproduce: harnesses silently under-deliver load, inflate latency, and process data inconsistently. They present Inference Perf, a CNCF multiprocess load generator from the Kubernetes serving working group, plus the Prism UI from the llm-d project.
A user testing llama.cpp and exllama reports that benchmark token rates (50+ tks) consistently drop to around 40 tks in real-world chat or harness use, a 10-token drop across both backends. The discrepancy raises questions about benchmark validity for practical inference performance.
A user testing llama.cpp and exllama reports that benchmark token rates (50+ tks) consistently drop to around 40 tks in real-world chat or harness use, a 10-token drop across both backends. The discrepancy raises questions about benchmark validity for practical inference performance.
A developer built ShardFlow, a distributed LLM inference framework that splits HuggingFace transformers across GPU machines and uses neural speculative decoding to mitigate WAN latency. In a benchmark, it achieved 28 tokens per second on Qwen2.5-7B across two GCP regions connected via a public internet relay, turning per-token latency into per-round cost.
A developer built ShardFlow, a distributed LLM inference framework that splits HuggingFace transformers across GPU machines and uses neural speculative decoding to mitigate WAN latency. In a benchmark, it achieved 28 tokens per second on Qwen2.5-7B across two GCP regions connected via a public internet relay, turning per-token latency into per-round cost.
A preregistered arXiv study audits the assumption that requests sent to the same model name behave consistently over time, treating LLM judges as measurement instruments. Two preregistered campaigns with pre-fixed thresholds both failed to validate their instrument before any measurement, questioning the reliability of LLM-as-judge pipelines used for training data gating, generation scoring, and leaderboards.
A preregistered arXiv study audits the assumption that requests sent to the same model name behave consistently over time, treating LLM judges as measurement instruments. Two preregistered campaigns with pre-fixed thresholds both failed to validate their instrument before any measurement, questioning the reliability of LLM-as-judge pipelines used for training data gating, generation scoring, and leaderboards.
PolyServe is an open-source autotuner for LLM serving that benchmarks configurations across vLLM, SGLang, and llama.cpp, covering weight precision, KV cache, batching, and speculative decoding. It selects a configuration meeting the user's latency constraints and serves it, replacing fixed tuning heuristics. It targets self-hosters and engineers unsure how to optimize inference for their GPU setup.
PolyServe is an open-source autotuner for LLM serving that benchmarks configurations across vLLM, SGLang, and llama.cpp, covering weight precision, KV cache, batching, and speculative decoding. It selects a configuration meeting the user's latency constraints and serves it, replacing fixed tuning heuristics. It targets self-hosters and engineers unsure how to optimize inference for their GPU setup.
A developer documented how LLM inference stacks are not batch-invariant, causing different outputs even at temperature zero. They propose running repeated evaluations to compute a pass rate instead of relying on a single flaky result, combined with structured outputs and a calibrated judge for testing.
A developer documented how LLM inference stacks are not batch-invariant, causing different outputs even at temperature zero. They propose running repeated evaluations to compute a pass rate instead of relying on a single flaky result, combined with structured outputs and a calibrated judge for testing.