IdeaCredIdeaCred

softmin/ReHLine-python

91

Regularized Composite ReLU-ReHU Loss Minimization with Linear Computation and Linear Convergence

What's novel

Regularized Composite ReLU-ReHU Loss Minimization with Linear Computation and Linear Convergence

Code Analysis

11 files read · 4 rounds

A high-performance C++/Python solver for empirical risk minimization with convex piecewise linear-quadratic losses and linear constraints, featuring a novel coordinate descent algorithm with free variable sets and shrinking heuristics.

Strengths

Genuinely novel optimization algorithm with strong theoretical foundation (NeurIPS 2023), high-performance C++ core with clean Python API layers, comprehensive test suite validating against sklearn, and support for complex problems including constraints and ElasticNet regularization.

Weaknesses

Some code duplication in the Python layer (similar fit methods across classes), the sklearn mixin module is quite large and could benefit from refactoring, and there's some commented-out code in the path solution module.

Score Breakdown

Innovation
8 (25%)
Craft
85 (35%)
Traction
32 (15%)
Scope
91 (25%)

Signal breakdown

Innovation

Not Fork+1
Code Novelty+2
Concept Novelty+3

Craft

Ci+5
Tests+8
Polish+3
Releases+4
Has License+5
Code Quality+23
Readme Quality+15
Recent Activity+7
Structure Quality+5
Commit Consistency+5
Has Dependency Mgmt+5

Traction

Forks+12
Stars+12
Hn Points+0
Watchers+3
Early Traction+0
Devto Reactions+0
Community Contribs+5

Scope

Commits+8
Languages+8
Subsystems+10
Bloat Penalty+0
Completeness+7
Contributors+8
Authored Files+15
Readme Code Match+3
Architecture Depth+7
Implementation Depth+8

Evidence

Commits

95

Contributors

9

Files

89

Active weeks

28

TestsCI/CDREADMELicenseContributing

Repository

Language

Python

Stars

18

Forks

6

License

MIT