Lecture

Linear Classification: Signed Distance and Perceptron

Description

This lecture covers the concept of signed distance in N dimensions for linear classification, the problem statement, and the non-centered perceptron algorithm. It also discusses test time evaluation, Python and JAVA implementations, the problem with the perceptron, logistic regression, sigmoid function, cross entropy, and probabilistic interpretation. The transition from binary to multi-class classification, linear discriminant, decision regions, and multi-class linear classification are explained. The lecture concludes with multi-class logistic regression, cross entropy, activation, and the results of multi-class classification.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.