量子时间序列相似性度量与量子时间核
Quantum Time Series Similarity Measures and Quantum Temporal Kernels
AI总结:
本文利用量子隐马尔可夫模型(QHMM)设计量子时间序列相似性度量和核,并通过股票价格方向分类实验证明量子核在支持向量机和k近邻中均优于经典核。
摘要:
本文提出了一种量子计算方法,用于设计随机符号时间序列分类的相似性度量和核。在机器学习领域,核是各种基于相似性的分类、聚类和回归算法的重要组成部分。设计问题特定核的一种有效策略是利用示例空间的现有生成模型。在本研究中,我们假设一个被称为量子隐马尔可夫模型(QHMM)的量子生成模型描述了示例的底层分布。序列结构和概率由模型密度算子空间内的转移决定。因此,QHMM 定义了从示例空间到更广泛的密度算子量子空间的映射。序列相似性使用量子态之间的迹距离和 Bures 距离等散度度量进行评估。我们进行了大量模拟,以探索核估计相似性的分布与 QHMM 希尔伯特空间维数之间的关系。正如预期的那样,希尔伯特空间的更高维数对应于更大的序列距离和示例更明显的分离。为了从经验上评估核的性能,我们基于股票市场方向性价格变动的简化生成模型定义了分类任务。我们使用经典核和量子核实现了两种广泛使用的基于核的算法——支持向量机和 k 近邻。在所有分类任务场景中,量子核始终表现出优于经典对应方法的性能。
英文摘要:
This article presents a quantum computing approach to designing of similarity measures and kernels for classification of stochastic symbolic time series. In the area of machine learning, kernels are important components of various similarity-based classification, clustering, and regression algorithms. An effective strategy for devising problem-specific kernels is leveraging existing generative models of the example space. In this study we assume that a quantum generative model, known as quantum hidden Markov model (QHMM), describes the underlying distributions of the examples. The sequence structure and probability are determined by transitions within model's density operator space. Consequently, the QHMM defines a mapping from the example space into the broader quantum space of density operators. Sequence similarity is evaluated using divergence measures such as trace and Bures distances between quantum states. We conducted extensive simulations to explore the relationship between the distribution of kernel-estimated similarity and the dimensionality of the QHMMs Hilbert space. As anticipated, a higher dimension of the Hilbert space corresponds to greater sequence distances and a more distinct separation of the examples. To empirically evaluate the performance of the kernels, we defined classification tasks based on a simplified generative model of directional price movement in the stock market. We implemented two widely-used kernel-based algorithms - support vector machines and k-nearest neighbors - using both classical and quantum kernels. Across all classification task scenarios, the quantum kernels consistently demonstrated superior performance compared to their classical counterparts.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。