Original: Thought Curvature: An underivative hypothesis on the 'Supersymmetric Artificial Neural Network'
Revised: Thought Curvature: An underivative hypothesis on the 'Supersymmetric Artificial Neural Network'

Original: Jordan Micah Bennett jordanmicahbennett
Revised: Jordan Micah Bennett jordanmicahbennett

Original: The “Supersymmetric Artificial Neural Network” in deep learning (denoted 𝜙(𝑥,𝜃,𝜃)
Revised: The “Supersymmetric Artificial Neural Network” in deep learning (denoted 𝜙(𝑥,𝜃,𝜃)

Original: ⊤ 𝑤 ), espouses the importance of considering biological constraints in the aim of further generalizing backward propagation.
Revised: ⊤ 𝑤 ), espouses the importance of considering biological constraints in the aim of further generalizing backward propagation.

Original: Looking at the progression of ‘solution geometries’; going from 𝑆𝑂(𝑛) representation (such as Perceptron like models) to 𝑆𝑈(𝑛) representation (such as UnitaryRNNs) has guaranteed richer and richer representations in weight space of the artificial neural network, and hence better and better hypotheses were generatable.
Revised: Looking at the progression of ‘solution geometries’; going from 𝑆𝑂(𝑛) representation (such as Perceptron like models) to 𝑆𝑈(𝑛) representation (such as UnitaryRNNs) has guaranteed richer and richer representations in weight space of the artificial neural network, and hence better and better hypotheses were generatable.

Original: The Supersymmetric Artificial Neural Network explores a natural step forward, namely 𝑆𝑈(𝑚|𝑛) representation.
Revised: The Supersymmetric Artificial Neural Network explores a natural step forward, namely 𝑆𝑈(𝑚|𝑛) representation.

Original: These supersymmetric biological brain representations (Perez et al.) can be represented by supercharge compatible special unitary notation 𝑆𝑈(𝑚|𝑛) , or 𝜙(𝑥,𝜃,𝜃)
Revised: These supersymmetric biological brain representations (Perez et al.) can be represented by supercharge compatible special unitary notation 𝑆𝑈(𝑚|𝑛) , or 𝜙(𝑥,𝜃,𝜃)

Original: ⊤ 𝑤 parameterized by 𝜃,𝜃 , which are supersymmetric directions, unlike 𝜃 seen in the typical non-supersymmetric deep learning model.
Revised: ⊤ 𝑤 parameterized by 𝜃,𝜃 , which are supersymmetric directions, unlike 𝜃 seen in the typical non-supersymmetric deep learning model.

Original: Notably, Supersymmetric values can encode or represent more information than the typical deep learning model, in terms of “partner potential” signals for example.
Revised: Notably, Supersymmetric values can encode or represent more information than the typical deep learning model, in terms of “partner potential” signals for example.

Original: “ Thought Curvature ” is similar to “Thought vectors [47] ”, with the distinction that supermanifold [9] /curvatures [49] are used to describe the "Supersymmetric Artificial Neural Network"(SANN) model.
Revised: “ Thought Curvature ” is similar to “Thought vectors [47] ”, with the distinction that supermanifold [9] /curvatures [49] are used to describe the "Supersymmetric Artificial Neural Network"(SANN) model.

Original: (See manifold [10] /curvature [49] work in geometric deep learning by Michael Bronstein et al.
Revised: (See manifold [10] /curvature [49] work in geometric deep learning by Michael Bronstein et al.

Original: 1 INTRODUCTION
Revised: 1 INTRODUCTION

Original: D eepmind’s atari q architecture [4] encompasses non-pooling convolutions, therein generating object shift sensitivity, whence the model maximizes some reward over said shifts together with separate changing states for each sampled t state; translation non-invariance .
Revised: D eepmind’s atari q architecture [4] encompasses non-pooling convolutions, therein generating object shift sensitivity, whence the model maximizes some reward over said shifts together with separate changing states for each sampled t state; translation non-invariance .

Original: Separately, uetorch [24] , encodes an object trajectory behaviour physics learner, particularly on pooling layers; translation invariance .
Revised: Separately, uetorch [24] , encodes an object trajectory behaviour physics learner, particularly on pooling layers; translation invariance .

Original: It is non-abstrusely observable, that the childhood neocortical framework pre-encodes certain causal physical laws in the neurons [3] , amalgamating in perceptual learning abstractions into non-childhood.
Revised: It is non-abstrusely observable, that the childhood neocortical framework pre-encodes certain causal physical laws in the neurons [3] , amalgamating in perceptual learning abstractions into non-childhood.

Original: As such, it is perhaps exigent that non-invariant fabric composes in the invariant, pertinently in the margin of some asymptote entailing 𝜙(𝑥, 𝜃, 𝜃) ⊤ 𝑤 [1] , therein engendering time-space complex optimal causal artificial construction.
Revised: As such, it is perhaps exigent that non-invariant fabric composes in the invariant, pertinently in the margin of some asymptote entailing 𝜙(𝑥, 𝜃, 𝜃) ⊤ 𝑤 [1] , therein engendering time-space complex optimal causal artificial construction.

Original: 2 OVERVIEW
Revised: 2 OVERVIEW

Original: i.
Revised: i.

Original: The aim is to contribute to the field of artificial general intelligence, often underlined as mankind’s likely last invention.
Revised: The aim is to contribute to the field of artificial general intelligence, often underlined as mankind’s likely last invention.

Original: ii.
Revised: ii.

Original: Machine learning often
Revised: Machine learning often

Original: concerns constraining algorithms with respect to biological examples
Revised: concerns constraining algorithms with respect to biological examples

Original: iii.
Revised: iii.

Original: Babies are great examples of some nontrivial basis for artificial general intelligence; babies are significant examples of biological baseis that are reasonably usable to inspire smart algorithms, especially in the aims of (i), regarding (ii).
Revised: Babies are great examples of some nontrivial basis for artificial general intelligence; babies are significant examples of biological baseis that are reasonably usable to inspire smart algorithms, especially in the aims of (i), regarding (ii).

Original: Babies’ brains are fantastic measures of “ tabula rasa ”-like states, from which complicated abstractions are learnt into adulthood [29] ; similar to how the recent breakthrough artificial intelligence program, “AlphaGo
Revised: Babies’ brains are fantastic measures of “ tabula rasa ”-like states, from which complicated abstractions are learnt into adulthood [29] ; similar to how the recent breakthrough artificial intelligence program, “AlphaGo

Original: Zero”, started out essentially “ blank ” beginning from random plays, up until it quickly learnt to become the planet’s strongest go player today.
Revised: Zero”, started out essentially “ blank ” beginning from random plays, up until it quickly learnt to become the planet’s strongest go player today.

Original: (This quick outline highlights the critical relevance of games as necessary testbeds/algorithm training scenarios, in the aim of developing artificial general intelligence.)
Revised: (This quick outline highlights the critical relevance of games as necessary testbeds/algorithm training scenarios, in the aim of developing artificial general intelligence.)

Original: " Thought curvature " subsumes the " supermanifold hypothesis in deep learning ", while espousing the importance of considering biological constraints [23] in the aim of developing general machine learning models, pertinently, where babies’ brains are observed to be pre-equipped with particular “ physics priors ”, constituting specifically, the ability for babies to intuitively know laws of physics , while learning by reinforcement.
Revised: " Thought curvature " subsumes the " supermanifold hypothesis in deep learning ", while espousing the importance of considering biological constraints [23] in the aim of developing general machine learning models, pertinently, where babies’ brains are observed to be pre-equipped with particular “ physics priors ”, constituting specifically, the ability for babies to intuitively know laws of physics , while learning by reinforcement.

Original: It is palpable that the phrasing “intuitively know laws of physics” above, should not be confused for
Revised: It is palpable that the phrasing “intuitively know laws of physics” above, should not be confused for

Original: Nobel laureate or physics undergrad aligned babies that for example, write or understand physics papers/exams; instead, the aforesaid phrasing simply conveys that babies’ brains are pre-baked with ways to naturally exercise physics based
Revised: Nobel laureate or physics undergrad aligned babies that for example, write or understand physics papers/exams; instead, the aforesaid phrasing simply conveys that babies’ brains are pre-baked with ways to naturally exercise physics based

Original: expectations w.r.t.
Revised: expectations w.r.t.

Original: interactions with objects in their world , as indicated by Aimee Stahl and Lisa
Revised: interactions with objects in their world , as indicated by Aimee Stahl and Lisa

Original: Feigenson.
Revised: Feigenson.

Original: Outstandingly, the importance of recognizing underlying causal physics laws in learning models (although not via supermanifolds , as encoded in
Revised: Outstandingly, the importance of recognizing underlying causal physics laws in learning models (although not via supermanifolds , as encoded in

Original: Thought Curvature ), has recently been both demonstrated [21] and separately echoed by
Revised: Thought Curvature ), has recently been both demonstrated [21] and separately echoed by

Original: Deepmind [23] , and of late, distinctly emphasized by
Revised: Deepmind [23] , and of late, distinctly emphasized by

Original: Yoshua Bengio.
Revised: Yoshua Bengio.

Original: 3 RELATED WORK
Revised: 3 RELATED WORK

Original: There priorly existed translation variant/invariant manifold interaction paradigms [6][7] , that effectively learn to disentangle varying factors.
Revised: There priorly existed translation variant/invariant manifold interaction paradigms [6][7] , that effectively learn to disentangle varying factors.

Original: However , such models plausibly relent factors amidst optimal , causal - laws of physics arranged embeddings.
Revised: However , such models plausibly relent factors amidst optimal , causal - laws of physics arranged embeddings.

Original: (See "A probable experiment" )
Revised: (See "A probable experiment" )

Original: 4 A PROBABLE EXPERIMENT: A TRANSVERSE FIELD ISING SPIN (SUPER)–HAMILTONIAN QUANTUM COMPUTATION
Revised: 4 A PROBABLE EXPERIMENT: A TRANSVERSE FIELD ISING SPIN (SUPER)–HAMILTONIAN QUANTUM COMPUTATION

Original: Considering the Bessel aligned secondorder linear damping equation:
Revised: Considering the Bessel aligned secondorder linear damping equation:

Original: [Equation]
Revised: [Equation]

Original:  incorporating the travelling coordinate: 𝑧 = 𝑎𝑥 + 𝑏𝑦 − 𝑐𝑡 [13] whilst emerging by the isospectral factorization outcome: 𝑓 𝜆 = 𝜆 𝜆+1 [13] , constrained in dimensions 𝑑 = 2 + 1 [13] , given that the 𝑆𝑂(𝑛) group may eventuate in 𝑆𝑈(𝑚|𝑛) terms [17][36][45] ; within the aforesaid constraint , the Hamiltonian operator:
Revised: ] incorporating the travelling coordinate: 𝑧 = 𝑎𝑥 + 𝑏𝑦 − 𝑐𝑡 [13] whilst emerging by the isospectral factorization outcome: 𝑓 𝜆 = 𝜆 𝜆+1 [13] , constrained in dimensions 𝑑 = 2 + 1 [13] , given that the 𝑆𝑂(𝑛) group may eventuate in 𝑆𝑈(𝑚|𝑛) terms [17][36][45] ; within the aforesaid constraint , the Hamiltonian operator:

Original: [Equation]
Revised: [Equation]

Original: σ 𝑧𝑏 [14] is reasonably applicable in the quantum temporal difference horizon: 𝜋(𝑠1)
Revised: σ 𝑧𝑏 [14] is reasonably applicable in the quantum temporal difference horizon: 𝜋(𝑠1)

Original: ← 𝑎𝑟𝑔𝑚𝑎𝑥 𝑎 𝑄(𝑠1, 𝑎) [15] as a Super-Hamiltonian [16] in contrast.
Revised: ← 𝑎𝑟𝑔𝑚𝑎𝑥 𝑎 𝑄(𝑠1, 𝑎) [15] as a Super-Hamiltonian [16] in contrast.

Original: Consequently, some odd operation of form {𝐻 ± 𝐹, 𝐻 [Equation] 𝐹}1 = ±2𝑄𝐻, {𝐻 [Equation]{++ 𝐹, 𝐻 − 𝐹}1 = {𝐻 ± 𝐹, 𝑄𝐻}1 = {𝑄𝐻, 𝑄𝐻}1 = 
+}
Revised: Consequently, some odd operation of form {𝐻 ± 𝐹, 𝐻 ± 𝐹}1 = ±2𝑄𝐻, {𝐻 {++ 𝐹, 𝐻 − 𝐹}1 = {𝐻 ± 𝐹, 𝑄𝐻}1 = {𝑄𝐻, 𝑄𝐻}1 = 
+}

Original: [-𝐹, 𝐻 − 𝐹}1 = {𝐻 ± 𝐹, 𝑄𝐻}1 = {𝑄𝐻, 𝑄𝐻}1 = 
-]
Revised: [-𝐹, 𝐻 − 𝐹}1 = {𝐻 ± 𝐹, 𝑄𝐻}1 = {𝑄𝐻, 𝑄𝐻}1 = 
-]

Original: [16] subsuming − ∑ Γ 𝑎 a σ 𝑥𝑎 − ∑ 𝑏 𝑎 a σ 𝑧 𝑎 − ∑ w
Revised: [16] subsuming − ∑ Γ 𝑎 a σ 𝑥𝑎 − ∑ 𝑏 𝑎 a σ 𝑧 𝑎 − ∑ w

Original: [Equation]
Revised: [Equation]

Revised: ,𝑏

Original: [Equation]
Revised: [Equation]

Original: σ 𝑧 𝑎 σ 𝑧 𝑏 [14] is theoretically absorbable in [15] .
Revised: σ 𝑧 𝑎 σ 𝑧 𝑏 [14] is theoretically absorbable in [15] .

Original: 5 THOUGHT CURVATURE -ANNOTATION i.
Revised: 5 THOUGHT CURVATURE -ANNOTATION i.

Original: Supermanifold hypothesis in deep learning describes some superspace bound structure/weights.
Revised: Supermanifold hypothesis in deep learning describes some superspace bound structure/weights.

Original: ii.
Revised: ii.

Original: Thought curvature designates the existence of some plausible πBellmanian [14] , based on i; a sequence taking as parameters, the aforesaid supermanifold structure.
Revised: Thought curvature designates the existence of some plausible πBellmanian [14] , based on i; a sequence taking as parameters, the aforesaid supermanifold structure.

Original: 6 SUPERMANIFOLD HYPOTHESIS IN DEEP LEARNING
Revised: 6 SUPERMANIFOLD HYPOTHESIS IN DEEP LEARNING

Original: If any homeomorphic transition in some neighbourhood in an euclidean space ℝ 𝑛 yields 𝜙(𝑥, 𝜃) ⊤ 𝑤 for 𝑤 𝑖 , 𝜃 ∈ ℝ 𝑛 , then reasonably, some homeomorphic transition sequence in some euclidean superspace 𝐶 ∞ (𝑅 𝑚|𝑛 ) yields 𝜙(𝑥, 𝜃, 𝜃)
Revised: If any homeomorphic transition in some neighbourhood in an euclidean space ℝ 𝑛 yields 𝜙(𝑥, 𝜃) ⊤ 𝑤 for 𝑤 𝑖 , 𝜃 ∈ ℝ 𝑛 , then reasonably, some homeomorphic transition sequence in some euclidean superspace 𝐶 ∞ (𝑅 𝑚|𝑛 ) yields 𝜙(𝑥, 𝜃, 𝜃)

Original: ⊤ 𝑤 for 𝑥
Revised: ⊤ 𝑤 for 𝑥

Original: 𝑖 ∈ ℝ
Revised: 𝑖 ∈ ℝ

Original: 𝑛 while 𝑤 𝑖 , 𝜃, 𝜃 ∈ 𝑅 𝑚|𝑛 .
Revised: 𝑛 while 𝑤 𝑖 , 𝜃, 𝜃 ∈ 𝑅 𝑚|𝑛 .

Original: Pertinently, 𝑅 𝑚|𝑛 → form 𝑅 2|1 for 𝑑 = 2 + 1 .
Revised: Pertinently, 𝑅 𝑚|𝑛 → form 𝑅 2|1 for 𝑑 = 2 + 1 .

Original: 7 SUPERMANIFOLD HYPOTHESIS IN DEEP LEARNINGANNOTATION
Revised: 7 SUPERMANIFOLD HYPOTHESIS IN DEEP LEARNINGANNOTATION

Original: i.
Revised: i.

Original: Deep learning entails 𝜙(𝑥, 𝜃) ⊤ 𝑤 [5] , that denotes the input space 𝑥 , and learnt representations 𝜃 . ii.
Revised: Deep learning entails 𝜙(𝑥, 𝜃) ⊤ 𝑤 [5] , that denotes the input space 𝑥 , and learnt representations 𝜃 . ii.

Original: Deep learning underlines that coordinates or latent spaces in the manifold framework, are learnt features/representations, or directions that are sparse configurations of coordinates .
Revised: Deep learning underlines that coordinates or latent spaces in the manifold framework, are learnt features/representations, or directions that are sparse configurations of coordinates .

Original: iii.
Revised: iii.

Original: Supermathematics entails (𝑥, 𝜃, 𝜃) [9] , that denotes some 𝑥 valued coordinate distribution, and by extension, directions that compact coordinates via 𝜃, 𝜃
Revised: Supermathematics entails (𝑥, 𝜃, 𝜃) [9] , that denotes some 𝑥 valued coordinate distribution, and by extension, directions that compact coordinates via 𝜃, 𝜃

Original: iv
Revised: iv

Original: As
Revised: As

Original: such
Revised: such

Original: , the aforesaid (𝑥, 𝜃, 𝜃) , is subject to coordinate transformation.
Revised: , the aforesaid (𝑥, 𝜃, 𝜃) , is subject to coordinate transformation.

Original: v.
Revised: v.

Original: Thereafter i, ii, iii, iv and [13] , within the generalizable nature of euclidean space, reasonably effectuate 𝜙(𝑥, 𝜃, 𝜃) ⊤ 𝑤 .
Revised: Thereafter i, ii, iii, iv and [13] , within the generalizable nature of euclidean space, reasonably effectuate 𝜙(𝑥, 𝜃, 𝜃) ⊤ 𝑤 .

Original: 8 SUPERMANIFOLD HYPOTHESIS IN DEEP LEARNINGEND NOTES
Revised: 8 SUPERMANIFOLD HYPOTHESIS IN DEEP LEARNINGEND NOTES

Original: Some space (i.e. superspace) may persist, such that degrees of freedom of said space is inclined by some aggregation:
Revised: Some space (i.e. superspace) may persist, such that degrees of freedom of said space is inclined by some aggregation:

Original: i. Some tensor sequence of priors.
Revised: i. Some tensor sequence of priors.

Original: i.e
Revised: i.e

Original: eta… orany
Revised: eta… or

Original:  𝑝̂ data
Revised: any 𝑝̂ data

Original: [5] constituting the laws of physics .)
Revised: [5] constituting the laws of physics .)

Original: ii.
Revised: ii.

Original: Some tensor sequence on the direction of (
Revised: Some tensor sequence on the direction of (

Original: i), i.e. superfields of interactions in (i) terms.
Revised: i), i.e. superfields of interactions in (i) terms.

Original: 9 THOUGHT CURVATURE - LIMITATIONS
Revised: 9 THOUGHT CURVATURE - LIMITATIONS

Original: Although thought curvature is minor particularly in its simple description (acquiescing
Revised: Although thought curvature is minor particularly in its simple description (acquiescing

Original: SQCD [26] ) in relation to Artificial General
Revised: SQCD [26] ) in relation to Artificial General

Original: Intelligence, it crucially delineates that the math of supermanifolds is reasonably applicable in Deep
Revised: Intelligence, it crucially delineates that the math of supermanifolds is reasonably applicable in Deep

Original: Learning, imparting that cutting edge
Revised: Learning, imparting that cutting edge

Original: Deep
Revised: Deep

Original: Learning work tends to consider boundaries in the biological brain [23] , while underscoring that biological brains can be optimally evaluated using supersymmetric operations.
Revised: Learning work tends to consider boundaries in the biological brain [23] , while underscoring that biological brains can be optimally evaluated using supersymmetric operations.

Original: In broader words, thought curvature occurs on the following evidence:
Revised: In broader words, thought curvature occurs on the following evidence:

Original: Manifolds are in the regime of very general algorithms, that enable models to learn many degrees of freedom in latent space, (i.e. position, scale etc… where said degrees are observable as features of physics interactions) where transformations on points may represent for e.g., features of a particular object in pixel space, and transformations on said points or weights of an object are disentangleable or separable from those pertaining to other objects in latent space.
Revised: Manifolds are in the regime of very general algorithms, that enable models to learn many degrees of freedom in latent space, (i.e. position, scale etc… where said degrees are observable as features of physics interactions) where transformations on points may represent for e.g., features of a particular object in pixel space, and transformations on said points or weights of an object are disentangleable or separable from those pertaining to other objects in latent space.

Original: Given (1), and the generalizability of euclidean space , together with the instance that there persists supersymmetric measurements in biological brains, thought curvature predicates that Supermathematics or Lie Superalgebras (in Supermanifolds ) may reasonably, empirically apply in Deep Learning , or some other named study of hierarchical learning in research.
Revised: Given (1), and the generalizability of euclidean space , together with the instance that there persists supersymmetric measurements in biological brains, thought curvature predicates that Supermathematics or Lie Superalgebras (in Supermanifolds ) may reasonably, empirically apply in Deep Learning , or some other named study of hierarchical learning in research.

Original: 10 A BRIEF DISCUSSION ON THE SIGNIFICANCE OF A TRANSVERSE FIELD ISING SPIN (SUPER)-HAMILTONIAN REINFORCEMENT LEARNING ALGORITHM
Revised: 10 A BRIEF DISCUSSION ON THE SIGNIFICANCE OF A TRANSVERSE FIELD ISING SPIN (SUPER)-HAMILTONIAN REINFORCEMENT LEARNING ALGORITHM

Original: The usage of supersymmetric operations is imperatively efficient, as such operations enable deeply abstract representations (as is naturally afforded by symmetry group Lie
Revised: The usage of supersymmetric operations is imperatively efficient, as such operations enable deeply abstract representations (as is naturally afforded by symmetry group Lie

Original: Superalgebras [26][27] ), pertinently, in a general, biologically tenable time-space complex optimal regime .
Revised: Superalgebras [26][27] ), pertinently, in a general, biologically tenable time-space complex optimal regime .

Original: As such, said deeply abstract representations may reasonably capture certain “physics priors” (See page 1), with respect to the laws of physics.
Revised: As such, said deeply abstract representations may reasonably capture certain “physics priors” (See page 1), with respect to the laws of physics.

Original: 11 AN INFORMAL PROOF OF THE REPRESENTATION POWER GAINED BY DEEPER ABSTRACTIONS OF THE "SUPERSYMMETRIC ARTIFICIAL NEURAL NETWORK"
Revised: 11 AN INFORMAL PROOF OF THE REPRESENTATION POWER GAINED BY DEEPER ABSTRACTIONS OF THE "SUPERSYMMETRIC ARTIFICIAL NEURAL NETWORK"

Original: Machine learning non-trivially concerns the application of families of functions that guarantee more and more variations in weight space.
Revised: Machine learning non-trivially concerns the application of families of functions that guarantee more and more variations in weight space.

Original: This means that machine learning researchers study what functions are best to transform the weights of the artificial neural network, such that the weights learn to represent good values for which correct hypotheses or guesses can be produced by the artificial neural network.
Revised: This means that machine learning researchers study what functions are best to transform the weights of the artificial neural network, such that the weights learn to represent good values for which correct hypotheses or guesses can be produced by the artificial neural network.

Original: The “ Supersymmetric Artificial Neural
Revised: The “ Supersymmetric Artificial Neural

Original: Network ” (a core component in ‘thought curvature’) is yet another way to represent richer values in the weights of the model; because supersymmetric values can allow for more information to be captured about the input space.
Revised: Network ” (a core component in ‘thought curvature’) is yet another way to represent richer values in the weights of the model; because supersymmetric values can allow for more information to be captured about the input space.

Original: For example, supersymmetric systems can capture potentialpartner signals, which is beyond the feature space of magnitude and phase signals learnt in typical real valued neural nets and deep complex neural networks respectively.
Revised: For example, supersymmetric systems can capture potentialpartner signals, which is beyond the feature space of magnitude and phase signals learnt in typical real valued neural nets and deep complex neural networks respectively.

Original: As such, a brief historical progression of geometric solution spaces for varying neural network architectures follows:
Revised: As such, a brief historical progression of geometric solution spaces for varying neural network architectures follows:

Original: An optimal weight space produced by shallow or low dimension integer valued nodes or real valued artificial neural nets , may have good weights that lie for example , in one simple (ℤ 𝑛 𝑜𝑟 ℝ 𝑛 − 𝑜𝑟𝑑𝑒𝑟𝑒𝑑) cone per class/target group .
Revised: An optimal weight space produced by shallow or low dimension integer valued nodes or real valued artificial neural nets , may have good weights that lie for example , in one simple (ℤ 𝑛 𝑜𝑟 ℝ 𝑛 − 𝑜𝑟𝑑𝑒𝑟𝑒𝑑) cone per class/target group .

Original: (This may guarantee some variation , but not enough for more sophisticated tasks of higher dimension)
Revised: (This may guarantee some variation , but not enough for more sophisticated tasks of higher dimension)

Original: An optimal weight space produced by deep and high-dimension-absorbing real valued artificial neural nets , may have good weights that lie in disentangleable (ℝ 𝑛 ∗ ℝ 𝑛 − 𝑜𝑟𝑑𝑒𝑟𝑒𝑑) manifolds per class/target group convolved by the operator ∗ , instead of the simpler regions per class/target group seen in item (1).
Revised: An optimal weight space produced by deep and high-dimension-absorbing real valued artificial neural nets , may have good weights that lie in disentangleable (ℝ 𝑛 ∗ ℝ 𝑛 − 𝑜𝑟𝑑𝑒𝑟𝑒𝑑) manifolds per class/target group convolved by the operator ∗ , instead of the simpler regions per class/target group seen in item (1).

Original: (This may guarantee more variation in the weight space than (1) , leading to better hypotheses or guesses )
Revised: (This may guarantee more variation in the weight space than (1) , leading to better hypotheses or guesses )

Original: An optimal weight space produced by shallow but high dimension-absorbing complex valued artificial neural nets , may have good weights that lie in multiple (ℂ 𝑛 − 𝑜𝑟𝑑𝑒𝑟𝑒𝑑) sectors per class/target group , instead of the real regions per class/target group seen amongst the prior items.
Revised: An optimal weight space produced by shallow but high dimension-absorbing complex valued artificial neural nets , may have good weights that lie in multiple (ℂ 𝑛 − 𝑜𝑟𝑑𝑒𝑟𝑒𝑑) sectors per class/target group , instead of the real regions per class/target group seen amongst the prior items.

Original: (This may guarantee more variation of the weight space than the previous items, by learning additional features , in the “phase space”.
Revised: (This may guarantee more variation of the weight space than the previous items, by learning additional features , in the “phase space”.

Original: This also leads to better hypotheses/guesses )
Revised: This also leads to better hypotheses/guesses )

Original: An optimal weight space produced by deep or high dimension-absorbing complex valued artificial neuralnets may
Revised: An optimal weight space produced by deep or high dimension-absorbing complex valued artificial neural

Original: have
Revised: nets

Original:  good weights that lie in chi distribution bound, (ℂ 𝑛 ∗ ℂ 𝑛 − 𝑜𝑟𝑑𝑒𝑟𝑒𝑑) rayleigh 
Revised: , may have good weights that lie in chi distribution bound, (ℂ 𝑛 ∗ ℂ 𝑛 − 𝑜𝑟𝑑𝑒𝑟𝑒𝑑) rayleigh space per

Revised: class target group

Original: space per class target group convolved by the operator ∗, instead of the simpler sectors/regions per class/target groupseen amongst the previous items.
Revised: convolved by the operator ∗ instead of the simpler sectors/regions per class/target group

Original:  (This may guarantee more variation of the weight space than the prior items , by learning phase space representations , and by extension , strengthen these representations via convolutional residual blocks.
Revised: seen amongst the previous items (This may guarantee more variation of the weight space than the prior items , by learning phase space representations , and by extension , strengthen these representations via convolutional residual blocks.

Original: This also leads to better hypotheses/
Revised: This also leads to better hypotheses/

Original: guesses
Revised: guesses

Original: The “Supersymmetric Artificial Neural
Revised: The “Supersymmetric Artificial Neural

Original: Network” operable on high dimensional data, may reasonably generate good weights that lie in disentangleable (𝐶 ∞ (𝑅 𝑚|𝑛 ) − 𝑜𝑟𝑑𝑒𝑟𝑒𝑑) supermanifolds per class/target group , instead of the solution geometries seen in the prior items above .
Revised: Network” operable on high dimensional data, may reasonably generate good weights that lie in disentangleable (𝐶 ∞ (𝑅 𝑚|𝑛 ) − 𝑜𝑟𝑑𝑒𝑟𝑒𝑑) supermanifolds per class/target group , instead of the solution geometries seen in the prior items above .

Original: Supersymmetric values can encode rich partner-potential delimited features beyond the phase space of (4) in accordance with cognitive biological space [13] , where (4) lacks the partner
Revised: Supersymmetric values can encode rich partner-potential delimited features beyond the phase space of (4) in accordance with cognitive biological space [13] , where (4) lacks the partner

Original: potential formulation describable in
Revised: potential formulation describable in

Original: Supersymmetric embedding.
Revised: Supersymmetric embedding.

Original: 12 PSEUDOCODE FOR THE “SUPERSYMMETRIC ARTIFICIAL NEURAL NETWORK"
Revised: 12 PSEUDOCODE FOR THE “SUPERSYMMETRIC ARTIFICIAL NEURAL NETWORK"

Original: Following, is another view of “solution geometry” history, which may promote a clear way to view the reasoning behind the subsequent pseudocode sequence:
Revised: Following, is another view of “solution geometry” history, which may promote a clear way to view the reasoning behind the subsequent pseudocode sequence:

Original: There has been a clear progression of “ solution geometries ”, ranging from those of the ancient Perceptron [30] to complex valued neural nets [33] , grassmann manifold artificial neural networks [39] or unitaryRNNs .
Revised: There has been a clear progression of “ solution geometries ”, ranging from those of the ancient Perceptron [30] to complex valued neural nets [33] , grassmann manifold artificial neural networks [39] or unitaryRNNs .

Original: [38][40][44] These models may be denoted by 𝜙(𝑥, 𝜃)
Revised: [38][40][44] These models may be denoted by 𝜙(𝑥, 𝜃)

Original: ⊤ 𝑤 parameterized by 𝜃 , expressible as geometrical groups ranging from orthogonal [17] to special unitary group [46] based: 𝑆𝑂(𝑛) to 𝑆𝑈(𝑛) …, and they got better at representing input data i.e. representing richer weights , thus the learning models generated better hypotheses or guesses.
Revised: ⊤ 𝑤 parameterized by 𝜃 , expressible as geometrical groups ranging from orthogonal [17] to special unitary group [46] based: 𝑆𝑂(𝑛) to 𝑆𝑈(𝑛) …, and they got better at representing input data i.e. representing richer weights , thus the learning models generated better hypotheses or guesses.

Original: By “ solution geometry ” I mean simply the class of regions where an algorithm's weights may lie, when generating those weights to do some task.
Revised: By “ solution geometry ” I mean simply the class of regions where an algorithm's weights may lie, when generating those weights to do some task.

Original: As such, if one follows cognitive science , one would know that biological brains may be measured in terms of supersymmetric operations.
Revised: As such, if one follows cognitive science , one would know that biological brains may be measured in terms of supersymmetric operations.

Original: (Perez et al, “Supersymmetry at brain scale”) 4.
Revised: (Perez et al, “Supersymmetry at brain scale”) 4.

Original: These supersymmetric biological brain representations can be represented by supercharge [37] compatible special unitary notation 𝑆𝑈
Revised: These supersymmetric biological brain representations can be represented by supercharge [37] compatible special unitary notation 𝑆𝑈

Original: 𝑚 | 𝑛
Revised: 𝑚|𝑛

Original: , or 𝜙
Revised: , or 𝜙

Original: 𝑥, 𝜃, 𝜃
Revised: 𝑥, 𝜃, 𝜃

Original: ) ⊤
Revised: ) ⊤

Original: 𝑤
Revised: 𝑤

Original: parameterized
Revised: parameterized

Original: by
Revised: by

Original: 𝜃, 𝜃 [34] , which are supersymmetric directions, unlike 𝜃 seen in item (1).
Revised: 𝜃, 𝜃 [34] , which are supersymmetric directions, unlike 𝜃 seen in item (1).

Original: Notably, Supersymmetric values can encode or represent more information than the prior classes seen in (1), in terms of “partner potential” signals for example.
Revised: Notably, Supersymmetric values can encode or represent more information than the prior classes seen in (1), in terms of “partner potential” signals for example.

Original: So, state of the art machine learning work forming 𝑈(𝑛) or 𝑆𝑈(𝑛) based solution geometries, although nonsupersymmetric , are already in the family of supersymmetric solutio n geometries that may be observed as occurring in biological brain or 𝑆𝑈(𝑚|𝑛) supergroup representation .
Revised: So, state of the art machine learning work forming 𝑈(𝑛) or 𝑆𝑈(𝑛) based solution geometries, although nonsupersymmetric , are already in the family of supersymmetric solutio n geometries that may be observed as occurring in biological brain or 𝑆𝑈(𝑚|𝑛) supergroup representation .

Original: I call an “ Edward Witten/String theory powered artificial neural network ”, ‘simply’ an artificial neural network that learns supersymmetric weights.
Revised: I call an “ Edward Witten/String theory powered artificial neural network ”, ‘simply’ an artificial neural network that learns supersymmetric weights.

Original: Looking at the above progression of ‘solution geometries’; going from 𝑆𝑂(𝑛) [30] representation to 𝑆𝑈(𝑛) [38][44] representation has guaranteed richer and richer representations in weight space of the artificial neural network, and hence better and better hypotheses were generatable.
Revised: Looking at the above progression of ‘solution geometries’; going from 𝑆𝑂(𝑛) [30] representation to 𝑆𝑈(𝑛) [38][44] representation has guaranteed richer and richer representations in weight space of the artificial neural network, and hence better and better hypotheses were generatable.

Original: It is perhaps only then reasonable to look to 𝑆𝑈(𝑚|𝑛) representation, i.e. the “ Edward
Revised: It is perhaps only then reasonable to look to 𝑆𝑈(𝑚|𝑛) representation, i.e. the “ Edward

Original: Witten/String theory powered artificial neural network ” (“ Supersymmetric Artificial Neural Network ”).
Revised: Witten/String theory powered artificial neural network ” (“ Supersymmetric Artificial Neural Network ”).

Original: To construct an “ Edward Witten/String theory powered artificial neural network ”, it may be feasible to start with a grassmann manifold artificial neural network then generate ‘charts’ [43] until scenarios occur [34] where the “ Edward Witten/String theory powered artificial neural network” is achieved in the following way:
Revised: To construct an “ Edward Witten/String theory powered artificial neural network ”, it may be feasible to start with a grassmann manifold artificial neural network then generate ‘charts’ [43] until scenarios occur [34] where the “ Edward Witten/String theory powered artificial neural network” is achieved in the following way:

Original: Pseudocode:
Revised: Pseudocode:

Original: a. Initialize input Supercharge [37] compatible special unitary matrix 𝑆𝑈(𝑚|𝑛).
Revised: a. Initialize input Supercharge [37] compatible special unitary matrix 𝑆𝑈(𝑚|𝑛).

Original: [45] (This is the atlas seen in b.) b. Compute ∇𝐶 w.r.t.
Revised: [45] (This is the atlas seen in b.) b. Compute ∇𝐶 w.r.t.

Original: to 𝑆𝑈(𝑚|𝑛) , where C is some cost manifold.
Revised: to 𝑆𝑈(𝑚|𝑛) , where C is some cost manifold.

Original: 
Revised: 

Original: Weight space is reasonably some K¨ahler potential like form: 𝐾(𝜙, 𝜙 ∗ ) , obtained on some initial projective space 𝐶𝑃 𝑛−1 .
Revised: Weight space is reasonably some K¨ahler potential like form: 𝐾(𝜙, 𝜙 ∗ ) , obtained on some initial projective space 𝐶𝑃 𝑛−1 .

Original: [42] 
Revised: [42] 

Original: It is feasible that 𝐶𝑃 𝑛−1 (a 𝐶 ∞ bound atlas ) may be obtained from charts ( 𝑘𝑛 ) of grassmann manifold networks 𝐺𝑅
Revised: It is feasible that 𝐶𝑃 𝑛−1 (a 𝐶 ∞ bound atlas ) may be obtained from charts ( 𝑘𝑛 ) of grassmann manifold networks 𝐺𝑅

Original: 𝑘,𝑛 [39] and stiefel manifolds
Revised: 𝑘,𝑛 [39] and stiefel manifolds

Original: 𝐺𝐹 𝑘,𝑛 , in (𝜙 𝐼 , 𝑈 𝐼 ) terms, where there exists some invertible submatrix entailing matrix 𝐴 ∈
Revised: 𝐺𝐹 𝑘,𝑛 , in (𝜙 𝐼 , 𝑈 𝐼 ) terms, where there exists some invertible submatrix entailing matrix 𝐴 ∈

Original: 𝜙 𝐼 (𝑈 𝐼 ∩ 𝑈 𝐽 ) for 𝑈 𝐼 = 𝜋(𝑉 𝐼 ) where 𝜋 is a submersion mapping on some stiefel manifold 𝐺𝐹 𝑘,𝑛 , thereafter enabling some differentiable grassmann manifold 𝐺𝑅 𝑘 (ℝ 𝑛 ) wherein 𝑉 𝐼 = {𝑢 ∈ ℝ 𝑛×𝑘 :𝑑𝑒𝑡(𝑢 𝐼 ) ≠ 0} .
Revised: 𝜙 𝐼 (𝑈 𝐼 ∩ 𝑈 𝐽 ) for 𝑈 𝐼 = 𝜋(𝑉 𝐼 ) where 𝜋 is a submersion mapping on some stiefel manifold 𝐺𝐹 𝑘,𝑛 , thereafter enabling some differentiable grassmann manifold 𝐺𝑅 𝑘 (ℝ 𝑛 ) wherein 𝑉 𝐼 = {𝑢 ∈ ℝ 𝑛×𝑘 :𝑑𝑒𝑡(𝑢 𝐼 ) ≠ 0} .

Original: [43] c
Revised: [43] c

Original: Parameterize 𝑆𝑈(𝑚|𝑛) in −∇𝐶 terms, by Darboux transformation .
Revised: Parameterize 𝑆𝑈(𝑚|𝑛) in −∇𝐶 terms, by Darboux transformation .

Original: [41] d. Repeat until convergence.
Revised: [41] d. Repeat until convergence.

Original: 13 THOUGHT CURVATUREEXPERIMENTATION CONSIDERATIONS FOR SUPERSYMMETRIC REINFORCEMENT LEARNING
Revised: 13 THOUGHT CURVATUREEXPERIMENTATION CONSIDERATIONS FOR SUPERSYMMETRIC REINFORCEMENT LEARNING

Original: Pertinently, an initial degree of the (Super-)
Revised: Pertinently, an initial degree of the (Super-)

Original: Hamiltonian [16] structure required by thought curvature shall require a quite scalable scheme, such as some boson sampling [20] aligned range, in conjunction with supersymmetric space .
Revised: Hamiltonian [16] structure required by thought curvature shall require a quite scalable scheme, such as some boson sampling [20] aligned range, in conjunction with supersymmetric space .

Original: [11] This scheme is approachable on the scale of 42 qubits [19] , or a 42 qubit = 32 x 2 12 gb = 131,072 gb ram configuration for simple task/circuit tests.
Revised: [11] This scheme is approachable on the scale of 42 qubits [19] , or a 42 qubit = 32 x 2 12 gb = 131,072 gb ram configuration for simple task/circuit tests.

Original: More testing is required to determine the model’s feasibility, and unravel 𝑝̂ data (training sample) types applicable to the model .
Revised: More testing is required to determine the model’s feasibility, and unravel 𝑝̂ data (training sample) types applicable to the model .