arXiv (All)
open access
PC-SubMax: Efficient Prompt Compression via Regularized Submodular Maximization
While large language models (LLMs) are increasingly deployed in long-context scenarios, lengthy prompts can increase inference costs and latency and exacerbate the ``lost-in-the-middle'' phenomenon. Selective prompt compression offers a model-agnostic approach to alleviating these issues. However, m
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
- FrugalPrompt: Reducing Contextual Overhead in Large Language Models via Token Attribution#972975
- Optimizing Large Language Models: Metrics, Energy Efficiency, and Case Study Insights#139146
- Learning an Anchored Prompt Space for Continual Adaptation of Large Language Models#1116830
- The Intrinsic Dimension of Prompts in Internal Representations of Large Language Models#662354
- The Intrinsic Dimension of Prompts in Internal Representations of Large Language Models#661304
Record · ID 1116805
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