Skip to content

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

Notifications You must be signed in to change notification settings

BrandonCXY/Coordinate-Descent

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 

Repository files navigation

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

About

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

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published