On the public citation graph
[Invited Paper] A Survey of Product Quantization
0 signed · 126 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-319-46475-6_9openalex-snapshot
Revisiting Additive Quantization
inferredcites →https://doi.org/10.1007/978-3-319-46478-7_42openalex-snapshot
Approximate Search with Quantized Sparse Representations
inferredcites →https://doi.org/10.1007/978-3-319-46493-0_32openalex-snapshot
XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networks
inferredcites →https://doi.org/10.1007/978-3-642-41062-8_28openalex-snapshot
Engineering Efficient and Effective Non-metric Space Library
inferredcites →https://doi.org/10.1016/b978-0-08-051584-7.50011-5openalex-snapshot
Vector Quantization
inferredcites →https://doi.org/10.1109/cvpr.2010.5540039openalex-snapshot
Aggregating local descriptors into a compact image representation
inferredcites →https://doi.org/10.1109/cvpr.2013.378openalex-snapshot
K-Means Hashing: An Affinity-Preserving Quantization Method for Learning Binary Compact Codes
inferredcites →https://doi.org/10.1109/cvpr.2014.124openalex-snapshot
Additive Quantization for Extreme Vector Compression
inferredcites →https://doi.org/10.1109/cvpr.2014.274openalex-snapshot
Distance Encoded Product Quantization
inferredcites →https://doi.org/10.1109/cvpr.2014.298openalex-snapshot
Locally Optimized Product Quantization for Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.1109/cvpr.2015.7299052openalex-snapshot
Tree quantization for large-scale similarity search and classification
inferredcites →https://doi.org/10.1109/cvpr.2015.7299085openalex-snapshot
Sparse composite quantization
inferredcites →https://doi.org/10.1109/cvpr.2016.221openalex-snapshot
Shortlist Selection with Residual-Aware Distance Estimator for K-Nearest Neighbor Search
inferredcites →https://doi.org/10.1109/cvpr.2016.222openalex-snapshot
Supervised Quantization for Similarity Search
inferredcites →https://doi.org/10.1109/cvpr.2016.223openalex-snapshot
Efficient Large-Scale Approximate Nearest Neighbor Search on the GPU
inferredcites →https://doi.org/10.1109/cvpr.2016.224openalex-snapshot
Collaborative Quantization for Cross-Modal Similarity Search
inferredcites →https://doi.org/10.1109/cvpr.2016.226openalex-snapshot
Efficient Indexing of Billion-Scale Datasets of Deep Descriptors
inferredcites →https://doi.org/10.1109/cvpr.2016.521openalex-snapshot
Quantized Convolutional Neural Networks for Mobile Devices
inferredcites →https://doi.org/10.1109/cvpr.2017.98openalex-snapshot
LCNN: Lookup-Based Convolutional Neural Network
inferredcites →https://doi.org/10.1109/icassp.2011.5946540openalex-snapshot
Searching in one billion vectors: Re-rank with source coding
inferredcites →https://doi.org/10.1109/icassp.2013.6638949openalex-snapshot
Low-rank matrix factorization for Deep Neural Network training with high-dimensional output targets
inferredcites →https://doi.org/10.1109/icassp.2017.7952453openalex-snapshot
How should we evaluate supervised hashing?
inferredcites →https://doi.org/10.1109/iccv.2013.439openalex-snapshot
What is the Most EfficientWay to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search?
inferredcites →https://doi.org/10.1109/iccv.2015.225openalex-snapshot
PQTable: Fast Exact Asymmetric Distance Neighbor Search for Product Quantization Using Hash Tables
inferredcites →https://doi.org/10.1109/jproc.2015.2487976openalex-snapshot
Learning to Hash for Indexing Big Data—A Survey
inferredcites →https://doi.org/10.1109/tbdata.2019.2921572openalex-snapshot
Billion-Scale Similarity Search with GPUs
inferredcites →https://doi.org/10.1109/tkde.2014.2324592openalex-snapshot
Optimized Cartesian K-Means
inferredcites →https://doi.org/10.1109/tkde.2016.2597834openalex-snapshot
Competitive Quantization for Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.1109/tmm.2014.2329648openalex-snapshot
A Comprehensive Study Over VLAD and Product Quantization in Large-Scale Image Retrieval
inferredcites →https://doi.org/10.1109/tmm.2016.2617089openalex-snapshot
Online Variable Coding Length Product Quantization for Fast Nearest Neighbor Search in Mobile Retrieval
inferredcites →https://doi.org/10.1109/tmm.2016.2625260openalex-snapshot
Scalable Image Retrieval by Sparse Product Quantization
inferredcites →https://doi.org/10.1109/tpami.2010.57openalex-snapshot
Product Quantization for Nearest Neighbor Search
inferredcites →https://doi.org/10.1109/tpami.2012.193openalex-snapshot
Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image Retrieval
inferredcites →https://doi.org/10.1109/tpami.2013.240openalex-snapshot
Optimized Product Quantization
inferredcites →https://doi.org/10.1109/tpami.2014.2321376openalex-snapshot
Scalable Nearest Neighbor Algorithms for High Dimensional Data
inferredcites →https://doi.org/10.1145/2647868.2654898openalex-snapshot
Optimized Distances for Binary Code Ranking
inferredcites →https://doi.org/10.1145/3078971.3078992openalex-snapshot
Accelerated Nearest Neighbor Search with Quick ADC
inferredcites →https://doi.org/10.1145/997817.997857openalex-snapshot
Locality-sensitive hashing scheme based on p-stable distributions
inferredcites →https://doi.org/10.14778/2856318.2856324openalex-snapshot
Cache locality is not enough
inferredcites →https://doi.org/10.3390/s101211259openalex-snapshot
Approximate Nearest Neighbor Search by Residual Vector Quantization
inferredcites →https://doi.org/10.48550/arxiv.1510.00149openalex-snapshot
Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding
inferredcites →https://doi.org/10.48550/arxiv.1606.00185openalex-snapshot
A Survey on Learning to Hash
inferredcites →https://doi.org/10.48550/arxiv.1608.03308openalex-snapshot
Approximate search with quantized sparse representations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-26293-7_39openalex-snapshot
Unsupervised Online Hashing with Multi-Bit Quantization
inferred← citeshttps://doi.org/10.1007/978-3-032-06069-3_34openalex-snapshot
Memory-Constrained DiskANN: Efficient Approximate Nearest Neighbor Search Under Resource Constraints
inferred← citeshttps://doi.org/10.1007/978-981-97-7238-4_24openalex-snapshot
Tree and Graph Based Two-Stages Routing for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/s11042-023-14825-zopenalex-snapshot
An efficient indexing technique for billion-scale nearest neighbor search
inferred← citeshttps://doi.org/10.1016/j.neucom.2020.03.016openalex-snapshot
Product quantization with dual codebooks for approximate nearest neighbor search
inferred← citeshttps://doi.org/10.1093/9780198918868.001.0001openalex-snapshot
Machine Learning for Econometrics
inferred← citeshttps://doi.org/10.1093/9780198918868.003.0004openalex-snapshot
Post-selection inference
inferred← citeshttps://doi.org/10.1093/9780198918868.003.0005openalex-snapshot
Generalization and methodology
inferred← citeshttps://doi.org/10.1093/9780198918868.003.0006openalex-snapshot
High dimension and endogeneity
inferred← citeshttps://doi.org/10.1093/9780198918868.003.0008openalex-snapshot
Inference on heterogeneous effects
inferred← citeshttps://doi.org/10.1093/9780198918868.003.0009openalex-snapshot
Optimal policy learning
inferred← citeshttps://doi.org/10.1093/9780198918868.003.0010openalex-snapshot
The synthetic control method
inferred← citeshttps://doi.org/10.1093/9780198918868.003.0011openalex-snapshot
Forecasting in high-dimension
inferred← citeshttps://doi.org/10.1093/9780198918868.003.0012openalex-snapshot
Working with text data
inferred← citeshttps://doi.org/10.1093/9780198918868.003.0014openalex-snapshot
Modern language models
inferred← citeshttps://doi.org/10.1109/hpca53966.2022.00021openalex-snapshot
ANNA: Specialized Architecture for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1109/icassp40776.2020.9054175openalex-snapshot
Deep Product Quantization Module for Efficient Image Retrieval
inferred← citeshttps://doi.org/10.1109/icassp43922.2022.9746589openalex-snapshot
ARM 4-BIT PQ: SIMD-Based Acceleration for Approximate Nearest Neighbor Search on ARM
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00228openalex-snapshot
Timestamp Approximate Nearest Neighbor Search Over High-Dimensional Vector Data
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00033openalex-snapshot
Federated Retrieval Over Embedding-Heterogeneous Vector Databases
inferred← citeshttps://doi.org/10.1109/icip.2018.8451557openalex-snapshot
Revisiting Column-Wise Vector Quantization for Memory-Efficient Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/iisec69317.2026.11418421openalex-snapshot
LuneSearch: Addressing the Distributed Case of Similarity Search
inferred← citeshttps://doi.org/10.1109/ijcnn64981.2025.11228109openalex-snapshot
Deep Quantization Retrieval of Audio Fingerprints Based on Double Contrast Learning
inferred← citeshttps://doi.org/10.1109/iwqos70441.2026.11661056openalex-snapshot
SwitchNN: In-Network CNN Inference for Edge-Assisted Smart Roadside Networks
inferred← citeshttps://doi.org/10.1109/lwc.2024.3476234openalex-snapshot
Product Quantization for Limited Feedback MISO and RIS-Aided Wireless Communication Systems
inferred← citeshttps://doi.org/10.1109/tip.2024.3359066openalex-snapshot
Entropy-Optimized Deep Weighted Product Quantization for Image Retrieval
inferred← citeshttps://doi.org/10.1109/tkde.2026.3722749openalex-snapshot
Approximate Nearest Neighbor Search Over Temporal Vector Data
inferred← citeshttps://doi.org/10.1109/tmm.2021.3062480openalex-snapshot
Online Residual Quantization Via Streaming Data Correlation Preserving
inferred← citeshttps://doi.org/10.1109/tmm.2023.3306556openalex-snapshot
Progressive Similarity Preservation Learning for Deep Scalable Product Quantization
inferred← citeshttps://doi.org/10.1109/tvt.2026.3676671openalex-snapshot
SAGEComm: Semantic-Aware Generation and Encoding for Next-Gen Communication
inferred← citeshttps://doi.org/10.1109/vcip63160.2024.10849920openalex-snapshot
Joint-Neighborhood Product Quantization for Unsupervised Cross-Modal Retrieval
inferred← citeshttps://doi.org/10.1145/3240508.3240630openalex-snapshot
Reconfigurable Inverted Index
inferred← citeshttps://doi.org/10.1145/3543507.3583318openalex-snapshot
FINGER: Fast Inference for Graph-based Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3570361.3613285openalex-snapshot
LUT-NN: Empower Efficient Neural Network Inference with Centroid Learning and Table Lookup
inferred← citeshttps://doi.org/10.1145/3583780.3615049openalex-snapshot
Search-Efficient Computerized Adaptive Testing
inferred← citeshttps://doi.org/10.1145/3588908openalex-snapshot
Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases
inferred← citeshttps://doi.org/10.1145/3589185openalex-snapshot
Weakly Supervised Hashing with Reconstructive Cross-modal Attention
inferred← citeshttps://doi.org/10.1145/3626246.3654691openalex-snapshot
Vector Database Management Techniques and Systems
inferred← citeshttps://doi.org/10.1145/3626772.3657898openalex-snapshot
BRB-KMeans: Enhancing Binary Data Clustering for Binary Product Quantization
inferred← citeshttps://doi.org/10.1145/3654970openalex-snapshot
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3709679openalex-snapshot
DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph
inferred← citeshttps://doi.org/10.1145/3709729openalex-snapshot
Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3719027.3765190openalex-snapshot
Panther: Private Approximate Nearest Neighbor Search in the Single Server Setting
inferred← citeshttps://doi.org/10.1145/3725325openalex-snapshot
MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3725413openalex-snapshot
Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3749160openalex-snapshot
DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3749179openalex-snapshot
PGTuner: An Efficient Framework for Automatic and Transferable Configuration Tuning of Proximity Graphs
inferred← citeshttps://doi.org/10.1145/3769783openalex-snapshot
Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3769824openalex-snapshot
SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
inferred← citeshttps://doi.org/10.1145/3786690openalex-snapshot
Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search from Task-Centric Views: [Experiments & Analysis]
inferred← citeshttps://doi.org/10.1145/3801359.3801360openalex-snapshot
From Theory to Practice: Optimization Framework and Performance Evaluation of Mobile HNSW
inferred← citeshttps://doi.org/10.1145/3808196openalex-snapshot
Compiling Code LLMs into Lightweight Executables
inferred← citeshttps://doi.org/10.14778/3368289.3368303openalex-snapshot
Return of the Lernaean Hydra
inferred← citeshttps://doi.org/10.14778/3611479.3611537openalex-snapshot
Similarity Search in the Blink of an Eye with Compressed Indices
inferred← citeshttps://doi.org/10.14778/3750601.3750700openalex-snapshot
Filtered Vector Search: State-of-the-Art and Research Opportunities
inferred← citeshttps://doi.org/10.14778/3801059.3801067openalex-snapshot
JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.14778/3828612.3828636openalex-snapshot
RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.14778/3828612.3828642openalex-snapshot
HEXA: A Disjoint-Subgraph-Based Indexing Framework for Approximate Nearest Neighbor Search at Billion Scale
inferred← citeshttps://doi.org/10.14778/3836663.3836702openalex-snapshot
BBC: Improving Large- k Approximate Nearest Neighbor Search with a Bucket-Based Result Collector
inferred← citeshttps://doi.org/10.3389/fbinf.2022.1033775openalex-snapshot
Nearest neighbor search on embeddings rapidly identifies distant protein relations
inferred← citeshttps://doi.org/10.70675/0e6d7bcbz4ddbz45bczb909z78ab26702a56openalex-snapshot
Towards Effective, Efficient and Explainable Neural Information Retrieval
inferred← citeshttps://doi.org/10.70675/32098958z1deez4f21zb51az429b616621fdopenalex-snapshot
Efficient and privacy-preserving compressive learning
inferred← citeshttps://doi.org/10.70675/8e9b30dcz72f6z42bezb84az0ba80996a9b9openalex-snapshot
Designing Recommender Systems for the Labor Market
inferred← citeshttps://doi.org/10.70675/b7435784z5c25z445bzadfcz780bb560cf20openalex-snapshot
Learning compact representations for large scale image search
inferred← citeshttps://doi.org/10.70675/e20f182fz29f1z4c43z8b62z28efa11eb33dopenalex-snapshot
Compression and federated learning : an approach to frugal machine learning
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.