arXiv (OAI Expanded)
open access
LLM Compression by Block Removal with Constrained Binary Optimization
In this paper, we formulate the compression of large language models (LLMs) by optimally deleting transformer blocks (``block removal'') as a constrained binary optimization (CBO) problem that can be mapped to a physical system (Ising glass), whose energies are a strong proxy for downstream model pe
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
- Decomposition of Sparse Integer Programs via Nonlinear Edge Encodings and Column-and-Row Generation#972716
- Replica Thresholds for Stripeless Erasure Coding Based on Symmetric Block Designs#1077078
- Lossy Compression via Sparse Regression Codes: Generalized Construction and Finite-length Bounds#609655
- IP Payload Compression Using LZS#137077
- Lanczos with compression for symmetric eigenvalue problems#635753
Record · ID 1069737
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