paper-with-me

Papers

Robust Nearest Neighbour Retrieval Using Targeted Manifold Manipulation

2025-11-09 · B. Ghosh, H. Harikumar, S. Rana arxiv

Nearest-neighbour retrieval is central to classification and explainable-AI pipelines, but current practice relies on hand-tuning feature layers and distance metrics. We propose Targeted Manifold Manipulation-Nearest Neighbour (TMM-NN), which reconceptualises retrieval by assessing how readily each sample can be nudged into a designated region of the feature manifold; neighbourhoods are defined by a sample's responsiveness to a targeted perturbation rather than absolute geometric distance. TMM-NN implements this through a lightweight, query-specific trigger patch. The patch is added to the query image, and the network is weakly ``backdoored'' so that any input with the patch is steered toward a dummy class. Images similar to the query need only a slight shift and are classified as the dummy class with high probability, while dissimilar ones are less affected. By ranking candidates by this confidence, TMM-NN retrieves the most semantically related neighbours. Robustness analysis and benchmark experiments confirm this trigger-based ranking outperforms traditional metrics under noise and across diverse tasks.

📄 PDF Abstract BibTeX arXiv:2511.06261

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

MicroNN: An On-device Disk-resident Updatable Vector Database

2025-04-08 · Jeffrey Pound, Floris Chabert, Arjun Bhushan, Ankur Goswami 외

Nearest neighbour search over dense vector collections has important applications in information retrieval, retrieval augmented generation (RAG), and content ranking. Performing efficient search over large vector collect…

AttributeInformation RetrievalRAGRetrieval+1

Minimax rates for cost-sensitive learning on manifolds with approximate nearest neighbours

2018-03-01 · Henry WJ Reeve, Gavin Brown

We study the approximate nearest neighbour method for cost-sensitive classification on low-dimensional manifolds embedded within a high-dimensional feature space. We determine the minimax learning rates for distributions…

General Classification

The K-Nearest Neighbour UCB algorithm for multi-armed bandits with covariates

2018-03-01 · Henry WJ Reeve, Joe Mellor, Gavin Brown

In this paper we propose and explore the k-Nearest Neighbour UCB algorithm for multi-armed bandits with covariates. We focus on a setting where the covariates are supported on a metric space of low intrinsic dimension, s…

Multi-Armed Bandits

Topological Stability: a New Algorithm for Selecting The Nearest Neighbors in Non-Linear Dimensionality Reduction Techniques

2019-11-13 · Mohammed Elhenawy, Mahmoud Masoud, Sebastian Glaser, Andry Rakotonirainy

In the machine learning field, dimensionality reduction is an important task. It mitigates the undesired properties of high-dimensional spaces to facilitate classification, compression, and visualization of high-dimensio…

Dimensionality Reduction

FANNG: Fast Approximate Nearest Neighbour Graphs

2016-06-01 · CVPR 2016 6 · Ben Harwood, Tom Drummond

We present a new method for approximate nearest neighbour search on large datasets of high dimensional feature vectors, such as SIFT or GIST descriptors. Our approach constructs a directed graph that can be efficiently …

GPU