Numerical optimisation of the log-likelihood function
i=1 In practice, the natural logarithm of the likelihood function, called the log-likelihood function and denoted by
... ! ) . The p × p matrix on the right hand side is called the expected Fisher information matrix and usually denoted by I(θ). The expectation here is taken over the distribution of y at a fixed value of θ. Under conditions ...
25
Efficient Computation of Log-likelihood Function in Clustering Overdispersed Count Data
... the log-likelihood function, when clustering count, multicategorial data with overdis- persion, modeled by three different distributions: multinomial Dirichlet, multinomial generalized Dirichlet, and ...
51
Improving predictive inference under covariate shift by weighting the log-likelihood function
... the log-likelihood ...weight function is asymptotically shown to be the ratio of the density function of the covariate in the population to that in the ...pseudo-maximum likelihood ...
18
HEURISTICS OPTIMISATION OF NUMERICAL FUNCTIONS
... The Free Search structure is similar to the general description of the evolutionary algorithms [4][8]. The FS architecture is simplified and consists of generalised events initialisation, exploration and termination. ...
7
Numerical Optimisation Problems in Finance
... tic function and modify it to avoid discontinuities caused by branch switching of complex ...the numerical gradient and is around ten times faster than a numerical ...objective function is ...
121
Geometric numerical integration for optimisation
... objective function and the ground ...sparse optimisation. Through numerical experiments, we observe that for sparse ground truths, the Bregman discrete gradient methods converge significantly faster ...
230
Maximum likelihood estimation of a log-concave density and its distribution function: Basic properties and uniform consistency
... Keywords: adaptivity; bracketing; exponential inequality; gap problem; hazard function; method of caricatures; shape constraints 1. Introduction Two common approaches to nonparametric density estimation are ...
31
Maximum Log Likelihood Estimation using EM Algorithm and Partition Maximum Log Likelihood Estimation for Mixtures of Generalized Lambda Distributions
... extensive numerical methods are required to perform standard calculations, such as finding the probability under the ...maximum likelihood estimations conducted numerically may become more ...
9
Maximum Likelihood with Coarse Data based on Robust Optimisation
... maximum likelihood methods when data are ...the likelihood function of the complete joint sample involving both the observed and the latent ...robust optimisation and graph-theoretic ...
13
Geometry of the Log-Likelihood Ratio Statistic in Misspecified Models
... for which g φ is constant for all η. The η coordinates are called g φ -affine. M is totally flat, if there exists a coordinate system η for which g φ is a constant for all η and μ φ is a linear function of η −φ. When ...
15
Adaptive intelligence applied to numerical optimisation
... population of points, not from a single point; (3) GAs use payoff (objective function) information, not derivates or other auxiliary knowledge; (4) GAs use probabilistic transition rules, not deterministic rules ...
9
Asymptotics of fingerprinting and group testing: capacityachieving log-likelihood decoders
... B. Cutting off the cut-offs Although Proposition 1 is already a nice result, the cut- offs δ have been a nagging inconvenience ever since Tardos introduced them in 2003 [40]. In previous settings it was well- known that ...
15
Maximum Likelihood Estimation of Discrete Log-Concave Distributions with Applications
... denotes any point of Z d with its ith element equal to k. Each function h i is defined on S i . Hence h z P d i 1 h i z i is separable-convex on S . Therefore h z is convex-extendible by Murota and ...
172
Maximum Likelihood Estimate in Discrete Hierarchical Log-Linear Models
... the log- likelihood function l(θ) is always strictly concave (assuming that the parametrization is ...the likelihood will send θ to infinity in the right ...a numerical algorithm ...
167
Diversifying search in bee algorithms for numerical optimisation
... ley function for dimensions of 100 and 150. Rosenbrock function is the second challenging benchmark among all, where the approximation of Hybrid remain just below 100 for 100-D and below 150 for 150-D ...
12
A honeybees-inspired heuristic algorithm for numerical optimisation
... population-based optimisation algorithm in which solutions are considered as individual bees and are evaluated based on the fitness function-like evaluation rules, which are usually of simple objective ...
15
Parameter redundancy and the existence of maximum likelihood estimates in log linear models
... Abstract: Log-linear models are typically fitted to contingency table data to de- scribe and identify the relationship between different categorical ...given log-linear model is parameter redundant for a ...
35
Asymptotics of fingerprinting and group testing: capacity-achieving log-likelihood decoders
... 3.2 Cutting off the cut-offs Although Proposition 1 is already a nice result, the cut-offs δ have been a nagging inconvenience ever since Tardos introduced them in 2003 [3]. In previous settings, it was well known that ...
15
Discriminative Learning of Bayesian Networks via Factorized Conditional Log-Likelihood
... To gauge the performance of the proposed criteria in classification tasks, we compare them with several popular classifiers, namely, tree augmented naive Bayes (TAN), greedy hill-climbing (GHC), C4.5, k-nearest neighbor ...
30
Numerical and experimental optimisation of a high performance heat exchanger
... (a) (b) Figure 3-3: (a) Polygon bisected by triangles (b) DVM meshing on computational domain [ 21 ] AFM use internal nodal formation and triangulation to generate mesh. As shown in Figure 3-4, simple domains with six ...
215