In this paper, we study a class of direct-search methods based on sufficient decrease for solving smooth linearly constrained problems where the polling directions are randomly generated (in approximate tangent cones). The random polling directions must satisfy probabilistic feasible descent, a concept ...
Other gradient-free methods such as the neighborhood method and the evolutionary methods typically provide a set of history matched models as the output, but in general there is not a clear probabilistic interpretation of the set of samples obtained. Moreover, the fact that one must, in general...
Probabilistic methods Ian H.Witten, ...Christopher J.Pal, inData Mining (Fourth Edition), 2017 Gradient Descent and Second-Order Methods By formulatingmaximum likelihoodlearning with a prior on parameters as the problem of minimizing the negative logprobability,gradient descentcan be used to optimize...
This paper describes model-based predictive control based on Gaussian processes. Gaussian process models provide a probabilistic non-parametric modelling a... Juš Kocijan,R Murraysmith - Eurocon Computer As A Tool the IEEE Region 被引量: 112发表: 2003年 A GRADIENT BASED ADAPTIVE CONTROL ALGORITH...
Table A4. MLP hyperparameter optimization search ranges (* = default parameter). Table A5. CNN architecture settings. Table A6. CNN hyperparameter optimization search range. Table A7. BNN architecture settings (building order). Table A8. Settings of the NN-based direct inverse MPI runs. ...
affecting both maximum parsimony and maximum likelihood methods [65], and producing incorrect trees with high bootstrap support [63]. The deleterious effect of heterotachy on phylogenetic reconstruction can be mitigated by the use of probabilistic models with sufficient parameters to correctly describe ...
Durbin R, Eddy SR, Krogh A, Mitchison G: Biological sequence analysis: probabilistic models of proteins and nucleic acids. 1998, Cambridge: Cambridge University Press Chapter Google Scholar Murzin AG, Brenner SE, Hubbard T, Chothia C: SCOP: A structural classification of proteins database for ...
affecting both maximum parsimony and maximum likelihood methods [65], and producing incorrect trees with high bootstrap support [63]. The deleterious effect of heterotachy on phylogenetic reconstruction can be mitigated by the use of probabilistic models with sufficient parameters to correctly describe ...
We used the Pfam database version 24.0 to assign protein domains to the vacuolar pyrophosphatase sequences [42]. On the Pfam website,http://pfam.sanger.ac.uk/family/PF03030#tabview=tab6, we performed a batch search for the sequences against both the Pfam-A HMMs using an E-value of ...
We focus on CFGs and its variants: probabilistic CFGs (PCFG), and lexicalized probabilistic CFGs (LPCFG). 2.5.1 CFGs and PCFGs A CFG G is 4-tuple: (∑,N,R,S), where ∑ is a set of terminal symbols; N is a set of nonterminal symbols; R is a set of rules of the form X...