Unverified50% confidenceBenchmarkExact time
A causal time-domain Morlet filter at the character scale cannot surpass the BASE-DOT baseline, because K=128 filter taps can only cover 50% of the T=256 context length.
1
Sources
50%
Confidence
Long-term
Relevance
10/4/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedIn terms of throughput, TwIL-LM3 reaches 32.9 answers/sec, while gpt-oss-120b achieves 12.6 answers/sec.58% similarUnverifiedIn tests on 2,456 held-out prompts, increasing the sampling steps from 20 to 50 improved FID only from 27.0 to 26.6 (a gain of 0.4), while removing the shift caused FID to rise from 27.0 to 27.3 and FD-DINOv2 to rise from 218 to 228.58% similarUnverifiedUsing the Qwen3-27B model on the wikitext-2 dataset with fp32 reference logits as a baseline for KL divergence measurement, the median KLD dropped from 0.0023 to 0.000001, an approximately 2300-fold improvement in precision.55% similarUnverifiedStadlmann compressed the upper bound to 240, and three days later GPT-6, following his method, compressed the upper bound to 186.55% similarUnverifiedThe K-Quants technique adopted by llama.cpp groups weights (typically 32 or 64 weights per group) and uses the K-means clustering algorithm on each group to find the optimal quantization codebook54% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/971782API
curl https://kongchang.com/api/v1/knowledge/claims/971782MCP
get_claim(id=971782)