💾 Archived View for jb55.com › ward.bay.wiki.org › solve-for-initial-conditions captured on 2021-12-05 at 23:47:19. Gemini links have been rewritten to link to archived content
⬅️ Previous capture (2021-12-04)
-=-=-=-=-=-=-
The g9 library will adjust algorithmic drawings such that any element can be moved. When someone interacts with the graphics, for example by trying to drag an element to a new position, g9 optimizes over the space of possible values for your data to find a set of values that comes closest to creating the change. From MIT. post
The library will render an image from initial conditions and algorithm. When any part of the generated image is moved, the library asks, what minimal adjustment to initial conditions will result in the revised drawing arriving at the new point.
Buried in the library is a gradient descent solver that runs the calculations in a blink of an eye. github
Gradient descent is a first-order iterative optimization algorithm. To find a local minimum of a function using gradient descent, one takes steps proportional to the negative of the gradient (or of the approximate gradient) of the function at the current point. wikipedia
Regarding an unrelated StrangeLoop presentation Bret Victor says, Pay particular attention to how direct manipulation works by backsolving for variable values w/ numerical minimization. twitter site video