0
$\begingroup$

I have a question related to machine learning. Consider the case when in the problem of binary classification the training set is linearly separable. How to show that in this case the optimization problem for logistic regression without $L_2$-regularization does not have optimum?

$\endgroup$
  • $\begingroup$ Do you mean a unique optimum solution? Or an optimal objective value? $\endgroup$ – LinAlg Feb 10 at 15:12
  • $\begingroup$ @LinAlg I mean a unique optimum solution. $\endgroup$ – Scout Feb 10 at 16:04
  • 1
    $\begingroup$ That is exactly the concept of 'unique identification'. Look for 'identifiable' on the Wikipedia page of logistic regression. $\endgroup$ – LinAlg Feb 10 at 21:07

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.