用近邻方法替代神经网络,解决幻觉与高成本问题
Novel Approaches to Artificial Intelligence Development Based on the Nearest Neighbor Method
- 基于分层聚类的近邻算法,避免重训即可扩展模型
- 搜索速度提升数百倍,准确率仅轻微下降
- 适合医疗、科研等需可解释结果的高可靠性场景
现代神经网络技术(包括大语言模型)在各类人工智能应用中取得显著成功,但面临幻觉、训练与推理计算复杂度高、微调成本大及灾难性遗忘等根本性局限,严重制约其在医疗、工业过程管理及科学研究等关键领域的应用。本文提出一种基于最近邻方法与分层聚类结构的替代方案。采用k近邻算法显著减少或完全消除幻觉现象,同时简化模型扩展与微调,无需重新训练整个网络。为缓解k近邻方法的高计算负载,论文提出基于柯赫嫩自组织映射的树状数据结构,大幅加速近邻搜索。在手写数字识别与简单字幕翻译任务上的测试表明,相比穷举搜索,近邻查找时间减少数百倍,准确率仅略有下降。该方法具备透明性与可解释性,贴近人类认知机制,在需要高可靠性与可解释性的任务中具有广泛应用潜力。
原文摘要 · Abstract (English)
Modern neural network technologies, including large language models, have achieved remarkable success in various applied artificial intelligence applications, however, they face a range of fundamental limitations. Among them are hallucination effects, high computational complexity of training and inference, costly fine-tuning, and catastrophic forgetting issues. These limitations significantly hinder the use of neural networks in critical areas such as medicine, industrial process management, and scientific research. This article proposes an alternative approach based on the nearest neighbors method with hierarchical clustering structures. Employing the k-nearest neighbors algorithm significantly reduces or completely eliminates hallucination effects while simplifying model expansion and fine-tuning without the need for retraining the entire network. To overcome the high computational load of the k-nearest neighbors method, the paper proposes using tree-like data structures based on Kohonen self-organizing maps, thereby greatly accelerating nearest neighbor searches. Tests conducted on handwritten digit recognition and simple subtitle translation tasks confirmed the effectiveness of the proposed approach. With only a slight reduction in accuracy, the nearest neighbor search time was reduced hundreds of times compared to exhaustive search methods. The proposed method features transparency and interpretability, closely aligns with human cognitive mechanisms, and demonstrates potential for extensive use in tasks requiring high reliability and explainable results.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。