methodology-1
Ticket Search
3260 papers • 126 benchmarks • 313 datasets
This task has no description! Would you like to contribute one?
(Image credit: Papersgraph)
Benchmarks
These leaderboards are used to track progress in ticket-search-1
Trend
Dataset
Best Model
Actions
No benchmarks available.
Libraries
iUse these libraries to find ticket-search-1 models and implementations
Datasets
No datasets available.
Subtasks
No subtasks available.
Most implemented papers
Winning the Lottery with Continuous Sparsification
M. Maire, Pedro H. P. Savarese, Hugo Silva•Tue Sep 24 2019
Continuous Sparsification is proposed, a new algorithm to search for winning tickets which continuously removes parameters from a network during training, and learns the sub-network's structure with gradient-based methods instead of relying on pruning strategies.
151