Skip to main content
Support vector machine

Support vector machine

Search complete. 13 mentions across 6 episodes found for "Support vector machine".

Nov 4, 2026

speaker_3HOST
13:05
That's fascinating.
speaker_3HOST
13:06
But if we pivot back to supervised learning for a second, there is another algorithm that is incredibly vital for security professionals, right? Support vector machines or SVM.
speaker_4HOST
13:17
SVM is a massive one.
speaker_3HOST
13:18
Let's talk about that.

15 MINS LATER

speaker_4HOST
27:55
If you were handed a perfectly labeled historical data set, which supervised algorithm discussed today would you deploy to draw a clear boundary between the threats and the safe traffic?
speaker_3HOST
28:05
Good question.
speaker_4HOST
28:07
Conversely, if you were flying totally blind on a new network and just needed to find hidden anomalies, which unsupervised algorithm would you rely on? Think deeply about the fundamental mechanical differences between how support vector machines separate known data and how K-means clustering searches for the unknown.
speaker_3HOST
28:26
And as you think through that, I want to leave you with a lingering security dilemma.
Tengyu MaHOST
63:45
Maybe you also have g.
Tengyu MaHOST
63:50
And if you do the new right work, I think we have claimed that neural network is the same as L1 SVM in a kernel space.
Tengyu MaHOST
63:59
So then the corresponding thing would be you minimize the L1 norm of A such that the sum of Ai, Vi, Xj is equal to Yj.
Tengyu MaHOST
64:11
So in some sense, when you do the neural networks, you have a lot of features, and you're choosing a subset of features, a sparse subset of features.
Tengyu MaHOST
65:22
And in contrast, regularizing network only need Neuronuts only need n is equal to all of the samples.
Tengyu MaHOST
65:44
Any questions about this? I think this part is a little bit kind of like hand-wavy, because I didn't want to go into all the details.
Tengyu MaHOST
65:51
And also, this depends a little bit on what we discussed in the past, right? So L1-SVM connections to the connection between L1-SVM and writeworks.
Tengyu MaHOST
66:04
Any questions? So I guess maybe just to wrap up this once again.
speaker_3HOST
14:27
Yes.
speaker_3HOST
14:28
They then take this vast phase space data and feed it into a machine learning tool called a support vector machine or an SVM.
speaker_2HOST
14:35
I want to guess how this SVM works.
speaker_3HOST
14:37
Sure.
speaker_3HOST
14:37
Try it.
speaker_3HOST
14:52
In a simple 2D graph, you draw a line.
speaker_2HOST
14:54
But
speaker_3HOST
14:54
in face space, which has many dimensions, the SVM calculates a complex multidimensional boundary called a hyperplane.
Neeraj VermaHOST
11:07
You know, it's, it's interesting, right? 'Cause general- generalized predictive models are...
Neeraj VermaHOST
11:11
So, uh, we've been writing predictive models forever, right? S- whether they're SVM, whether they're neural nets, their heavy use cases are always in analytics, right? When you've got a crap ton of data that you've got to go through and come up with something that's useful-
Eric SiegelGUEST
11:24
Yeah
Neeraj VermaHOST
11:24
...

Unknown podcast

Routing AI Models: When 3 Rules Beat a Trained Router

Oct 11 · 1 Mention

CornHOST
7:23
Sixteen plus routers in five categories.
CornHOST
7:26
Single round, which covers KNN, SVM, MLP, matrix factorization, ELO, Router DC, AutoMix, Hybrid LLM, Graph Router, Causal LM.
CornHOST
7:37
Multi-round, which is Router R1.
CornHOST
7:40
Multimodal, agentic, and personalized, which is GMT Router and personalized router.
John PlattGUEST
39:24
Well, you can view SMO as a almost like stochastic gradient descent where it was trying to be what's the minimal change, which way it goes uphill, given that you have this quadratic program.
John PlattGUEST
39:37
But of course, the quadratic program is very particular to the mathematical structure of SVMs.
John PlattGUEST
39:44
You can view fundamentally SVMs as loss function hacking because instead of okay so if you map for example consider a binary for the simplest case a sigmoid output unit so it's so it's using a cross entropy you know t times log p plus one minus t times log of log one minus p the usual And then you have a sigmoid unit, which is sort of the matched link function to that loss function.
John PlattGUEST
40:21
If you map that back to the logit, it looks like a kind of like a ramp.
John PlattGUEST
40:27
So asymptotically, it looks linear like this and it's flat.

We value your privacy

We use cookies to understand how you use our platform and to improve your experience. Click “Accept All” to consent, or “Decline non-essential” to opt out of non-essential cookies. Read our Privacy Policy.