A Theory-Driven Approach to Inner Product Matrix Estimation for Incomplete Data: An Eigenvalue Perspective
Fangchen Yu, Yicheng Zeng, Jianfeng Mao, Wenye Li
摘要
Addressing the critical challenge of data incompleteness in inner product matrix estimation, we introduce a novel eigenvalue correction method designed to precisely reconstruct true inner product matrices from incomplete data. Utilizing random matrix theory, our method adjusts the eigenvalue distribution of the estimated inner product matrix to align with the ground truth. This approach significantly reduces estimation errors for both inner product matrices and the associated Euclidean distance matrices, thereby enhancing the effectiveness of similarity searches on incomplete data. Our method surpasses traditional data imputation and similarity calibration techniques in both maximum inner product search and nearest neighbor search tasks, demonstrating marked advancements in managing incomplete data.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
相关 Paper
- A Fast Similarity Matrix Calibration Method with Incomplete QueryChangyi Ma, Runsheng Yu, Youzhi ZhangWWW 2024 · 被引用 2 次
- Boosting Spectral Clustering on Incomplete Data via Kernel Correction and Affinity LearningFangchen Yu, Runze Zhao, Zhan Shi, Yiwen Lu 等NeurIPS 2023 · 被引用 2 次
- Spectral Estimation with Free DecompressionSiavash Ameli, Chris van der Heide, Liam Hodgkinson, Michael W. MahoneyNeurIPS 2025
- Effective and General Distance Computation for Approximate Nearest Neighbor SearchMingyu Yang, Wentao Li, Jiabao Jin, Xiaoyao Zhong 等ICDE 2025 · 被引用 9 次
- Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner Product SearchXinyan Dai, Xiao Yan, Kelvin Kai Wing Ng, Jiu Liu 等AAAI 2020 · 被引用 34 次
