D: right ?
A: Yeah , the the way we want to do D: Cuz they 're doing LDA RASTA .
A: The
A: d What ?
D: They 're doing LDA RASTA ,
A: Yeah , the way we want to do it perhaps is to just to get the VAD labels and the final features .
D: yeah ?
A: So they will send us the Well , provide us with the feature files ,
D: I see .
D: I see .
A: and with VAD uh , binary labels
A: so that we can uh , get our MLP features
A: and filter them with the VAD
A: and then combine them with their f feature stream .
D: I see .
A: So .
D: So we So . First thing of course we 'd wanna do there is to make sure that when we get those labels of final features is that we get the same results as them .
D: Without putting in a second path .
A: Uh . You mean A: Oh , yeah !
A: Just re re retraining r retraining the HTK ?
D: Yeah just th w i i Just to make sure that we have we understand properly what things are , our very first thing to do is to is to double check that we get the exact same results as them on HTK .
A: Oh yeah .
A: Yeah , OK .
A: Mmm .
D: Uh , I mean , I don't know that we need to r
B: Yeah .
A: Yeah .
D: Um Do we need to retrain
D: I mean we can just take the re their training files also .
D: But . But , uh
D: just for the testing , jus just make sure that we get the same results so we can duplicate it before we add in another A: Mmm .
A: OK .
D: Cuz otherwise , you know , we won't know what things mean .
A: Oh , yeah .
A: OK .
A: And um .
A: Yeah , so fff , LogRASTA ,
A: I don't know if we want to A: We can try networks with LogRASTA filtered features .
D: Maybe .
A: Mmm .
A: I 'm sorry ?
A: Yeah . Well A: Yeah .
D: Oh ! You know , the other thing is when you say comb
A: But D: I 'm I 'm sorry , I 'm interrupting . <comment> that
D: u Um , uh , when you 're talking about combining multiple features ,
D: um Suppose we said , " OK , we 've got these different features and so forth ,
D: but PLP seems pretty good . "
D: If we take the approach that Mike did and have A: Mm - hmm .
D: I mean , one of the situations we have is we have these different conditions .
D: We have different languages ,
D: we have different  different noises ,
D: Um If we have some drastically different conditions and we just train up different M L Ps with them .
D: And put put them together .
D: What what What Mike found , for the reverberation case at least , I mean D: I mean , who knows if it 'll work for these other ones .
D: That you did have nice interpolative effects .
D: That is , that yes , if you knew what the reverberation condition was gonna be and you trained for that , then you got the best results .
D: But if you had , say , a heavily - reverberation ca heavy - reverberation case and a no - reverberation case , uh , and then you fed the thing , uh something that was a modest amount of reverberation then you 'd get some result in between the two .
D: So it was sort of behaved reasonably .
D: Is tha that a fair D: Yeah .
A: Yeah .
A: So you you think it 's perhaps better to have several M L
A: Yeah
A: but D: It works better if what ?
A: Yea
D: I see .
D: Well , see , i oc
D: You were doing some something that was D: So maybe the analogy isn't quite right .
D: You were doing something that was in way a little better behaved .
D: You had reverb for a single variable
D: which was re uh , uh , reverberation .
D: Here the problem seems to be is that we don't have a hug a really huge net with a really huge amount of training data .
D: But we have s f for this kind of task , I would think , sort of a modest amount .
D: I mean , a million frames actually isn't that much .
D: We have a modest amount of of uh training data from a couple different conditions ,
D: and then uh in yeah , that and the real situation is that there 's enormous variability that we anticipate in the test set in terms of language ,
D: and noise type
D: uh , and uh , uh , channel characteristic ,
D: sort of all over the map .
D: A bunch of different dimensions .
D: And so , I 'm just concerned that we don't really have um , the data to train up D: I mean one of the things that we were seeing is that when we added in we still don't have a good explanation for this ,
D: but we are seeing that we 're adding in uh , a fe few different databases
D: and uh the performance is getting worse
D: and uh , when we just take one of those databases that 's a pretty good one , it actually is is is is is better .
D: And uh that says to me , yes , that , you know , there might be some problems with the pronunciation models that some of the databases we 're adding in or something like that .
D: But one way or another we don't have uh , seemingly , the ability to represent , in the neural net of the size that we have , um , all of the variability that we 're gonna be covering .
D: So that I 'm I 'm I 'm hoping that
D: um , this is another take on the efficiency argument you 're making ,
D: which is I 'm hoping that with moderate size neural nets , uh , that uh if we if they look at more constrained conditions they they 'll have enough parameters to really represent them .
D: Mm - hmm .
D: Mm - hmm .
D: Mm - hmm .
D: Yeah .
A: So doing both is is not is not right , you mean ,
A: or ?
A: Yeah .
D: Yeah .
D: I I just sort of have a feeling A: But Yeah .
A: Mm - hmm .
D: Yeah .
D: I mean  i i e The um I think it 's true that the OGI folk found that using LDA RASTA ,
D: which is a kind of LogRASTA ,
D: it 's just that they have the D: I mean it 's done in the log domain , as I recall ,
D: and it 's it uh it 's just that they d it 's trained up ,
D: right ?
D: That that um benefitted from on - line normalization .
D: So they did At least in their case , it did seem to be somewhat complimentary .
D: So will it be in our case , where we 're using the neural net ?
D: I mean they they were not not using the neural net .
D: Uh I don't know .
D: OK , so the other things you have here are uh , trying to improve results from a single D: Yeah .
D: Make stuff better .
D: OK .
D: Uh . Yeah .
D: And CPU memory issues .
D: Yeah .
D: We 've been sort of ignoring that ,
D: haven't we ?
D: But A: Yeah , so I don't know .
D: Yeah , but I li
A: But we have to address the problem of CPU and memory we D: Well , I think My impression D: You you folks have been looking at this more than me .
D: But my impression was that uh , there was a a a a strict constraint on the delay ,
B: Yeah .
D: but beyond that it was kind of that uh using less memory was better ,
D: and using less CPU was better .
D: Something like that ,
D: right ?
A: Yeah , but A: Yeah .
A: So , yeah , but we 've A: I don't know .
A: We have to get some reference point to where we A: Well , what 's a reasonable number ?
A: Perhaps be because if it 's if it 's too large or large
A: or @ @ D: Um , well I don't think we 're um completely off the wall .
D: I mean I think that if we if we have D: Uh , I mean the ultimate fall back that we could do D: If we find
D: uh D: I mean we may find that we we 're not really gonna worry about the M L
D: You know , if the MLP ultimately , after all is said and done , doesn't really help then we won't have it in .
A: Mmm .
D: If the MLP does , we find , help us enough in some conditions , uh , we might even have more than one MLP .
D: We could simply say that is uh , done on the uh , server .
A: Mmm .
D: And it 's
D: uh D: We do the other manipulations that we 're doing before that .
D: So , I I I think I think that 's  that 's OK .
A: And Yeah .
D: So I think the key thing was um , this plug into OGI .
D: Um ,
D: what what are they What are they gonna be working D: Do we know what they 're gonna be working on while we take their features ,
A: They 're They 're starting to wor work on some kind of multi - band .
D: and ?
A: So . Um A: This that was Pratibha .
A: Sunil ,
A: what was he doing ,
A: do you remember ?
B: Sunil ?
A: Yeah .
A: He was doing something new
A: or ?
B: I I don't re I didn't remember .
B: Maybe he 's working with neural network .
A: I don't think so .
A: Trying to tune
A: wha networks ?
B: Yeah , I think so .
A: I think they were also mainly ,
A: well , working a little bit of new things , like networks and multi - band ,
A: but mainly trying to tune their their system as it is now
A: to just trying to get the best from this this architecture .
B: Yeah .
D: OK .
D: So I guess the way it would work is that you 'd get D: There 'd be some point where you say , " OK , this is their version - one " or whatever ,
D: and we get these VAD labels and features and so forth for all these test sets from them ,
A: Mm - hmm .
D: and then um , uh , that 's what we work with .
D: We have a certain level we try to improve it with this other path
D: and then um , uh , when it gets to be uh , January
D: some point
D: uh , we say , " OK we we have shown that we can improve this , in this way .
D: So now uh um what 's your newest version ? "
D: And then maybe they 'll have something that 's better
D: and then we we 'd combine it .
D: This is always hard .
D: I mean I I I used to work with uh folks who were trying to improve a good uh , HMM system with uh with a neural net system
D: and uh , it was a common problem that you 'd D: Oh , and this Actually , this is true not just for neural nets
D: but just for in general if people were working with uh , rescoring uh , N - best lists or lattices that come came from uh , a mainstream recognizer .
D: Uh , You get something from the the other site at one point and you work really hard on making it better with rescoring .
D: But they 're working really hard , too .
D: So by the time you have uh , improved their score , they have also improved their score
A: Mmm .
D: and now there isn't any difference ,
A: Yeah .
D: because the other B: Yeah .
D: So , um , I guess at some point we 'll have to
A: So it 's D: uh <comment> Uh ,
D: I I don't know .
D: I think we 're we 're integrated a little more tightly than happens in a lot of those cases .
D: I think at the moment they they say that they have a better thing we can we e e
D: What takes all the time here is that th we 're trying so many things ,
A: Mmm .
D: presumably uh , in a in a day we could turn around
D: uh , taking a new set of things from them and and rescoring it ,
A: Mmm .
A: Yeah . Yeah , perhaps we could .
D: right ?
D: So .
D: Yeah .
D: Well , OK .
D: No , this is I think this is good .
D: I think that the most wide open thing is the issues about the uh , you know , different trainings .
D: You know , da training targets and noises and so forth .
A: Mmm .
D: That 's sort of wide open .
A: So we we can for we c we can forget combining multiple features and MLG perhaps ,
A: or focus more on the targets and on the training data
A: and ?
D: Yeah , I think for right now um , I th I I really liked MSG .
D: And I think that , you know , one of the things I liked about it is has such different temporal properties .
D: And um , I think that there is ultimately a really good uh , potential for , you know , bringing in things with different temporal properties .
D: Um , but um , uh ,
D: we only have limited time
D: and there 's a lot of other things we have to look at .
A: Mmm .
D: And it seems like much more core questions are issues about the training set
D: and the training targets ,
D: and fitting in uh what we 're doing with what they 're doing ,
D: and , you know , with limited time .
D: Yeah .
D: I think we have to start cutting down .
D: So uh A: Mmm .
D: I think so ,
D: yeah .
D: And then , you know , once we D: Um , having gone through this process and trying many different things , I would imagine that certain things uh , come up that you are curious about
D: uh , that you 'd not getting to
D: and so when the dust settles from the evaluation uh , I think that would time to go back and take whatever intrigued you most ,
D: you know , got you most interested
D: uh and uh and and work with it , you know , for the next round .
D: Uh , as you can tell from these numbers uh , nothing that any of us is gonna do is actually gonna completely solve the problem .
D: So .
A: Mmm .
D: So , <comment> there 'll still be plenty to do .
D: Barry , you 've been pretty quiet .
C: Just listening .
D: Well I figured that ,
D: but  That what what what were you involved in in this primarily ?
C: Um , helping out uh , preparing C: Well , they 've been kind of running all the experiments and stuff
C: and I 've been uh , uh w doing some work on the on the preparing all all the data for them to to um , train and to test on .
C: Um
C: Yeah . Right now , I 'm I 'm focusing mainly on this final project I 'm working on in Jordan 's class .
D: Ah !
D: I see .
C: Yeah .
D: Right .
D: What 's what 's that ?
C: Um , I 'm trying to
C: um So there was a paper in ICSLP about um this this multi - band um , belief - net structure . <comment> This guy did D: Mm - hmm .
C: uh basically it was two H M Ms with with a with a dependency arrow between the two H M
D: Uh - huh .
C: And so I wanna try try coupling them instead of t having an arrow that that flows from one sub - band to another sub - band .
C: I wanna try having the arrows go both ways .
C: And um , I 'm just gonna see if if that that better models um , uh asynchrony in any way
C: or um  Yeah .
D: Oh !
D: OK .
D: Well , that sounds interesting .
C: Yeah .
D: OK .
D: Alright .
D: Anything to  you wanted to D: No .
D: OK .
D: Silent partner in the  in the meeting .
D: Oh , we got a laugh out of him ,
D: that 's good .
D: OK , everyone h must contribute to the our our sound  sound files here .
D: OK , so speaking of which , if we don't have anything else that we need D: You happy with where we are ?
D: Know know wher know where we 're going ?
A: Mmm .
D: Uh A: I think so , yeah .
D: Yeah , yeah .
D: You you happy ?
D: You 're happy .
D: OK everyone should be happy .
D: OK .
D: You don't have to be happy .
D: You 're almost done .
D: Yeah , yeah .
D: OK .
E: Al - actually I should mention E: So if <comment> um , about the Linux machine
E: " Swede . "
D: Yeah .
E: So it looks like the um , neural net tools are installed there .
A: Mmm .
E: And um Dan Ellis <comment> I believe knows something about using that machine
E: so
E: If people are interested in in getting jobs running on that maybe I could help with that .
A: Mmm .
A: Yeah , but I don't know if we really need now a lot of machines .
A: Well . we could start computing another huge table
A: but A: yeah , we D: Well . Yeah , I think we want a different table , at least
A: Yeah , sure .
D: Right ?
D: I mean there 's there 's some different things that we 're trying to get at now .
A: But D: But A: Yeah .
A: Mmm .
D: So . Yeah , as far as you can tell , you 're actually OK on C - on CPU uh , for training and so on ?
D: Yeah .
A: Ah yeah . I think so .
A: Well , more is always better ,
A: but mmm ,
A: I don't think we have to train a lot of networks , now that we know A: We just select what works fine
D: OK .
D: OK .
B: Yeah .
A: and try to improve this
D: And we 're OK on And we 're OK on disk ?
B: to work
A: and A: It 's OK , yeah .
A: Well sometimes we have some problems .
B: Some problems with the D: But they 're correctable , uh problems .
B: You know .
A: Yeah , restarting the script basically
A: and D: Yes .
D: Yeah , I 'm familiar with that one ,
D: OK .
D: Alright ,
D: so uh , <comment> since uh , we didn't ha get a channel on for you , <comment> you don't have to read any digits
D: but the rest of us will .
D: Uh , is it on ?
D: Well . We didn't
D: uh D: I think I won't touch anything
D: cuz I 'm afraid of making the driver crash
D: which it seems to do , pretty easily .
D: OK , thanks .
D: OK , so we 'll uh I 'll start off the
D: uh um
D: connect the A: My battery is low .
D: Well , let 's hope it works .
D: Maybe you should go first and see
D: so that you 're OK .
B: batteries ?
C: Yeah , your battery 's going down too .
D: Transcript uh
C: Carmen 's battery is d going down too .
D: two D: Oh , OK .
D: Yeah .
D: Why don't you go next then .
D: OK .
D: Guess we 're done .
D: OK , uh so .
D: Just finished digits .
D: Yeah , so . Uh
D: Well , it 's good .
D: I think I guess we can turn off our microphones now .
C: Just pull the batteries out .