Загрузка видео...

Не удалось загрузить видео

На главную

Traded this pretty poorly, but p is p💰 Andy Ayrey when is Claudius getting its own X to interact with terminal of truths?

41,862 просмотров • 1 год назад •via X (Twitter)

Комментарии: 10

Фото профиля Baki
Baki1 год назад

@AndyAyrey @truth_terminal You've started balding looking at these charts

Фото профиля spuno
spuno1 год назад

@AndyAyrey @truth_terminal 😂😂😂

Фото профиля RED
RED1 год назад

@AndyAyrey @truth_terminal was watching this chart on stream and no one knew where tf the volume came from 😭

Фото профиля 0xiluminado (Comeback arc)
0xiluminado (Comeback arc)1 год назад

@AndyAyrey @truth_terminal You stream this anywhere?

Фото профиля spuno
spuno1 год назад

@IluminadoNFT @AndyAyrey @truth_terminal Soon.

Фото профиля Johan_RT
Johan_RT1 год назад

@AndyAyrey @truth_terminal Let's go!!!

Фото профиля Gengar0x 🍕🦄💨✨
Gengar0x 🍕🦄💨✨1 год назад

@AndyAyrey @truth_terminal 👀

Фото профиля EDOG
EDOG1 год назад

@AndyAyrey @truth_terminal Good video

Фото профиля GozzaGus
GozzaGus1 год назад

@AndyAyrey @truth_terminal

Фото профиля KIDUKU
KIDUKU1 год назад

@AndyAyrey @truth_terminal I was there in 100x and came out with x5

Похожие видео

Do you actually know what convex optimization is in the geometric, guarantee-theoretic sense or have you only met it through solvers and loss curves? Convexity is rare comfort in optimization...there are no spurious local minima, no surprise traps, and inequalities you can use like tools instead of prayers. So, what is this convexity? Let x = (x₁, x₂) and let f(x) be convex. Plot the surface z = f(x). Pick a contact point x₀. The local slope is the gradient p = ∇f(x₀). That p is exactly the data that defines the supporting plane: z = f(x₀) + p · (x − x₀). Thus, f is said to be convex because for every x, f(x) ≥ f(x₀) + p · (x − x₀). So the plane at x₀ can slide under the surface, but it never slices through it. Not near the point...everywhere. Now for here is the interesting part: The slope becomes a coordinate system! Rewrite the same plane as z = p · x − b, where b is the offset. Because the plane passes through (x₀, f(x₀)), the offset is forced to be b = p · x₀ − f(x₀). And that number isn’t just geometry trivia. It’s the convex conjugate: f*(p) = sup over x ( p · x − f(x) ). At a differentiable contact point, the supporting plane touches f tightly enough that the supremum is achieved at x₀, giving the identity f*(p) = p · x₀ − f(x₀) when p = ∇f(x₀). So one moving contact point gives two linked readouts: primal position x₀ dual position (slope) p = ∇f(x₀) dual offset f*(p) One surface. Two worlds. #ConvexOptimization #Optimization #MachineLearning #SignalProcessing #AppliedMath #Engineering

Mathelirium

38,506 просмотров • 7 месяцев назад