Orbit: an experimental platform for small tasks repeated over time

Re:Orbit: an experimental platform for small tasks repeated ... by cyphar on Wednesday May 05, 2021 @02:18PM (#27053628)

The schematics for the older versions of the SuperMemo algorithm (SM-2 and SM-5) have been published but they're quite old and any good reimplementation is actually a fork that fixes glaring deficiencies in the old algorithms.

The newest versions (SM-19) are proprietary and rely on a bunch of training data (they use some kind of ML) gathered from SuperMemo users (there is a way to get access to SuperMemo algorithm but you have to negotiate a license from memory). There is some rough outline of the algorithms on the SuperMemo wiki, but you couldn't reimplement it any more than you could reimplement Google Search given the Wikipedia description of PageRank.

[ Parent | on HN ]

Re:Orbit: an experimental platform for small tasks repeated ... by BeetleB on Wednesday May 05, 2021 @05:19PM (#27055966)

> there is a way to get access to SuperMemo algorithm but you have to negotiate a license from memory

Well, SuperMemo may be of some help to the memory portion :-)

[ Parent | on HN ]

Re:Orbit: an experimental platform for small tasks repeated ... by alessivs on Friday May 07, 2021 @09:42AM (#27075736)

Is this public information? Where can I read more about SM-19?

[ Parent | on HN ]

Re:Orbit: an experimental platform for small tasks repeated ... by cyphar on Sunday May 09, 2021 @09:09AM (#27095657)

Sorry I meant SM-18 (released in 2019, hence the confusion). But for completeness the only information available on SM-17 is one of two incredibly long articles written by Piotr Wozniak[1,2]. SM-18 is only a minor improvement over SM-17, with some changes to how difficulty is calculated[3].

[1]: https://supermemo.guru/wiki/Algorithm_SM-17 [2]: https://www.supermemo.com/en/articles/history [3]: https://supermemo.guru/wiki/Item_difficulty_in_Algorithm_SM-...

[ Parent | on HN ]