You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Dec 29, 2022. It is now read-only.
Given that prettytensor combined with TF and ipython makes very very easy to do large scale, iterative exploration, I wonder if it would be in scope to incorporate a default implementation of Reusable Holdout [1] into the runner class and provided examples -- specially for less-experienced people to get a head-start in doing analysis in a good way.
Yes, I think that an implementation would be good to have. The method mentioned in the paper (thresholdout) requires a full pass over both the training and holdout dataset so it would need to be implemented as part of the runner or queuing system. Utilities for splitting the data and tracking the number of uses would also be nice.
Given that prettytensor combined with TF and ipython makes very very easy to do large scale, iterative exploration, I wonder if it would be in scope to incorporate a default implementation of Reusable Holdout [1] into the runner class and provided examples -- specially for less-experienced people to get a head-start in doing analysis in a good way.
[1] http://googleresearch.blogspot.com/2015/08/the-reusable-holdout-preserving.html
The text was updated successfully, but these errors were encountered: