I followed RaffK project to its completion and did much more feature development such as complete chat feature. I created a lot of Modern and screaming Future C++, it is sort of crazy. This ChatGPT2 animation experiment involved training chatgpt2 on scrolling Shakespeare 1000 times using SGD with a learn rate of 0.0002. After SGDContinue reading “ChatGPT2 Animator Adventure”
Author Archives: Nicholas Komsa
Concerning First Citizen
So, in my last project video, seen here: I started a GPT2 124 project, following a Raff K. project, and have worked on it for some time now. This is the link: https://github.com/nicholaskomsa/NetworkLib/tree/master/NetworkLibTest Raff K project can be seen here: GPT-2 from Scratch in C (Day 2/2) Right now, ChatGPT2 forwards and produced output prediction.Continue reading “Concerning First Citizen”
A way to declare functions in Future C++
Since C++ 20, there are Future C++ people creating sum functions that are coroutines. C++20 introduces new keywords such as co_await, co_yield, and co_return, and much more in support of a new feature called coroutines, which is a way to pause a function and run some other function, only to return later while that otherContinue reading “A way to declare functions in Future C++”
Golden Ticket Exploration
So, if we have made some network, initial state, not like this one: And we applied typical backpropagation training process using SGDx0.002, on MNIST, we could get an image somehow like this: This is an image of a trained Golden Ticket than I created which is not Dyson Hatching and I will describe later. WhatContinue reading “Golden Ticket Exploration”
Dyson Hatching Golden Ticket
Nick: so now it is time to make use of the voronoi diagram. To begin, I want to calculate the average slope of the edges of each cell ChatGPT: The slope of a line is typically calculated as the difference in the y-coordinates of two points divided by the difference in the x-coordinates of thoseContinue reading “Dyson Hatching Golden Ticket”
ChatGPT and Golden Ticket pt 3
ChatGPT: Yes, that’s correct. Once you have a Delaunay triangulation, generating the corresponding Voronoi diagram is relatively straightforward. In a Voronoi diagram, each cell consists of all the points that are closer to a particular site (i.e., an input point) than to any other. This makes the Voronoi cell the dual of the Delaunay triangle,Continue reading “ChatGPT and Golden Ticket pt 3”
ChatGPT and Golden Ticket 2
Nick: We shall now examine polygon creation ChatGPT: Okay, the next step is to create the polygon that is the hole created by the bad triangles. This polygon is going to be filled by new triangles formed by the vertex v and each edge of the polygon. First, you need to extract all the edgesContinue reading “ChatGPT and Golden Ticket 2”
ChatGPT and Golden Ticket
So, some long time ago when ChatGPT first came out, the first really cool thing I somehow made, was my Golden Ticket algorithm. I’m going to discuss the Golden Ticket code and the production method I used with the original ChatGPT. This is an easy task because my chat history is saved by Open Ai.Continue reading “ChatGPT and Golden Ticket”
From memory management to memory managed
One fundamental difference between outdated C/C++ code and Modern C++ code, is that one is still stuck in memory management, and the other is instead memory managed, in the powerful grip of the STL phenomena. Another problem is that “C/C++” has been a misnomer for some time, more than a decade – and yet itContinue reading “From memory management to memory managed”
Move Construction in C++
So, in this example program, I demonstrate the move operators. Their purpose is to do a shallow copy of an object: copy all pointers rather than pointer contents. The ephemeral source object is now considered to have an invalid state and is probably going out of scope soon. In this program, I create an object,Continue reading “Move Construction in C++”
Spot C++ 