Skip to content
nonconvexcard

Logistic regression diverges on separable data

ProofIntermediate⏱ 30 minClassical MLseparabilitydivergenceimplicit biasmax margin

Problem

Show that if the data is linearly separable the logistic likelihood has no maximiser and ∥wt∥→∞\|w_t\|\to\infty. Then state (without proving) what is known about the direction of divergence, and explain why that is a rigorous instance of implicit bias.

Write a complete argument. Every inequality you use should be one you could state precisely.

Solution

Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.

Related problems

All problems
SolvedProblemFieldTypeDifficultyTime
XOR is not linearly separableDeep LearningProofFoundation15 min
Convexity of the logistic lossClassical MLProofBeginner15 min
The exact step-size threshold on a quadraticOptimizationProofBeginner15 min
The proximal operator of the l1 normAdvanced OptimizationProofBeginner15 min
Gradient descent finds the minimum-norm interpolatorLearning TheoryProofIntermediate30 min