20 results for “Constrained decoding”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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…
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…
This paper investigates the effects of misalignment in constrained decoding for code generation and proposes ways to design better constrainers.
The paper presents a framework called AGDecode for enforcing semantic correctness in code generation using constrained decoding.
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…
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…
The paper introduces the Frontier decoder, a pruned dynamic-programming decoder for sparse quantum decoding problems.
The paper presents a block-based decoder for triangular color-code lattices that achieves strong average-case, smoothed, and sparse-regime guarantees.
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…
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.
This paper proposes a Generalized Belief Propagation Network (GBPNet) for error correcting codes that outperforms conventional methods.
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-…
This paper develops a theory for speculative decoding in practical language model inference systems, where success is governed by local ranking and threshold events.
This paper derives bounds on the probability of incorrect clustering of noisy short sequences using statistically optimal rules, focusing on DNA storage decoders.
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.
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…