Practical parallel hypergraph algorithms
LifeIsStrange opened this issue · 4 comments
LifeIsStrange commented
I just stumbled upon this paper about optimizing hypergraphs, thought it might interest opencog
Feel free to close this "issue" :)
linas commented
In private conversation, someone told me this:
When it comes to recursion schemes, I found that a histomorphism with early stopping works perfectly on graphs. You can implement a lot of popular graph algorithms (and some very neat ones like http://nn.cs.utexas.edu/downloads/papers/stanley.ec02.pdf) with an (iterated) application of this recursion scheme with a simple algebra.
I don't know what a histomorphism is ...
LifeIsStrange commented
I don't know what they are either :/ but I might remember @bgoertzel talking about them on the discord, or was it another *morphism ?
There is this blog about it: https://www.reddit.com/r/haskell/comments/75pfaz/recursion_schemes_exploring_histomorphisms_and/
bgoertzel commented
A histomorphism is basically a fold operation w/ a memory (so each step of
the fold can take place incorporating knowledge of what's been done in the
folding process so far)
This series of blog posts gives a good overview of the various funky fold
variants (morphisms)
https://blog.sumtypeofway.com/posts/recursion-schemes-part-5.html
The specifics of various types of folds/unfolds on metagraphs I elaborated
a little here
https://arxiv.org/abs/2012.01759
which is the first in a series of 3 papers, the second deals w/
paraconsistent & probabilistic logic and is here
https://arxiv.org/abs/2012.14474
and the third will be posted shortly, using Galois connections to give a
fairly general mapping of (e.g. OpenCog) cognitive algorithms into
metagraph chronomorphisms...
…On Sat, Feb 20, 2021 at 4:17 PM Linas Vepštas ***@***.***> wrote:
In private conversation, someone told me this:
When it comes to recursion schemes, I found that a histomorphism with
early stopping works perfectly on graphs. You can implement a lot of
popular graph algorithms (and some very neat ones like
http://nn.cs.utexas.edu/downloads/papers/stanley.ec02.pdf) with an
(iterated) application of this recursion scheme with a simple algebra.
I don't know what a histomorphism is ...
—
You are receiving this because you are subscribed to this thread.
Reply to this email directly, view it on GitHub
<#2788 (comment)>,
or unsubscribe
<https://github.com/notifications/unsubscribe-auth/ABNCKXB7E737IEF3OBBEOSLTABGHNANCNFSM4XT3WONQ>
.
--
Ben Goertzel, PhD
http://goertzel.org
“He not busy being born is busy dying" -- Bob Dylan
bgoertzel commented
Ba-Da-Boom !!
Here finally is what I was thinking when I passed around that paper on
Programming with Galois Connections some time ago...
This is in the same vein as good old OpenCoggy Probabilistic Programming
--- sorta OpenCoggy PP on dynamic programming, Galois connections and
chronomorphisms...
There is plenty that's still heuristic and slippery here, as is inevitable
w AGI under realistic resources, but I think this makes non-trivial
progress toward understanding how to implement the various OpenCog
cognitive algorithms in a common practical prog-language as well as common
theoretical framework...
Builds on the prior documents on metagraph folds and
paraconsistent/probabilistic logic, though not relying so much on the
details of the latter
…On Sat, Feb 20, 2021 at 11:06 PM Ben Goertzel ***@***.***> wrote:
A histomorphism is basically a fold operation w/ a memory (so each step of
the fold can take place incorporating knowledge of what's been done in the
folding process so far)
This series of blog posts gives a good overview of the various funky fold
variants (morphisms)
https://blog.sumtypeofway.com/posts/recursion-schemes-part-5.html
The specifics of various types of folds/unfolds on metagraphs I elaborated
a little here
https://arxiv.org/abs/2012.01759
which is the first in a series of 3 papers, the second deals w/
paraconsistent & probabilistic logic and is here
https://arxiv.org/abs/2012.14474
and the third will be posted shortly, using Galois connections to give a
fairly general mapping of (e.g. OpenCog) cognitive algorithms into
metagraph chronomorphisms...
On Sat, Feb 20, 2021 at 4:17 PM Linas Vepštas ***@***.***>
wrote:
> In private conversation, someone told me this:
>
> When it comes to recursion schemes, I found that a histomorphism with
> early stopping works perfectly on graphs. You can implement a lot of
> popular graph algorithms (and some very neat ones like
> http://nn.cs.utexas.edu/downloads/papers/stanley.ec02.pdf) with an
> (iterated) application of this recursion scheme with a simple algebra.
>
> I don't know what a histomorphism is ...
>
> —
> You are receiving this because you are subscribed to this thread.
> Reply to this email directly, view it on GitHub
> <#2788 (comment)>,
> or unsubscribe
> <https://github.com/notifications/unsubscribe-auth/ABNCKXB7E737IEF3OBBEOSLTABGHNANCNFSM4XT3WONQ>
> .
>
--
Ben Goertzel, PhD
http://goertzel.org
“He not busy being born is busy dying" -- Bob Dylan
--
Ben Goertzel, PhD
http://goertzel.org
“He not busy being born is busy dying" -- Bob Dylan