ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Constrained decoding”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.AIRecentMay 28, 2026

Accelerating Constrained Decoding with Token Space Compression

Michael Sullivan, Alexander Koller

The paper introduces CFGzip, an offline token space compression technique that significantly reduces the computational overhead of constrained decoding, making complex grammar enforcement feasible at…

View →
cs.CLRecentJun 1, 2026

Mitigating Bias in Locally Constrained Decoding via Tractable Proposals

Meihua Dang, Linxin Song, Honghua Zhang, Jieyu Zhao +2 more

The paper proposes a novel probabilistic globally constrained decoding (P-GCD) method that efficiently constructs proposals for locally constrained decoding, significantly improving convergence speed…

View →
cs.SEcs.LGcs.PLEmpiricalRecentJun 19, 2026

The Alignment Problem in Constrained Code Generation

Matteo Biagiola, Jahrim Gabriele Cesario, Luca Di Grazia, George Zakhour +1 more

This paper investigates the effects of misalignment in constrained decoding for code generation and proposes ways to design better constrainers.

View →
cs.SEcs.PLEmpiricalRecentOct 26, 2026

AGDecode: Semantic Attribute Grammar Derivatives for Safety-Constrained Decoding of Large Language Models

Rajan Maghera, Asher Tempest Arya, Aren A. Babikian, Marsha Chechik +1 more

The paper presents a framework called AGDecode for enforcing semantic correctness in code generation using constrained decoding.

View →
cs.ITcs.AIcs.LGRecentMay 30, 2026

Information-Theoretic Lower Bounds for Bit-Constrained Stochastic Optimization via a Reduction to Compressed Gaussian Mean Estimation

Munsik Kim

The paper establishes information-theoretic lower bounds for stochastic optimization using low-bit gradients by reducing the problem to compressed Gaussian mean estimation, yielding sharp bounds on co…

View →
cs.LGcs.AIcs.ITRecentMay 27, 2026

Score Based Error Correcting Code Decoder

Alon Helvits, Eliya Nachmani

The paper introduces SB-ECC, a novel score-based decoder that models error correction as continuous-time denoising, achieving state-of-the-art performance across various code families and noise levels…

View →
quant-phcs.ITEmpiricalRecentJun 18, 2026

Approximating optimal decoding of quantum LDPC codes with narrow frontiers

Anthony Leverrier, Rüdiger Urbanke

The paper introduces the Frontier decoder, a pruned dynamic-programming decoder for sparse quantum decoding problems.

View →
cs.DSTheoreticalRecentJun 9, 2026

Average-Case and Smoothed Near-Optimality for Color-Code Decoding

Daniel Gibney, Jackson Huffstutler

The paper presents a block-based decoder for triangular color-code lattices that achieves strong average-case, smoothed, and sparse-regime guarantees.

View →
stat.MLcs.CCcs.DSTheoreticalRecentJul 7, 2026

Boosting with List-Decodable Codes

Addison Prairie, Li-Yang Tan

A new boosting algorithm that strong learns concept classes closed under O(log 1/γ)-XOR using O(log 1/ε) calls to a γ-advantage weak learner and additional samples, by connecting boosting with list-de…

View →
cs.ITmath.COTheoreticalRecentAug 6, 2026

Moment-based linear programming bounds for locally recoverable codes

Shujian Li, Hengjia Wei, Maosheng Xiong

This paper derives new linear programming bounds for q-ary (r,δ)-locally recoverable codes, improving upon previous bounds and applying to both linear and nonlinear codes.

View →
cs.AIEmpiricalRecentNov 4, 2026

Learning to Decode Linear Codes with Generalized Belief Propagation Network

Samira Malek

This paper proposes a Generalized Belief Propagation Network (GBPNet) for error correcting codes that outperforms conventional methods.

View →
cs.ITcs.NIEmpiricalRecentAug 15, 2026

ICL-SEC: Iterative Cross-Layer Semantic Error Correction

Yirun Wang, Soung Chang Liew, Yuyang Du

This paper proposes iterative cross-layer semantic error correction (ICL-SEC) framework for closing the loop between physical-layer decoder and application-level language model, using a Confirm prior-…

View →
cs.LGcs.CLstat.MLTheoreticalRecentJun 29, 2026

When Is a Draft Accepted? A Theory of Acceptance in Speculative Decoding

Aaryam Sharma

This paper develops a theory for speculative decoding in practical language model inference systems, where success is governed by local ranking and threshold events.

View →
cs.ITTheoreticalRecentJun 19, 2026

Error Exponent Bounds for Optimal Short-Read Clustering

Yoav Chachamovitz, Nir Weinberger

This paper derives bounds on the probability of incorrect clustering of noisy short sequences using statistically optimal rules, focusing on DNA storage decoders.

View →
cs.AIcs.CRRecentMay 27, 2026

An Empirical Audit of k-NAF Budget Accounting for Anchored Decoding

J. Vijayavallabh

The paper empirically audits the k-NAF budget accounting mechanism in Anchored Decoding, finding that observed high proxy spend ratios are likely artifacts rather than true budget exhaustion failures.

View →
cs.AIcs.CRRecentMay 27, 2026

An Empirical Audit of k-NAF Budget Accounting for Anchored Decoding

J. Vijayavallabh

The paper empirically audits the k-NAF budget accounting mechanism in Anchored Decoding, finding that observed high proxy spend ratios are likely artifacts rather than genuine budget exhaustion failur…

View →