Cover Image

SpecTr: Fast Speculative Decoding via Optimal Transport

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sun, Ziteng, Suresh, Ananda Theertha, Ro, Jae Hun, Beirami, Ahmad, Jain, Himanshu, Yu, Felix
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Computation and Language Data Structures and Algorithms Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Block Verification Accelerates Speculative Decoding
by: Sun, Ziteng, et al.
Published: (2024)

Coupling without Communication and Drafter-Invariant Speculative Decoding
by: Daliri, Majid, et al.
Published: (2024)

Private federated discovery of out-of-vocabulary words for Gboard
by: Sun, Ziteng, et al.
Published: (2024)

Mean estimation in the add-remove model of differential privacy
by: Kulesza, Alex, et al.
Published: (2023)

Towards Optimal Multi-draft Speculative Decoding
by: Hu, Zhengmian, et al.
Published: (2025)

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding
by: Guruswami, Venkatesan, et al.
Published: (2023)

Time-Optimal Directed q-Analysis
by: Windisch, Felix, et al.
Published: (2025)

Convex Optimization with Local Label Differential Privacy: Tight Bounds in All Privacy Regimes
by: Chua, Lynn, et al.
Published: (2026)

E-Graphs as Circuits, and Optimal Extraction via Treewidth
by: Sun, Glenn, et al.
Published: (2024)

Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
by: Chen, Daoyuan, et al.
Published: (2024)

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
by: Cohen-Addad, Vincent, et al.
Published: (2025)

Optimal-Length Labeling Schemes and Fast Algorithms for k-gathering and k-broadcasting
by: Ganczorz, Adam, et al.
Published: (2025)

Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
by: Hochbaum, Dorit S., et al.
Published: (2025)

Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing
by: Chekuri, Chandra, et al.
Published: (2024)

Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
by: Ly, Hoang, et al.
Published: (2025)

List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

Provably Fast and Space-Efficient Parallel Biconnectivity
by: Dong, Xiaojun, et al.
Published: (2023)

Discrete Optimal Transport: Rapid Convergence of Simulated Annealing Algorithms
by: He, Yuchen, et al.
Published: (2026)

Fast exact algorithms via the Matrix Tree Theorem
by: Arvind, V., et al.
Published: (2025)

Designing Compact ILPs via Fast Witness Verification
by: Włodarczyk, Michał
Published: (2025)

Testing Robustness of Temporal Transportation Networks via Interval Separators
by: Dondi, Riccardo, et al.
Published: (2026)

Did Fourier Really Meet Möbius? Fast Subset Convolution via FFT
by: Stoian, Mihail
Published: (2024)

Two-Edge Connectivity via Pac-Man Gluing
by: Garg, Mohit, et al.
Published: (2024)

Approximation Algorithms for Network Design in Non-Uniform Fault Models
by: Chekuri, Chandra, et al.
Published: (2024)

Node-Weighted Multicut in Planar Digraphs
by: Chekuri, Chandra, et al.
Published: (2026)

A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs
by: Chekuri, Chandra, et al.
Published: (2024)

Optimal Non-Adaptive Tolerant Junta Testing via Local Estimators
by: Nadimpalli, Shivam, et al.
Published: (2024)

Fast White-Box Adversarial Streaming Without a Random Oracle
by: Feng, Ying, et al.
Published: (2024)

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods
by: Li, Gen, et al.
Published: (2023)

Effective Index Construction Algorithm for Optimal $(k,η)$-cores Computation
by: Sun, Shengli, et al.
Published: (2025)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
by: Xie, Fangzhou
Published: (2025)

On the Efficiency of Sinkhorn-Knopp for Entropically Regularized Optimal Transport
by: He, Kun
Published: (2026)

Fast Similarity Sketching
by: Dahlgaard, Søren, et al.
Published: (2017)

Efficient Algorithms to Compute Closed Substrings
by: Jain, Samkith K, et al.
Published: (2025)

Competitive Online Transportation Simplified
by: Arndt, Stephen, et al.
Published: (2025)

Fast and Optimal Differentially Private Frequent-Substring Mining
by: Guo, Peaker, et al.
Published: (2026)

Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps
by: Rutschmann, Daniel
Published: (2026)

Fast In-Spectrum Graph Watermarks
by: Bourrée, Jade Garcia, et al.
Published: (2025)

Fast Approximate Counting of Cycles
by: Censor-Hillel, Keren, et al.
Published: (2024)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
by: Oliveira, Mateus de Oliveira, et al.
Published: (2026)