During forward pass delete memory for every frame of

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: N log T ) while the compute complexity increase to O(N 2 T log T ). That is, additional factor of computation log T modest, while the reduction factor in memory is large T / log T . Other variants possible as well, √ example we can have O(T N 2 ) for compute while using only O(N T ) memory, asymptotically always better than the default!! Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-32 (of 180) k-best without the penalty Island Summary Scratch Island algorithm: idea divide a length T segment into b subsegments each of length T /b. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-33 (of 180) k-best without the penalty Island Summary Scratch Island algorithm: idea divide a length T segment into b subsegments each of length T /b. During forward pass, delete memory for every frame of the forward pass except for “islands” that occur only every T /b frames. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-33 (of 180) k-best without the penalty Island Summary Scratch Island algorithm: idea divide a length T se...
View Full Document

This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online