#introductions hi, i'm connor.
sometimes i hack #zelda games for the #n64, but more generally i follow wherever my interests take me. i tend to avoid big projects because of that. i ramble a lot about whatever i'm working on or learning about.
# here's the entire function
def ridgecircle(x, expo=0.5, axis=-1):
n = len(x)
s = np.sum(np.square(x), axis=axis)
return ((s - n)**2)**(expo / 2) + s / n + np.sum(x, axis=axis) / n
my algorithm is currently horribly inefficient with samples but i still have a lot of ideas on how to improve it
here's one variation, running on the rosenbrock function
i'm gonna see if i can make a gif later
but this seems like a *lot* of work for something that is definitely going to converge slowly
i wonder what the hell that almost tom-tom-like instrument is in the background? it sounds bitcrushed, ring-modulated and resonant-filtered, so it could be just about anything really
the parts themselves are simple but difficult combined
oh the power went out and it couldn't sync the time when it rebooted, and i don't have a service running to keep it synced...
well never mind "released," i'm sure this guy saw all the prototypes too