arXiv (All)
open access
Pushing Toward the Simplex Vertices: A Simple Remedy for Code Collapse in Smoothed Vector Quantization
Vector quantization, which discretizes a continuous vector space into a finite set of representative vectors (a codebook), has been widely adopted in modern machine learning. Despite its effectiveness, vector quantization poses a fundamental challenge: the non-differentiable quantization step blocks
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
- Learning Orthonormal Bases for Function Spaces#204802
- SSTQ:Privacy-Preserving Vector Quantization via Subsampled Stochastic TurboQuant#429345
- SuperPCA: subspace analysis and an efficient algorithm for high-dimensional PCA#1062301
- SuperPCA: subspace analysis and an efficient algorithm for high-dimensional PCA#1043109
- Farness Preserving Non-Negative Matrix Factorization#322226
Record · ID 1117249
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