An implementation of binary classification for distinguishing between the digits 0/1 and 8/9. We have minimized our cost function using the Gradient Descent and the Exact Newton methods. Step size for these methods was chosen using the Armijo linesearch algorithm.
This work was given as part of an assignment in the course "Optimization Methods and Applications"(Spring 2021).
MNIST dataset(4 files) can be downloaded here: http://yann.lecun.com/exdb/mnist/
-
Notifications
You must be signed in to change notification settings - Fork 0
azoulais/MNIST-Classification-logistic-regression-OPTI-ASS3
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An implementation of binary classification for distinguishing between the digits 0/1 and 8/9. Cost function minimization was applied using Gradient Descent and the Exact Newton methods.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published