matrix configuration
Quantum Geometry of Data
Abanov, Alexander G., Candelori, Luca, Steinacker, Harold C., Wells, Martin T., Busemeyer, Jerome R., Hogan, Cameron J., Kirakosyan, Vahagn, Marzari, Nicola, Pinnamaneni, Sunil, Villani, Dario, Xu, Mengjia, Musaelian, Kharen
We demonstrate how Quantum Cognition Machine Learning (QCML) encodes data as quantum geometry. In QCML, features of the data are represented by learned Hermitian matrices, and data points are mapped to states in Hilbert space. The quantum geometry description endows the dataset with rich geometric and topological structure - including intrinsic dimension, quantum metric, and Berry curvature - derived directly from the data. QCML captures global properties of data, while avoiding the curse of dimensionality inherent in local methods. We illustrate this on a number of synthetic and real-world examples. Quantum geometric representation of QCML could advance our understanding of cognitive phenomena within the framework of quantum cognition.
Robust estimation of the intrinsic dimension of data sets with quantum cognition machine learning
Candelori, Luca, Abanov, Alexander G., Berger, Jeffrey, Hogan, Cameron J., Kirakosyan, Vahagn, Musaelian, Kharen, Samson, Ryan, Smith, James E. T., Villani, Dario, Wells, Martin T., Xu, Mengjia
We propose a new data representation method based on Quantum Cognition Machine Learning and apply it to manifold learning, specifically to the estimation of intrinsic dimension of data sets. The idea is to learn a representation of each data point as a quantum state, encoding both local properties of the point as well as its relation with the entire data. Inspired by ideas from quantum geometry, we then construct from the quantum states a point cloud equipped with a quantum metric. The metric exhibits a spectral gap whose location corresponds to the intrinsic dimension of the data. The proposed estimator is based on the detection of this spectral gap. When tested on synthetic manifold benchmarks, our estimates are shown to be robust with respect to the introduction of point-wise Gaussian noise. This is in contrast to current state-of-the-art estimators, which tend to attribute artificial ``shadow dimensions'' to noise artifacts, leading to overestimates. This is a significant advantage when dealing with real data sets, which are inevitably affected by unknown levels of noise. We show the applicability and robustness of our method on real data, by testing it on the ISOMAP face database, MNIST, and the Wisconsin Breast Cancer Dataset.