Loading video...

Video Failed to Load

Go Home

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 views • 1 year ago •via X (Twitter)

10 Comments

Baki's profile picture
Baki1 year ago

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

spuno's profile picture
spuno1 year ago

@AndyAyrey @truth_terminal 😂😂😂

RED's profile picture
RED1 year ago

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

0xiluminado (Comeback arc)'s profile picture
0xiluminado (Comeback arc)1 year ago

@AndyAyrey @truth_terminal You stream this anywhere?

spuno's profile picture
spuno1 year ago

@IluminadoNFT @AndyAyrey @truth_terminal Soon.

Johan_RT's profile picture
Johan_RT1 year ago

@AndyAyrey @truth_terminal Let's go!!!

Gengar0x 🍕🦄💨✨'s profile picture
Gengar0x 🍕🦄💨✨1 year ago

@AndyAyrey @truth_terminal 👀

EDOG's profile picture
EDOG1 year ago

@AndyAyrey @truth_terminal Good video

GozzaGus's profile picture
GozzaGus1 year ago

@AndyAyrey @truth_terminal

KIDUKU's profile picture
KIDUKU1 year ago

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

Related Videos

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 views • 9 months ago