paper.dinq.meAI 与前沿科学顶会 · 学术新星雷达
登录 DINQ
返回新星榜
HZ

Hossein Entezari Zarch

ACL 2026COLM 2026ICML 2026SIGIR 2026代码效率与系统推理安全检索与知识
新星分新星
77
一作贡献30
核心/参与22
方向广度19
合作网络9
1 一作 · 4 篇 · ACL 2026 / COLM 2026 / ICML 2026 / SIGIR 2026

获取完整研究档案

首次获取该候选人的完整档案及 StartLux 评估共 20 积分;每位用户单独解锁,之后查看免费。主动刷新 20 积分。

联系方式

实时查找电子邮箱,费用不超过20积分;未找到邮箱不扣费。

2026 顶会论文

4
作者位次 #2/5COLM 2026Poster· Poster Session 6· Imperial Ballroom· #8

ASPIRE: Asynchronous Batched Self-Speculative Decoding for Long-Context LLM Inference

Amir Ziashahabi · Hossein Entezari Zarch · Lei Gao · Murali Annavaram · Salman Avestimehr

ASPIRE is a non-synchronized batched self-speculative decoding framework that combines mixed draft/verify execution with adaptive batch-aware scheduling to improve long-context LLM throughput.

摘要

Long-context LLM inference is bottlenecked by attention, whose repeated KV-cache reads make decoding memory-bound. Self-speculative decoding alleviates this by drafting tokens with sparse attention and verifying them with full attention, but existing batched methods remain *synchronized*: all requests in a batch share a single draft-verify schedule, even though the optimal draft length varies widely across requests and changes dynamically within each request. We propose **ASPIRE**, a non-synchronized batched self-speculative decoding framework built on three components. First, a *unified mixed forward* allows drafting and verifying requests to coexist in the same batched forward pass, removing the need for global draft-verify phases. Second, a lightweight *online speculation scheduler* uses per-request acceptance-rate estimates and a batch-aware cost model to let each request independently choose when to verify. Third, an *intra-draft refresh layer* performs full attention at a single designated layer during drafting, updating the sparse context at every draft step to reduce staleness during drafting. Across three models and five reasoning and long-context benchmarks, ASPIRE achieves $1.70$-$4.58\times$ speedup in decoding throughput over autoregressive baselines and improves average speedup by approximately 27\% over the strongest prior self-speculative baselines. The code is available at https://github.com/Amir-zsh/ASPIRE.

效率与系统代码推理long-context LLM inferencespeculative decodingbatched LLM servingsparse attentionOpenReview
一作ACL 2026Findings· Findings of ACL

DELTA : Dynamic Layer-Aware Token Attention for Efficient Long-Context Reasoning

Hossein Entezari Zarch · Lei Gao · Chaoyi Jiang · Murali Annavaram

摘要

Large reasoning models (LRMs) achieve state-of-the-art performance on challenging benchmarks by generating long chains of intermediate steps, but their inference cost is dominated by decoding, where each new token must attend to the entire growing sequence. One approach to reduce this latency is...

效率与系统代码推理OpenReview 项目页
作者位次 #3/5SIGIR 2026Poster· Information Retrieval (Short)

HuffmanEmbed: Using Huffman Coding for Embedding Table Compression in Deep Learning Recommendation Models

Chaoyi Jiang · Abdulla Alshabanah · Hossein Entezari Zarch · Keshav Balasubramanian · Murali Annavaram

摘要

Deep Learning Recommendation Models (DLRMs) have become widely popular for click-through rate (CTR) prediction tasks. These models often rely on embedding tables to enhance their predictive performance. Each row in these tables represents a trainable weight vector associated with a specific featu...

检索与知识代码效率与系统OpenReview

常见合作者