Skip to content

Latest commit

 

History

History
8 lines (7 loc) · 494 Bytes

README.md

File metadata and controls

8 lines (7 loc) · 494 Bytes

Coordinate-Descent

This is a course project of CSE 251A Introduction to AI A Statistical Approach in UCSD

Coordinate descent is a simple and useful approach to solve an unconstrained optimization problem.

Here are the steps: • Designed and and implemented the Coordinate Descent algorithm to solve the standard unconstrained optimization problem in Machine Learning (Loss Function) • Compared it with Standard Logistic Regression solver in a binary classification problem