Conversation
trolando
force-pushed
the
master
branch
2 times, most recently
from
241df56 to
10f67d6
Compare
trolando
force-pushed
the
master
branch
7 times, most recently
from
a3cd3d1 to
6f849c7
Compare
trolando
force-pushed
the
dftl
branch
3 times, most recently
from
d993d80 to
150abf2
Compare
trolando
force-pushed
the
master
branch
2 times, most recently
from
f682d5a to
32950f2
Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Work on the DFTL (distraction-free tangle learning) algorithm.
This was a rather tricky algorithm to study, but unfortunately it admits an exponential lower bound following fibonacci's sequence. This counterexample doesn't work for the PDFTL variation, but I suspect the counterexample can be modified to compensate for the prepartition somehow.