Randomized Pruning: Efficiently Calculating Expectations in Large Dynamic Programs

NeurIPS 2009 Alexandre Bouchard-CôtéSlav PetrovDan Klein

Pruning can massively accelerate the computation of feature expectations in large models. However, any single pruning mask will introduce bias... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper

🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet