On Sunday, May 12, 2024, at 12:13 AM, immortal.discoveries wrote: > But doesn't it have to run the code to find out no?
The people who wrote the paper did some nice work on this. They laid it out perhaps intentionally so that doing it again with modified structures is easy to visualize. A simple analysis would be to basically “tween” mathematics and graph structure as a vector from MLP to KAN to open a peep whole into the larger thing. Right, a generalized software system test host… think reflection, many programming languages have reflection, so you reflect off of the test structure as the abstraction layer into a fixed computing resource measurement to rank. It’s not difficult to generate the structures but how do you find the best candidates to run the tester on? Perhaps a coupling with some topology of computational complexity classes and see which structures push easiest into that?… or some other method… this is probably the difficult part... unless you just throw massive computing power at it :) But yes, when you start thinking about it there might be a recursion where the MLP/KAN’s or whatever view themselves to self modify. ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T1af6c40307437a26-M50970ab0535f6725bf2e12ec Delivery options: https://agi.topicbox.com/groups/agi/subscription
