Video yükleniyor...

Video Yüklenemedi

Ana Sayfaya Dön

Timelapse #171 (14.5 hrs) - Contract work - continue testing D-Spark and the Laguna model drastically increased throughput of my kernel RL engine with D-Spark to hold up to high concurrencies and remove some bottlenecks with compilation time - working on kernel bench multi-GPU and kernel bench mini at...

27,408 görüntüleme • 2 ay önce •via X (Twitter)

21 Yorum

Mihir profil fotoğrafı
Mihir2 ay önce

idk how do you work from your bedroom, I kinda need an office which is not in my apartment

Elliot Arledge profil fotoğrafı
Elliot Arledge2 ay önce

low bandwidth between waking up and kicking off more runs

bbzz profil fotoğrafı
bbzz2 ay önce

@mihirneal how much meter squared is this

Elliot Arledge profil fotoğrafı
Elliot Arledge2 ay önce

@mihirneal havent measured

Leah profil fotoğrafı
Leah2 ay önce

Are you sure this isn’t COVID level isolation ? Timelapses are awesome and the setup looks cozy sometimes, but bro!

Elliot Arledge profil fotoğrafı
Elliot Arledge2 ay önce

pretty close to covid level but im enjoying it

. profil fotoğrafı
.2 ay önce

You don't have a window open, right? Doesn't CO2 build up if you stay that long without any air circulation?

Akshobya profil fotoğrafı
Akshobya2 ay önce

Imagine what it will feel like

maskmanai profil fotoğrafı
maskmanai2 ay önce

Asking again what chair do you have? I need a new one that will support me for hours.

Elliot Arledge profil fotoğrafı
Elliot Arledge2 ay önce

cant remember. some knock off herman miller type

Brayan Ortiz profil fotoğrafı
Brayan Ortiz2 ay önce

🐐🐐🐐🐐

Mika Vohl profil fotoğrafı
Mika Vohl2 ay önce

this guy doesn't miss

Lennart Kotzur profil fotoğrafı
Lennart Kotzur2 ay önce

Please keep the lights on for your eyes my man :’)

âff profil fotoğrafı
âff2 ay önce

fun

mateo profil fotoğrafı
mateo2 ay önce

new angle is epic

nulltron profil fotoğrafı
nulltron2 ay önce

nice to know im not the only one living the grind

gearonixx profil fotoğrafı
gearonixx2 ay önce

keep going Elliot

Nanda profil fotoğrafı
Nanda2 ay önce

This is how we build a Typescript TODO app with the current stacks. 😂

Ana profil fotoğrafı
Ana2 ay önce

Dope Timelapse Elliot.

gearonixx profil fotoğrafı
gearonixx2 ay önce

I did 9h today, gonna do 5 more

Papamasher profil fotoğrafı
Papamasher2 ay önce

Set yourself a limit - you can't work like this for months - seriously mate draw a line in the sand, name the date then take a two week break from the 14hr days.

Benzer Videolar

We are announcing our newest initiative: an interactive math engine by isaacmason. Math is core to everything interactive from geometry to collision to color, yet JavaScript lacks a high-performance kernel. Instead libraries reinvent math structures and transformations, with varying success, and now LLMs generate bespoke functions on a case by case basis. The problem is that there are no principled guarantees for correctness or performance leading to degraded apps or difficult to read code. We need math engine that can be used to power all the cool projects people want to make at scale! The goals of the initiative are ambitious: ⟡ Predictable performance. Allocation-free operations and a documented usage contract designed to preserve monomorphic, optimizable call sites, validated through reproducible benchmarks. ⟡ Portable. Efficiently interoperates with WebGL, WebGPU, Wasm, Three.js, etc., so that the handoff between math kernel and framework is simple. ⟡ Minimal. A lean, tree-shakable kernel containing only the primitives needed to build interactive algorithms. ⟡ Data-oriented. Operates on caller-owned data through data-in, data-out functions without owning the data lifecycle. ⟡ Readability. It is important the core math operations readable such that even if the code is not written by a person they can reasonably review it. isaacmason is bringing his experience building out navcat, crashcat and gpucat. We are starting with mathcat as the foundation and building from there. Stay tuned for more. 👉 Initiative: 👉 Join the convo on Discord:

Poimandres

57,397 görüntüleme • 2 ay önce

SVM by hand ✍️ ~ 19 steps walkthrough below (Linear vs RBF) Support Vector Machines reigned supreme in machine learning before the deep learning revolution. An SVM predicts with dot products, the same matrix multiplication every model uses. What it does not do is train by backpropagation: it is fitted by convex optimization, so there is no matrix-multiplication backward pass for a GPU to accelerate. I drew and calculated two SVMs by hand: a linear one (top) and an RBF one (bottom), classifying the same two test vectors. Goal: turn six training vectors and their learned coefficients into a prediction, and see what changing the kernel actually changes. = 1. Given = Six training vectors, their labels, and the coefficients and bias already learned. A coefficient of zero means that vector is not a support vector: too far from the boundary to matter. = 2. Linear kernel, test vector 1 = Let us take the dot product of the test vector with every training vector. The dot product stands in for cosine similarity, and the column of results is the first column of the kernel matrix K. = 3. Linear kernel, test vector 2 = We do the same for the second, and K is complete. = 4. Signed weights = Let us multiply each coefficient by its label. The second training vector drops out here, because its coefficient is 0. = 5. Weighted combination = We multiply the signed weights through K and add the bias b. The result is a signed distance to the decision boundary: 17 and 5. = 6. Classify = Let us take the sign. Both are positive. = 7 to 11. RBF kernel, test vector 1 = Now the same picture with a different kernel, in five moves: square the differences, sum them, take the square root for the L2 distance, multiply by minus gamma, and raise e to that power. The negation is what turns a distance into a similarity, and gamma controls how far a single training vector's influence reaches. = 12 to 16. RBF kernel, test vector 2 = We repeat all five. The numbers change, the moves do not. = 17 to 19. Decision boundary, again = Signed weights, weighted combination, sign. Identical arithmetic to steps 4 through 6, on a K that was built a completely different way. The outputs: Linear K, first column = [13, 25, 12, 15, 19, 27] Linear decision values = 17 and 5, both positive RBF decision values = -2 and 1, so negative and positive The takeaway: the kernel is the only thing that changed, and it changed the answer. The linear SVM calls both test vectors positive; the RBF one splits them. Everything after the kernel matrix, the signed weights and the weighted combination and the sign, is the same page of arithmetic twice. 💾 Save this post!

Tom Yeh

16,916 görüntüleme • 2 ay önce