预排序 Tsetlin Machine(遗传 K-Medoid 方法)
Pre-Sorted Tsetlin Machine (The Genetic K-Medoid Method)
AI总结:
该研究提出基于加速遗传算法与 K-Medoid 聚类的 Tsetlin Machines 预排序框架,通过最大化汉明距离对齐多个独立模型,在 MNIST 级分类任务中显著提升准确率并大幅降低训练与推理时间。
摘要:
本文提出一种用于传统监督学习的机器学习预排序阶段,采用 Tsetlin Machines。首先,使用加速遗传算法从数据集中识别 K 个数据点,以解决最大离散化问题。随后,将这些点作为初始位置运行 K-Medoid 聚类算法。最后,使用加速遗传算法通过最大化汉明距离来对齐 K 个独立的 Tsetlin Machines。针对 MNIST 级别的分类问题,结果表明准确率最高提升 10%,训练时间约缩短 383 倍,推理时间约缩短 86 倍。
英文摘要:
This paper proposes a machine learning pre-sort stage to traditional supervised learning using Tsetlin Machines. Initially, K data-points are identified from the dataset using an expedited genetic algorithm to solve the maximum dispersion problem. These are then used as the initial placement to run the K-Medoid clustering algorithm. Finally, an expedited genetic algorithm is used to align K independent Tsetlin Machines by maximising hamming distance. For MNIST level classification problems, results demonstrate up to 10% improvement in accuracy, approx. 383X reduction in training time and approx. 86X reduction in inference time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。