arXiv (All)
open access
Suffix-Constrained Greedy Search Algorithms for Causal Language Models
Large language models (LLMs) are powerful tools that have found applications beyond human-machine interfaces and chatbots. Beside free-form generation, there has been an interest in constrained generation, a setting where LLMs are constrained to generate well-formed outputs with respect to the langu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Escaping Redundant Reasoning: Structure-Aware Search for Inference-Time LLMs#820751
- A Survey on Large Language Models for Code Generation#1135850
- ConfRAG: Confidence-Guided Retrieval-Augmenting Generation#927137
- Retrieval-augmented Decoding for Improving Truthfulness in Open-ended Generation#972942
- Hypothesis Generation with Large Language Models#328720
Record · ID 821428
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive