Finding Global Minima in Likelihood Functions

Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
1 reply · 2K views
tworitdash
Messages
104
Reaction score
25
I have a likelihood function that has one global minima, but a lot of local ones too. I attach a figure with the likelihood function in 2D (it has two parameters). I have added a 3D view and a surface view of the likelihood function. I know there are many global optimizers that can be used to obtain the location of the global minimum point in the likelihood function. However, I want to know what basic optimizer principles that I can use (that I can also derive and implement myself) for a problem like this. If you see the 3D view, you may find many local minima. I am also open to suggestions that involve Bayesian type of optimization where I will get a posterior and not just a point estimate. I am open to that as well. I have tried MCMC type sampling optimization, however, they are computationally expensive. The number of parameters may increase later.
 

Attachments

  • cKJT2.png
    cKJT2.png
    19.1 KB · Views: 183
  • 5KeQE.png
    5KeQE.png
    29.2 KB · Views: 175
Physics news on Phys.org
Is it literally just this function you want to optimize?

You already did it, by drawing a graph. More formally if that's unsatisfying, for low dimensions and fast evaluation functions you can just evaluate the function at every point on a fine grid and pick the point with the best value. If you want a little extra precision you can run any optimizer from there to find the local extremum near that point.
 
Reply
  • Like
Likes   Reactions: WWGD and tworitdash