arXiv (All)
open access
Model Compression with Exact Budget Constraints via Riemannian Manifolds
Assigning one of K options to each of N groups under a total cost budget is a recurring problem in efficient AI, arising in mixed-precision quantization, non-uniform pruning, and expert selection. The objective (model loss) depends on all assignments jointly and does not decompose across groups, so
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
- An Introduction to Compression-Based Machine Learning#1035716
- A Power Law in Logarithm's Clothing: On the Scalability of Graph-Based Vector Search#822540
- Evaluation Choices Shape Biomedical ML Claims: A Pediatric Pneumonia Benchmark Case Study#1142156
- Cadence: Error-Bounded Lossy Compression of Demand Time Series with a Time-Series Foundation Model#673627
- Agentic Empirical Asset Pricing: Methodological Foundations#820744
Record · ID 1117384
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