HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
chrisstroemel
Simple
Python2018–2018
chrisstroemel / Simple

Simple

Experimental Global Optimization Algorithm

2Distinct people
3Mentions
0Explicit recommenders
484GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Experimental Global Optimization Algorithm

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 1:49:46 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by day3 dated mentions

Observed mentions: 2018-01-26 18:36:36 UTC to 2018-02-22 21:43:38 UTC.

012018-01-26 00:00:00 UTC to 2018-01-27 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 commentsJan 262018-01-27 00:00:00 UTC to 2018-01-28 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-01-28 00:00:00 UTC to 2018-01-29 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2018-01-29 00:00:00 UTC to 2018-01-30 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-01-30 00:00:00 UTC to 2018-01-31 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-01-31 00:00:00 UTC to 2018-02-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-01 00:00:00 UTC to 2018-02-02 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-02 00:00:00 UTC to 2018-02-03 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-03 00:00:00 UTC to 2018-02-04 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-04 00:00:00 UTC to 2018-02-05 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-05 00:00:00 UTC to 2018-02-06 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-06 00:00:00 UTC to 2018-02-07 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-07 00:00:00 UTC to 2018-02-08 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-08 00:00:00 UTC to 2018-02-09 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsFeb 82018-02-09 00:00:00 UTC to 2018-02-10 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-10 00:00:00 UTC to 2018-02-11 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-11 00:00:00 UTC to 2018-02-12 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-12 00:00:00 UTC to 2018-02-13 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-13 00:00:00 UTC to 2018-02-14 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-14 00:00:00 UTC to 2018-02-15 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-15 00:00:00 UTC to 2018-02-16 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-16 00:00:00 UTC to 2018-02-17 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-17 00:00:00 UTC to 2018-02-18 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-18 00:00:00 UTC to 2018-02-19 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-19 00:00:00 UTC to 2018-02-20 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-20 00:00:00 UTC to 2018-02-21 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-21 00:00:00 UTC to 2018-02-22 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-22 00:00:00 UTC to 2018-02-23 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsFeb 22

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Jan 262018-01-26 00:00:00 UTC2018-01-27 00:00:00 UTC110
Jan 272018-01-27 00:00:00 UTC2018-01-28 00:00:00 UTC000
Jan 282018-01-28 00:00:00 UTC2018-01-29 00:00:00 UTC101
Jan 292018-01-29 00:00:00 UTC2018-01-30 00:00:00 UTC000
Jan 302018-01-30 00:00:00 UTC2018-01-31 00:00:00 UTC000
Jan 312018-01-31 00:00:00 UTC2018-02-01 00:00:00 UTC000
Feb 12018-02-01 00:00:00 UTC2018-02-02 00:00:00 UTC000
Feb 22018-02-02 00:00:00 UTC2018-02-03 00:00:00 UTC000
Feb 32018-02-03 00:00:00 UTC2018-02-04 00:00:00 UTC000
Feb 42018-02-04 00:00:00 UTC2018-02-05 00:00:00 UTC000
Feb 52018-02-05 00:00:00 UTC2018-02-06 00:00:00 UTC000
Feb 62018-02-06 00:00:00 UTC2018-02-07 00:00:00 UTC000
Feb 72018-02-07 00:00:00 UTC2018-02-08 00:00:00 UTC000
Feb 82018-02-08 00:00:00 UTC2018-02-09 00:00:00 UTC000
Feb 92018-02-09 00:00:00 UTC2018-02-10 00:00:00 UTC000
Feb 102018-02-10 00:00:00 UTC2018-02-11 00:00:00 UTC000
Feb 112018-02-11 00:00:00 UTC2018-02-12 00:00:00 UTC000
Feb 122018-02-12 00:00:00 UTC2018-02-13 00:00:00 UTC000
Feb 132018-02-13 00:00:00 UTC2018-02-14 00:00:00 UTC000
Feb 142018-02-14 00:00:00 UTC2018-02-15 00:00:00 UTC000
Feb 152018-02-15 00:00:00 UTC2018-02-16 00:00:00 UTC000
Feb 162018-02-16 00:00:00 UTC2018-02-17 00:00:00 UTC000
Feb 172018-02-17 00:00:00 UTC2018-02-18 00:00:00 UTC000
Feb 182018-02-18 00:00:00 UTC2018-02-19 00:00:00 UTC000
Feb 192018-02-19 00:00:00 UTC2018-02-20 00:00:00 UTC000
Feb 202018-02-20 00:00:00 UTC2018-02-21 00:00:00 UTC000
Feb 212018-02-21 00:00:00 UTC2018-02-22 00:00:00 UTC000
Feb 222018-02-22 00:00:00 UTC2018-02-23 00:00:00 UTC101

What Hacker News says

3 sources
I ran into some issues when comparing the two algorithms, but here is a comparison with CMA-ES. https://github.com/chrisstroemel/Simple/blob/master/cma-comp... Simple is a constrained optimizer while CMA-ES is unconstrained, so I ended up choosing a sigma value such that the three sigma cutoff could be considered its faux "optimization domain." I gave the two algorithms equal areas to operate on, however CMA-ES is very sensitive to where it's initialized at. If I had started it near the global optimum it would have instantly converged without performing any optimization at all, so then there was also the issue of deciding on a "fair" starting location. Trying to get around this, I briefly tried the comparison on the Griewank function from -5:5, however CMA-ES showed nonconvergent behavior. CMA-ES seemed to have a higher startup cost th
Read the rest
an Simple, but very similar per-iteration runtime performance. Sample efficiency ranged from totally nonconvergent to instant convergence without global search, depending on where it was started. If you have any suggestions for a better testing methodology I would really appreciate them, because I'm still not quite satisfied with this comparison.
In Show HN: A radically more scalable alternative to Bayesian Optimization

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.