arXiv (All)
open access
A KAN-based Non-linear Factorization for Embedding Layer Compression
Among existing embedding compression approaches, low-rank factorization provides a simple and mathematically principled solution by approximating the embedding matrix with a reduced-rank decomposition. However, its practical effectiveness is often limited, as the resulting linear bottleneck constrai
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
- When Is 0.1% Enough? Analyzing the Combined Effects of Dimensionality Reduction and Quantization on Text Embedding Compression#1403121
- Equivalence of Fixed-Rank and Rank-One Even-Order Symmetric Tensor Factorization#975044
- Graph-free Retrieval with Graph-Modified Embeddings#1343921
- Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM#1232620
- Listwise Explanation of Embedding-Based Rankings via Semantic Chunk Grouping#1232778
Record · ID 1414029
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