Тёмный

C++ - designing an accelerated "gradient descent" algorithm. 

Carlo Wood
Подписаться 8 тыс.
Просмотров 266
50% 1

More algorithm improvements are needed. Right now cubic are rejected (to be used, and jump to their local extreme) because their second derivative at the coordinate of the last found local extreme doesn't match with the second derivative of the fourth degree polynomial fitted around that local extreme; while the rejected cubic doesn't even share a point with the fourth degree polynomial. What I should do is not just store the last_extreme_cubic_ but also the left- or right-most (depending on the direction that we're going into) sample that was used for the fourth degree polynomial fit and the value of the second derivative in that point. And then only reject cubic that use the same point but whose second derivative in that same point deviates too much.
You can follow the progress of the project as a whole here: github.com/Car...
discord: / discord

Опубликовано:

 

18 сен 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии    
Далее
C++ Should Be C++ - David Sankel - C++Now 2024
1:28:49
Просмотров 18 тыс.
Coding Adventure: Simulating Fluids
47:52
Просмотров 1,8 млн
how Google writes gorgeous C++
7:40
Просмотров 880 тыс.
Weak Pointers in C++ (std::weak_ptr)
17:25
Просмотров 49 тыс.
How to Do 90% of What Plugins Do (With Just Vim)
1:14:03
Просмотров 895 тыс.
Believably Recreate Photographs in Any 3D Program | Part 1
3:47:34
How I use C++: a line-by-line code review
1:40:40
Просмотров 270 тыс.
I gave 127 interviews. Top 5 Algorithms they asked me.
8:36