Embedding Surgery: Localized Updates for Adaptive Ranking Correction in Dense Retrieval
Embedded surgery is formulated as a convex optimization problem that enforces ranking constraints while minimizing modifications to the affected document representations, and can be applied safely and efficiently to scalable Approximate Nearest Neighbor indexes via simple in-place overwriting, without requiring costly...