arXiv (All)
open access
Latent space configuration for neural network finetuning, fast ranking, and embedding dimensionality reduction
Finding K most similar elements for a query in a large gallery of neural network (NN) embeddings is essential in various areas of computer science and industrial applications of artificial intelligence. This paper proposes search algorithms for structured latent spaces (LS) of NNs which allow to spe
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
- Not all solutions are created equal: An analytical dissociation of functional and representational similarity in deep linear neural networks#1143965
- Graph-free Retrieval with Graph-Modified Embeddings#1343921
- Embedding Surgery: Localized Updates for Adaptive Ranking Correction in Dense Retrieval#972060
- m-a-p/Matrix#786879
- Knowledge-guided Pattern Discovery via Coupled Tensor Factorizations#451308
Record · ID 1413900
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