arXiv (All)
open access
PACT: Pairwise-Anchored Calibrated Tuning for Single-Token Typed Decisions
artificial-intelligencecomputation-and-languagecomputer-science-and-game-theorycomputer-vision-and-pattern-recognition
Single-token typed-decision models answer a schema question by reading the logits of a few one-letter answer codes at a single position: they are fast and return a probability for every allowed answer, but they are trained with plain cross-entropy that ignores most of the structure in their training
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
- Masking Frequent Tokens Sharpens Direct Preference Optimization#1116776
- More Bang for the Buck: Improving the Inference of Large Language Models at a Fixed Budget using Reset and Discard (ReD)#986193
- Compiling Chemical Knowledge into Executable Descriptors for Materials Prediction#780893
- Compiling Chemical Knowledge into Executable Descriptors for Materials Prediction#779518
- Register Bias in Complexity-Based Large Language Model Routing#1011276
Record · ID 1130707
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