{"id":"05253916593219b5dc4124d664ae6d1f2643f532157c5df4060ca9d6b54b15d0","title":"Haiyu Wang and coauthors propose HybridSpec to speed speculative decoding","argument":"Haiyu Wang and coauthors present HybridSpec, a method for choosing how many draft tokens a target model checks in each round of speculative decoding. A draft proposes tokens in parallel; the target verifies them. Checking more tokens can accept more at once, but work after a rejection is wasted. The authors say this tradeoff is especially costly for hybrid models combining Gated DeltaNet (GDN) and mixture-of-experts (MoE) layers: verification time rose 71% between lengths 4 and 16 in their Qwen3.6-35B-A3B profile, compared with 4%-6% for a dense-model comparison.\n\nHybridSpec chooses the verification length using draft-side acceptance estimates and measured target latency. It also checks routing information before running experts, then uses observed expert assignments to decide whether to keep a token. The authors report that, in single-request greedy decoding with three GDN-MoE target models, HybridSpec was 1.75×-1.88× faster than autoregressive decoding and 1.30×-1.33× faster than DFlash. These results suggest the method may reduce decoding time in the tested setting; the abstract does not establish how it performs across broader workloads or serving conditions.\n\nHow does HybridSpec’s speedup change across workloads with different request sizes and draft-token acceptance rates?","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The abstract reports single-request results; it does not specify performance across concurrent requests or broader serving conditions. The isolated block-parallel GDN kernel comparison assumes every draft token is accepted, so it does not by itself establish kernel performance under rejection. The evidence is the paper’s abstract, which does not provide further benchmark methodology or results across varied request sizes and draft-token acceptance rates.","speaker":{"name":"Wang, Haiyu, Zhang, Sai Qian, Liu, Zechun, Li, Steven","roleAtSource":"Article author"},"source":{"title":"HybridSpec: Throughput-Aware Speculative Decoding for Hybrid GDN-MoE Models","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.04055","publishedAt":"2026-11-02","dateBasis":"Date basis not provided."},"evidence":[{"text":"The authors say verification time in their Qwen3.6-35B-A3B single-request profile grew 71% from verification length 4 to 16, compared with 4%-6% for a dense-model comparison.","excerpt":"In a single-request profile of Qwen3.6-35B-A3B with DFlash, it grew by 71% from length 4 to 16, almost entirely in GDN and MoE layers, compared with 4%-6% for a dense Qwen3-4B target.","url":"https://arxiv.org/abs/2611.04055","relationship":"Source-stated"},{"text":"HybridSpec selects verification length using draft-side acceptance estimates and measured target latency, and uses observed expert assignments to decide whether to keep a token.","excerpt":"selects the verification length on the GPU from draft-side acceptance estimates and measured target latency. Verification then runs this length plus one extra token up to the first MoE router, before any expert runs. There, a lightweight routing correction uses the observed expert assignments to dec","url":"https://arxiv.org/abs/2611.04055","relationship":"Source-stated"},{"text":"In single-request greedy decoding with three GDN-MoE target models, the authors report HybridSpec was 1.75×-1.88× faster than autoregressive decoding and 1.30×-1.33× faster than DFlash.","excerpt":"With three GDN-MoE target models in single-request greedy decoding, HybridSpec is $1.75\\times$-$1.88\\times$ faster than autoregressive decoding and $1.30\\times$-$1.33\\times$ faster than DFlash.","url":"https://arxiv.org/abs/2611.04055","relationship":"Source-stated"},{"text":"The reported results indicate speedups in the specified tests, but do not establish performance across broader workloads or serving conditions.","excerpt":"With three GDN-MoE target models in single-request greedy decoding, HybridSpec is $1.75\\times$-$1.88\\times$ faster than autoregressive decoding and $1.30\\times$-$1.33\\times$ faster than DFlash.","url":"https://arxiv.org/abs/2611.04055","relationship":"Escape Meridian interpretation"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.04055","checkedAt":"2026-11-10T06:20:10.188Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How does HybridSpec’s speedup change across workloads with different request sizes and draft-token acceptance rates?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Haiyu Wang and coauthors propose HybridSpec to speed speculative decoding","summary":"Haiyu Wang and coauthors present HybridSpec, a method for choosing how many draft tokens a target model checks in each round of speculative decoding. A draft proposes tokens in parallel; the target verifies them. Checking more tokens can accept more at once, but work after a rejection is wasted. The authors say this tradeoff is especially costly for hybrid models combining Gated DeltaNet (GDN) and mixture-of-experts (MoE) layers: verification time rose 71% between lengths 4 and 16 in their Qwen3.6-35B-A3B profile, compared with 4%-6% for a dense-model comparison.\n\nHybridSpec chooses the verification length using draft-side acceptance estimates and measured target latency. It also checks routing information before running experts, then uses observed expert assignments to decide whether to keep a token. The authors report that, in single-request greedy decoding with three GDN-MoE target models, HybridSpec was 1.75×-1.88× faster than autoregressive decoding and 1.30×-1.33× faster than DFlash. These results suggest the method may reduce decoding time in the tested setting; the abstract does not establish how it performs across broader workloads or serving conditions.\n\nHow does HybridSpec’s speedup change across workloads with different request sizes and draft-token acceptance rates?","question":"How does HybridSpec’s speedup change across workloads with different request sizes and draft-token acceptance rates?","claims":[{"text":"The authors say verification time in their Qwen3.6-35B-A3B single-request profile grew 71% from verification length 4 to 16, compared with 4%-6% for a dense-model comparison.","excerpt":"In a single-request profile of Qwen3.6-35B-A3B with DFlash, it grew by 71% from length 4 to 16, almost entirely in GDN and MoE layers, compared with 4%-6% for a dense Qwen3-4B target.","support":"source-stated"},{"text":"HybridSpec selects verification length using draft-side acceptance estimates and measured target latency, and uses observed expert assignments to decide whether to keep a token.","excerpt":"selects the verification length on the GPU from draft-side acceptance estimates and measured target latency. Verification then runs this length plus one extra token up to the first MoE router, before any expert runs. There, a lightweight routing correction uses the observed expert assignments to dec","support":"source-stated"},{"text":"In single-request greedy decoding with three GDN-MoE target models, the authors report HybridSpec was 1.75×-1.88× faster than autoregressive decoding and 1.30×-1.33× faster than DFlash.","excerpt":"With three GDN-MoE target models in single-request greedy decoding, HybridSpec is $1.75\\times$-$1.88\\times$ faster than autoregressive decoding and $1.30\\times$-$1.33\\times$ faster than DFlash.","support":"source-stated"},{"text":"The reported results indicate speedups in the specified tests, but do not establish performance across broader workloads or serving conditions.","excerpt":"With three GDN-MoE target models in single-request greedy decoding, HybridSpec is $1.75\\times$-$1.88\\times$ faster than autoregressive decoding and $1.30\\times$-$1.33\\times$ faster than DFlash.","support":"interpretation"}],"limitations":["The abstract reports single-request results; it does not specify performance across concurrent requests or broader serving conditions.","The isolated block-parallel GDN kernel comparison assumes every draft token is accepted, so it does not by itself establish kernel performance under rejection.","The evidence is the paper’s abstract, which does not provide further benchmark methodology or results across varied request sizes and draft-token acceptance rates."],"mediaId":"269b7177a473d7d72069aee5c6beecc39ff8f3a2561a5e790c10c007f53dce39","correctionReason":null,"id":"05253916593219b5dc4124d664ae6d1f2643f532157c5df4060ca9d6b54b15d0","publicationId":"98f8c2bd-7509-4137-8af5-aa0d3027a4b9","version":1,"sourceUrl":"https://arxiv.org/abs/2611.04055","sourceTitle":"HybridSpec: Throughput-Aware Speculative Decoding for Hybrid GDN-MoE Models","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-02","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-04T05:15:26.455Z","createdAt":"2026-11-10T05:16:49.959Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"269b7177a473d7d72069aee5c6beecc39ff8f3a2561a5e790c10c007f53dce39","kind":"article","url":"https://arxiv.org/abs/2611.04055","sourceUrl":"https://arxiv.org/abs/2611.04055","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-04T06:32:26.968Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.04055","checkedAt":"2026-11-10T06:20:10.188Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"269b7177a473d7d72069aee5c6beecc39ff8f3a2561a5e790c10c007f53dce39","confidence":0.93,"provider":"typesafe","model":"jev-1.13.0","inputHash":"9c77b75bd3d4be892bd6773677c339b4e1df38471679a221f483a7bdbced0a68","decidedAt":"2026-11-04T06:32:30.427Z"},"provenance":{"textHash":"978748444196c7ed0ad6711271179d812f0693ef1a6a7a2093a8ce3de5fa99c3","observationId":"9a5fa7c6e6142091e3558d8e031a183a161d92ec168cf61a56812c18fbbdf463","retrievedAt":"2026-11-04T06:32:26.448Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"1bcdd65d-7da4-429d-81bc-e31784cb61d2"},"reviewer":{"model":"gpt-6-luna","runId":"b0d5a4c8-60fc-4113-8a22-23db1acd2e23"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-10T05:16:49.959Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Wang, Haiyu","url":null,"kind":"unknown"},{"name":"Zhang, Sai Qian","url":null,"kind":"unknown"},{"name":"Liu, Zechun","url":null,"kind":"unknown"},{"name":"Li, Steven","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Wang, Haiyu","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Wang, Haiyu","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.04055","locator":"head/meta[name=author|citation_author]"},"assertionId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T06:20:10.188Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5","sourceUrl":"https://arxiv.org/abs/2611.04055","contentSha256":"3a35bc4c353728aeb9dc0fef6b4bad51b20666705c0059bd704dd951b3c1542e","textHash":"978748444196c7ed0ad6711271179d812f0693ef1a6a7a2093a8ce3de5fa99c3","observedAt":"2026-11-10T06:20:10.188Z"}},{"actor":{"name":"Zhang, Sai Qian","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Zhang, Sai Qian","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.04055","locator":"head/meta[name=author|citation_author]"},"assertionId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T06:20:10.188Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5","sourceUrl":"https://arxiv.org/abs/2611.04055","contentSha256":"3a35bc4c353728aeb9dc0fef6b4bad51b20666705c0059bd704dd951b3c1542e","textHash":"978748444196c7ed0ad6711271179d812f0693ef1a6a7a2093a8ce3de5fa99c3","observedAt":"2026-11-10T06:20:10.188Z"}},{"actor":{"name":"Liu, Zechun","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Liu, Zechun","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.04055","locator":"head/meta[name=author|citation_author]"},"assertionId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5:participation:2","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T06:20:10.188Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5","sourceUrl":"https://arxiv.org/abs/2611.04055","contentSha256":"3a35bc4c353728aeb9dc0fef6b4bad51b20666705c0059bd704dd951b3c1542e","textHash":"978748444196c7ed0ad6711271179d812f0693ef1a6a7a2093a8ce3de5fa99c3","observedAt":"2026-11-10T06:20:10.188Z"}},{"actor":{"name":"Li, Steven","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Li, Steven","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.04055","locator":"head/meta[name=author|citation_author]"},"assertionId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5:participation:3","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T06:20:10.188Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5","sourceUrl":"https://arxiv.org/abs/2611.04055","contentSha256":"3a35bc4c353728aeb9dc0fef6b4bad51b20666705c0059bd704dd951b3c1542e","textHash":"978748444196c7ed0ad6711271179d812f0693ef1a6a7a2093a8ce3de5fa99c3","observedAt":"2026-11-10T06:20:10.188Z"}}],"participationCoverage":{"total":4,"returned":4,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.04055","snapshotId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5","contentSha256":"3a35bc4c353728aeb9dc0fef6b4bad51b20666705c0059bd704dd951b3c1542e","textHash":"978748444196c7ed0ad6711271179d812f0693ef1a6a7a2093a8ce3de5fa99c3","observedAt":"2026-11-10T06:20:10.188Z","basis":"publisher-page-metadata","sourceLinks":43,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/05253916593219b5dc4124d664ae6d1f2643f532157c5df4060ca9d6b54b15d0/source"}},"canonicalUrl":"https://escapemeridian.com/readings/haiyu-wang-and-coauthors-propose-hybridspec-to-speed-05253916","formats":{"html":"/readings/haiyu-wang-and-coauthors-propose-hybridspec-to-speed-05253916","markdown":"/readings/haiyu-wang-and-coauthors-propose-hybridspec-to-speed-05253916.md","json":"/readings/haiyu-wang-and-coauthors-propose-hybridspec-to-speed-05253916.json"},"attribution":"Headline and summary by Escape Meridian, prepared by Luna from the attributed source. A source check is not independent confirmation of the source’s claims.","maintainedGuideLinks":[],"readerContext":{"version":"reader-context-v1","attribution":"Reference context selected by Escape Meridian; separate from source evidence. Entity mentions do not establish authorship, involvement or endorsement.","terms":[{"id":"term-mixture-of-experts","name":"Mixture of experts","explanation":"A model design that sends each input to a few specialized sub-networks instead of the whole model, which saves computation.","referenceUrl":"https://developers.google.com/machine-learning/glossary#mixture-of-experts"},{"id":"term-latency","name":"Latency","explanation":"The delay between sending a request and receiving the result.","referenceUrl":"https://developers.google.com/machine-learning/glossary#latency"},{"id":"term-benchmark","name":"Benchmark","explanation":"A defined set of tests used to compare systems. Results depend on the tasks and measures selected.","referenceUrl":"https://arxiv.org/abs/2211.09110"}],"entities":[{"id":"arxiv","name":"arXiv","kind":"organization","context":"arXiv is a research manuscript repository where authors share papers that may not yet have been peer reviewed.","referenceUrls":["https://arxiv.org/","https://info.arxiv.org/help/api/index.html"],"path":"/entities/arxiv","json":"/entities/arxiv.json","markdown":"/entities/arxiv.md"},{"id":"time","name":"TIME","kind":"organization","context":"TIME is a news magazine publishing reporting on world affairs, business, technology and the workers behind digital services.","referenceUrls":["https://time.com/"],"path":"/entities/time","json":"/entities/time.json","markdown":"/entities/time.md"}]},"researchQuestions":[],"withdrawn":false,"references":{"schemaVersion":1,"target":{"type":"reading","id":"05253916593219b5dc4124d664ae6d1f2643f532157c5df4060ca9d6b54b15d0","revision":"98f8c2bd-7509-4137-8af5-aa0d3027a4b9","revisionKind":"publication-id","title":"Haiyu Wang and coauthors propose HybridSpec to speed speculative decoding","url":"https://escapemeridian.com/readings/haiyu-wang-and-coauthors-propose-hybridspec-to-speed-05253916"},"source":{"type":"source","id":"https://arxiv.org/abs/2611.04055","revision":"978748444196c7ed0ad6711271179d812f0693ef1a6a7a2093a8ce3de5fa99c3","revisionKind":"sha256-source-text","title":"HybridSpec: Throughput-Aware Speculative Decoding for Hybrid GDN-MoE Models","url":"https://arxiv.org/abs/2611.04055"},"status":"available","items":[],"next":null,"scope":"Explicit citations in public readings and public file attachments to this reading. Shared topics are not citations. Other artifact types need an explicit reference adapter."},"revisions":[{"id":"05253916593219b5dc4124d664ae6d1f2643f532157c5df4060ca9d6b54b15d0","title":"Haiyu Wang and coauthors propose HybridSpec to speed speculative decoding","argument":"Haiyu Wang and coauthors present HybridSpec, a method for choosing how many draft tokens a target model checks in each round of speculative decoding. A draft proposes tokens in parallel; the target verifies them. Checking more tokens can accept more at once, but work after a rejection is wasted. The authors say this tradeoff is especially costly for hybrid models combining Gated DeltaNet (GDN) and mixture-of-experts (MoE) layers: verification time rose 71% between lengths 4 and 16 in their Qwen3.6-35B-A3B profile, compared with 4%-6% for a dense-model comparison.\n\nHybridSpec chooses the verification length using draft-side acceptance estimates and measured target latency. It also checks routing information before running experts, then uses observed expert assignments to decide whether to keep a token. The authors report that, in single-request greedy decoding with three GDN-MoE target models, HybridSpec was 1.75×-1.88× faster than autoregressive decoding and 1.30×-1.33× faster than DFlash. These results suggest the method may reduce decoding time in the tested setting; the abstract does not establish how it performs across broader workloads or serving conditions.\n\nHow does HybridSpec’s speedup change across workloads with different request sizes and draft-token acceptance rates?","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The abstract reports single-request results; it does not specify performance across concurrent requests or broader serving conditions. The isolated block-parallel GDN kernel comparison assumes every draft token is accepted, so it does not by itself establish kernel performance under rejection. The evidence is the paper’s abstract, which does not provide further benchmark methodology or results across varied request sizes and draft-token acceptance rates.","speaker":{"name":"Wang, Haiyu, Zhang, Sai Qian, Liu, Zechun, Li, Steven","roleAtSource":"Article author"},"source":{"title":"HybridSpec: Throughput-Aware Speculative Decoding for Hybrid GDN-MoE Models","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.04055","publishedAt":"2026-11-02","dateBasis":"Date basis not provided."},"evidence":[{"text":"The authors say verification time in their Qwen3.6-35B-A3B single-request profile grew 71% from verification length 4 to 16, compared with 4%-6% for a dense-model comparison.","excerpt":"In a single-request profile of Qwen3.6-35B-A3B with DFlash, it grew by 71% from length 4 to 16, almost entirely in GDN and MoE layers, compared with 4%-6% for a dense Qwen3-4B target.","url":"https://arxiv.org/abs/2611.04055","relationship":"Source-stated"},{"text":"HybridSpec selects verification length using draft-side acceptance estimates and measured target latency, and uses observed expert assignments to decide whether to keep a token.","excerpt":"selects the verification length on the GPU from draft-side acceptance estimates and measured target latency. Verification then runs this length plus one extra token up to the first MoE router, before any expert runs. There, a lightweight routing correction uses the observed expert assignments to dec","url":"https://arxiv.org/abs/2611.04055","relationship":"Source-stated"},{"text":"In single-request greedy decoding with three GDN-MoE target models, the authors report HybridSpec was 1.75×-1.88× faster than autoregressive decoding and 1.30×-1.33× faster than DFlash.","excerpt":"With three GDN-MoE target models in single-request greedy decoding, HybridSpec is $1.75\\times$-$1.88\\times$ faster than autoregressive decoding and $1.30\\times$-$1.33\\times$ faster than DFlash.","url":"https://arxiv.org/abs/2611.04055","relationship":"Source-stated"},{"text":"The reported results indicate speedups in the specified tests, but do not establish performance across broader workloads or serving conditions.","excerpt":"With three GDN-MoE target models in single-request greedy decoding, HybridSpec is $1.75\\times$-$1.88\\times$ faster than autoregressive decoding and $1.30\\times$-$1.33\\times$ faster than DFlash.","url":"https://arxiv.org/abs/2611.04055","relationship":"Escape Meridian interpretation"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.04055","checkedAt":"2026-11-10T06:20:10.188Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How does HybridSpec’s speedup change across workloads with different request sizes and draft-token acceptance rates?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Haiyu Wang and coauthors propose HybridSpec to speed speculative decoding","summary":"Haiyu Wang and coauthors present HybridSpec, a method for choosing how many draft tokens a target model checks in each round of speculative decoding. A draft proposes tokens in parallel; the target verifies them. Checking more tokens can accept more at once, but work after a rejection is wasted. The authors say this tradeoff is especially costly for hybrid models combining Gated DeltaNet (GDN) and mixture-of-experts (MoE) layers: verification time rose 71% between lengths 4 and 16 in their Qwen3.6-35B-A3B profile, compared with 4%-6% for a dense-model comparison.\n\nHybridSpec chooses the verification length using draft-side acceptance estimates and measured target latency. It also checks routing information before running experts, then uses observed expert assignments to decide whether to keep a token. The authors report that, in single-request greedy decoding with three GDN-MoE target models, HybridSpec was 1.75×-1.88× faster than autoregressive decoding and 1.30×-1.33× faster than DFlash. These results suggest the method may reduce decoding time in the tested setting; the abstract does not establish how it performs across broader workloads or serving conditions.\n\nHow does HybridSpec’s speedup change across workloads with different request sizes and draft-token acceptance rates?","question":"How does HybridSpec’s speedup change across workloads with different request sizes and draft-token acceptance rates?","claims":[{"text":"The authors say verification time in their Qwen3.6-35B-A3B single-request profile grew 71% from verification length 4 to 16, compared with 4%-6% for a dense-model comparison.","excerpt":"In a single-request profile of Qwen3.6-35B-A3B with DFlash, it grew by 71% from length 4 to 16, almost entirely in GDN and MoE layers, compared with 4%-6% for a dense Qwen3-4B target.","support":"source-stated"},{"text":"HybridSpec selects verification length using draft-side acceptance estimates and measured target latency, and uses observed expert assignments to decide whether to keep a token.","excerpt":"selects the verification length on the GPU from draft-side acceptance estimates and measured target latency. Verification then runs this length plus one extra token up to the first MoE router, before any expert runs. There, a lightweight routing correction uses the observed expert assignments to dec","support":"source-stated"},{"text":"In single-request greedy decoding with three GDN-MoE target models, the authors report HybridSpec was 1.75×-1.88× faster than autoregressive decoding and 1.30×-1.33× faster than DFlash.","excerpt":"With three GDN-MoE target models in single-request greedy decoding, HybridSpec is $1.75\\times$-$1.88\\times$ faster than autoregressive decoding and $1.30\\times$-$1.33\\times$ faster than DFlash.","support":"source-stated"},{"text":"The reported results indicate speedups in the specified tests, but do not establish performance across broader workloads or serving conditions.","excerpt":"With three GDN-MoE target models in single-request greedy decoding, HybridSpec is $1.75\\times$-$1.88\\times$ faster than autoregressive decoding and $1.30\\times$-$1.33\\times$ faster than DFlash.","support":"interpretation"}],"limitations":["The abstract reports single-request results; it does not specify performance across concurrent requests or broader serving conditions.","The isolated block-parallel GDN kernel comparison assumes every draft token is accepted, so it does not by itself establish kernel performance under rejection.","The evidence is the paper’s abstract, which does not provide further benchmark methodology or results across varied request sizes and draft-token acceptance rates."],"mediaId":"269b7177a473d7d72069aee5c6beecc39ff8f3a2561a5e790c10c007f53dce39","correctionReason":null,"id":"05253916593219b5dc4124d664ae6d1f2643f532157c5df4060ca9d6b54b15d0","publicationId":"98f8c2bd-7509-4137-8af5-aa0d3027a4b9","version":1,"sourceUrl":"https://arxiv.org/abs/2611.04055","sourceTitle":"HybridSpec: Throughput-Aware Speculative Decoding for Hybrid GDN-MoE Models","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-02","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-04T05:15:26.455Z","createdAt":"2026-11-10T05:16:49.959Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"269b7177a473d7d72069aee5c6beecc39ff8f3a2561a5e790c10c007f53dce39","kind":"article","url":"https://arxiv.org/abs/2611.04055","sourceUrl":"https://arxiv.org/abs/2611.04055","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-04T06:32:26.968Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.04055","checkedAt":"2026-11-10T06:20:10.188Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"269b7177a473d7d72069aee5c6beecc39ff8f3a2561a5e790c10c007f53dce39","confidence":0.93,"provider":"typesafe","model":"jev-1.13.0","inputHash":"9c77b75bd3d4be892bd6773677c339b4e1df38471679a221f483a7bdbced0a68","decidedAt":"2026-11-04T06:32:30.427Z"},"provenance":{"textHash":"978748444196c7ed0ad6711271179d812f0693ef1a6a7a2093a8ce3de5fa99c3","observationId":"9a5fa7c6e6142091e3558d8e031a183a161d92ec168cf61a56812c18fbbdf463","retrievedAt":"2026-11-04T06:32:26.448Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"1bcdd65d-7da4-429d-81bc-e31784cb61d2"},"reviewer":{"model":"gpt-6-luna","runId":"b0d5a4c8-60fc-4113-8a22-23db1acd2e23"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-10T05:16:49.959Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Wang, Haiyu","url":null,"kind":"unknown"},{"name":"Zhang, Sai Qian","url":null,"kind":"unknown"},{"name":"Liu, Zechun","url":null,"kind":"unknown"},{"name":"Li, Steven","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Wang, Haiyu","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Wang, Haiyu","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.04055","locator":"head/meta[name=author|citation_author]"},"assertionId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T06:20:10.188Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5","sourceUrl":"https://arxiv.org/abs/2611.04055","contentSha256":"3a35bc4c353728aeb9dc0fef6b4bad51b20666705c0059bd704dd951b3c1542e","textHash":"978748444196c7ed0ad6711271179d812f0693ef1a6a7a2093a8ce3de5fa99c3","observedAt":"2026-11-10T06:20:10.188Z"}},{"actor":{"name":"Zhang, Sai Qian","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Zhang, Sai Qian","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.04055","locator":"head/meta[name=author|citation_author]"},"assertionId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T06:20:10.188Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5","sourceUrl":"https://arxiv.org/abs/2611.04055","contentSha256":"3a35bc4c353728aeb9dc0fef6b4bad51b20666705c0059bd704dd951b3c1542e","textHash":"978748444196c7ed0ad6711271179d812f0693ef1a6a7a2093a8ce3de5fa99c3","observedAt":"2026-11-10T06:20:10.188Z"}},{"actor":{"name":"Liu, Zechun","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Liu, Zechun","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.04055","locator":"head/meta[name=author|citation_author]"},"assertionId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5:participation:2","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T06:20:10.188Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5","sourceUrl":"https://arxiv.org/abs/2611.04055","contentSha256":"3a35bc4c353728aeb9dc0fef6b4bad51b20666705c0059bd704dd951b3c1542e","textHash":"978748444196c7ed0ad6711271179d812f0693ef1a6a7a2093a8ce3de5fa99c3","observedAt":"2026-11-10T06:20:10.188Z"}},{"actor":{"name":"Li, Steven","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Li, Steven","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.04055","locator":"head/meta[name=author|citation_author]"},"assertionId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5:participation:3","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T06:20:10.188Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5","sourceUrl":"https://arxiv.org/abs/2611.04055","contentSha256":"3a35bc4c353728aeb9dc0fef6b4bad51b20666705c0059bd704dd951b3c1542e","textHash":"978748444196c7ed0ad6711271179d812f0693ef1a6a7a2093a8ce3de5fa99c3","observedAt":"2026-11-10T06:20:10.188Z"}}],"participationCoverage":{"total":4,"returned":4,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.04055","snapshotId":"48b3eb48a28fb75cd4eca8f4f18b6c23f3df106b431a6e0f404133f43ce23fe5","contentSha256":"3a35bc4c353728aeb9dc0fef6b4bad51b20666705c0059bd704dd951b3c1542e","textHash":"978748444196c7ed0ad6711271179d812f0693ef1a6a7a2093a8ce3de5fa99c3","observedAt":"2026-11-10T06:20:10.188Z","basis":"publisher-page-metadata","sourceLinks":43,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/05253916593219b5dc4124d664ae6d1f2643f532157c5df4060ca9d6b54b15d0/source"}}}],"audits":[{"publicationId":"98f8c2bd-7509-4137-8af5-aa0d3027a4b9","verdict":"uncertain","findings":[{"dimension":"attribution","status":"pass","explanation":"The draft correctly attributes the HybridSpec work and its reported measurements to Haiyu Wang and coauthors, the arXiv authors. It frames the results as the authors' claims rather than established fact.","excerpt":"Authors:Haiyu Wang, Sai Qian Zhang, Zechun Liu, Steven Li"},{"dimension":"summary","status":"uncertain","explanation":"The draft is broadly faithful but may not be clear to a general reader. 'Autoregressive decoding', 'greedy decoding', 'DFlash', 'experts' and 'router' are central but unexplained. DFlash is the baseline, and the draft does not say it is a parallel drafter. The draft also drops the source's explanation of why hybrid verification is costly: GDN layers update and recover a recurrent state, and MoE cost depends on which experts the tokens activate. It omits the block-parallel GDN kernel contribution as well. Smallest repair: add one plain-language line on each mechanism and identify DFlash as the parallel drafter baseline.","excerpt":"Each GDN layer must update a recurrent state at every token and recover it at the end of the accepted prefix. The MoE cost depends on the experts that the tokens activate, which are known only once verification runs."},{"dimension":"date","status":"pass","explanation":"The originalPublished date of 2026-11-02 matches the arXiv v1 submission date. This is the first publication, not the later feed entry.","excerpt":"[Submitted on 2 Nov 2026]"},{"dimension":"support","status":"pass","explanation":"The 71% versus 4%-6% profile, the method description and the 1.75x-1.88x and 1.30x-1.33x speedups are all source-stated. The interpretation is appropriately conditional. The limitations accurately note the single-request scope and the all-accepted kernel benchmark. The question follows from the evidence, though 'request sizes' loosely stands in for concurrency or batching.","excerpt":"In isolated benchmarks at verification lengths 4 to 16 with every draft token accepted"},{"dimension":"media","status":"pass","explanation":"The selected media is the verified direct arXiv abstract page for this paper, which is the most direct access to the source.","excerpt":null}],"createdAt":"2026-11-10T05:16:49.959Z","model":"anthropic/claude-opus-5.5"}],"correctionUrl":"https://escapemeridian.com/corrections/"}