-
-
Notifications
You must be signed in to change notification settings - Fork 9
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Some weird first forgetting curves #29
Comments
Hypothesis: The user has two presets with two graduate intervals. And the materials are very different in these two presets. To validate the hypothesis, we need to know which presets those cards are from. |
A bit unrelated to the current issue, but I wonder if we should change this:
Specifically, these lines:
I wonder if we should just simply switch |
@dae, is it possible to include the preset or deck info in the benchmark dataset? Besides, I'm also working on the question: should we use different presets (parameters) in different decks? If so, when? Those features are also helpful to research the question. Here is an initial analysis: https://github.com/open-spaced-repetition/fsrs-when-to-separate-presets If sharing |
It would need to be anonymised. I can do it, but it will be a while until I can find the time. |
@dae I also have a request: include both card ID and note ID. I have an idea how to account for reviews of siblings, though it will probably only work "on paper", in the benchmark, and won't be feasible in Anki itself (it requires inserting pseudo-reviews into a card's history). Still, I would appreciate it if you made a dataset with both |
@dae just a reminder about the dataset. I know that changing the way Anki works to make it so that FSRS can access the history of card B while the user is reviewing card A would be too much, but I still want to test whether that would improve the accuracy of FSRS. And it's possible to do that "on paper". For that, the new dataset needs both card ID and note ID. Then we could benchmark how much taking siblings into account affects accuracy. If the results are good, maybe you could consider changing the way Anki works. Allowing arbitrary connections between cards could increase the benefit further, too. I know that Anki doesn't allow to define arbitrary connections between any two cards (and you are probably against it), but it could, in theory, greatly reduce the workload. It could even open up the path for a completely new thing - pre-made decks with pre-defined connections. Domain experts would make decks where they specify which cards are related. Something like this: https://www.justinmath.com/individualized-spaced-repetition-in-hierarchical-knowledge-structures/ |
This was sitting in my inbox and not forgotten about, but it's likely going to be a while longer until I've caught up enough to get to this I'm afraid. |
@dae Once you do decide to make a new dataset, please take this into consideration: https://forums.ankiweb.net/t/question-how-difficult-would-it-be-to-give-fsrs-access-to-certain-info/47645
|
I think half of what you're asking was already in the data I provided to @L-M-Sherlock, or can be inferred from it. He processed it to make it smaller, and things like timestamps were lost. When I have time to generate another dataset, I will do a small test run first so we can confirm it has the required info. |
Circling back to this, I see that I already put the relevant export code in Please note the info must maintain privacy. Deck/Preset IDs are ok, but no user-provided content like names should be included. And the export process should be relatively straight-forward - if expensive computation is required, that should be done in a separate step. |
Btw @dae, I tried adding the number of hours since Regarding preset and deck names, you can either run them through some hash function to scramble them for the sake of privacy, or just give their IDs (actually, do decks/presets have IDs?), either works well. |
Thanks! I will create a PR later. And I plan to export the tree of deck ids which record the information of hierarchical structure. |
The text was updated successfully, but these errors were encountered: