An Efficient and Robust Framework for Approximate Nearest Neighbor Search with Attribute Constraint
No confident code implementation found for this paper.
No confident code implementation found for this paper.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity
Active Learning for Object Detection with Evidential Deep Learning and Hierarchical Uncertainty Aggregation
Bootstrapping Variational Information Pursuit with Large Language and Vision Models for Interpretable Image Classification
Whittle Index with Multiple Actions and State Constraint for Inventory Management
LipsNet: A Smooth and Robust Neural Network with Adaptive Lipschitz Constant for High Accuracy Optimal Control
Catching Two Birds with One Stone: Reward Shaping with Dual Random Networks for Balancing Exploration and Exploitation
@article{wang2026efficient,
title = {An Efficient and Robust Framework for Approximate Nearest Neighbor Search with Attribute Constraint},
author = {Mengzhao Wang and Li-ang Lv and Xiaoliang Xu and Yuxiang Wang and Qiang Yue and Jiongkang Ni},
year = {2026},
doi = {10.52202/075280-0692},
url = {https://doi.org/10.52202/075280-0692},
journal = {NEURIPS 2023 2023}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/0a24188a5d2c5c920f58623a5c7580c9aec75907)