Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Conversation

@franknoe
Copy link
Contributor

for testing runtimes of hidden variable operations during development.

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

These returns only return the last result. Did you want to append all the replicates instead?

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

No, they are identical.

Am 13/12/15 um 17:42 schrieb John Chodera:

In bhmm/tests/benchmark_hidden.py
#26 (comment):

  •        C = hidden.transition_counts(self.alpha[i], self.beta[i], self.A[i], self.pobs[i], out=out)
    
  •    # compare
    
  •    time2 = time.time()
    
  •    d = (time2-time1)/(1.0*self.nrep)
    
  •    return (C, d)
    
  • def run_viterbi(self, i, out):
  •    vpath = None
    
  •    hidden.set_implementation(self.kernel)
    
  •    time1 = time.time()
    
  •    for k in range(self.nrep):
    
  •        vpath = hidden.viterbi(self.A[i], self.pobs[i], self.pi[i])
    
  •    # compare
    
  •    time2 = time.time()
    
  •    d = (time2-time1)/(1.0*self.nrep)
    
  •    return (vpath, d)
    

These returns only return the /last/ result. Did you want to append
all the replicates instead?


Reply to this email directly or view it on GitHub
https://github.com/bhmm/bhmm/pull/26/files#r47446997.


Prof. Dr. Frank Noe
Head of Computational Molecular Biology group
Freie Universitaet Berlin

Phone: (+49) (0)30 838 75354
Web: research.franknoe.de

Mail: Arnimallee 6, 14195 Berlin, Germany

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Ah, these are all deterministic computations!

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

yup

Am 13/12/15 um 17:46 schrieb John Chodera:

In bhmm/tests/benchmark_hidden.py
#26 (comment):

  •        C = hidden.transition_counts(self.alpha[i], self.beta[i], self.A[i], self.pobs[i], out=out)
    
  •    # compare
    
  •    time2 = time.time()
    
  •    d = (time2-time1)/(1.0*self.nrep)
    
  •    return (C, d)
    
  • def run_viterbi(self, i, out):
  •    vpath = None
    
  •    hidden.set_implementation(self.kernel)
    
  •    time1 = time.time()
    
  •    for k in range(self.nrep):
    
  •        vpath = hidden.viterbi(self.A[i], self.pobs[i], self.pi[i])
    
  •    # compare
    
  •    time2 = time.time()
    
  •    d = (time2-time1)/(1.0*self.nrep)
    
  •    return (vpath, d)
    

Ah, these are all deterministic computations!


Reply to this email directly or view it on GitHub
https://github.com/bhmm/bhmm/pull/26/files#r47447063.


Prof. Dr. Frank Noe
Head of Computational Molecular Biology group
Freie Universitaet Berlin

Phone: (+49) (0)30 838 75354
Web: research.franknoe.de

Mail: Arnimallee 6, 14195 Berlin, Germany

franknoe added a commit that referenced this pull request Dec 13, 2015
Added a benchmarking module
@franknoe franknoe merged commit 8fb7053 into master Dec 13, 2015
@franknoe franknoe deleted the benchmarking branch February 11, 2016 16:58
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants