Support Spinor Machine
We generalize a support vector machine to a support spinor machine by using the mathematical structure of wedge product over vector machine in order to extend field from vector field to spinor field. The separated hyperplane is extended to Kolmogorov space in time series data which allow us to extend a structure of support vector machine to a support tensor machine and a support tensor machine moduli space. Our performance test on support spinor machine is done over one class classification of end point in physiology state of time series data after empirical mode analysis and compared with support vector machine test. We implement algorithm of support spinor machine by using Holo-Hilbert amplitude modulation for fully nonlinear and nonstationary time series data analysis.
Code (0)
등록된 구현이 없습니다.
Tasks
General ClassificationOne-Class ClassificationTime SeriesTime Series AnalysisSimilar Papers 제목 키워드 기반
Learning the Simplicity of Scattering Amplitudes
The simplification and reorganization of complex expressions lies at the core of scientific progress, particularly in theoretical high-energy physics. This work explores the application of machine learning to a particula…
Contrastive LearningDecoderLearning in a Multifield Coherent Ising Machine
Physical information processors can learn from examples if they are modified according to an abstract parameter update equation, termed a learning rule. We introduce a physical model for self-learning that encodes the le…
Self-LearningContextuality, Holonomy and Discrete Fiber Bundles in Group-Valued Boltzmann Machines
We propose a geometric extension of restricted Boltzmann machines (RBMs) by allowing weights to take values in abstract groups such as \( \mathrm{GL}_n(\mathbb{R}) \), \( \mathrm{SU}(2) \), or even infinite-dimensional o…
Fermions and Supersymmetry in Neural Network Field Theories
We introduce fermionic neural network field theories via Grassmann-valued neural networks. Free theories are obtained by a generalization of the Central Limit Theorem to Grassmann variables. This enables the realization …
Learning to Unscramble: Simplifying Symbolic Expressions via Self-Supervised Oracle Trajectories
We present a new self-supervised machine learning approach for symbolic simplification of complex mathematical expressions. Training data is generated by scrambling simple expressions and recording the inverse operations…
Reinforcement Learning