A Finding Global Minima in Likelihood Functions

AI Thread Summary
The discussion focuses on optimizing a likelihood function with one global minimum and multiple local minima. The user seeks basic optimizer principles that can be derived and implemented independently, expressing interest in both traditional optimization methods and Bayesian approaches for obtaining posterior estimates. Suggestions include evaluating the function on a fine grid for low-dimensional cases to identify the best point, followed by using an optimizer to refine the search for local extrema. The user has also explored MCMC sampling but finds it computationally expensive, especially with potential increases in parameters. The conversation emphasizes the need for efficient optimization strategies in the context of complex likelihood functions.
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: 145
  • 5KeQE.png
    5KeQE.png
    29.2 KB · Views: 141
Mathematics 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.
 
  • Like
Likes WWGD and tworitdash
Suppose ,instead of the usual x,y coordinate system with an I basis vector along the x -axis and a corresponding j basis vector along the y-axis we instead have a different pair of basis vectors ,call them e and f along their respective axes. I have seen that this is an important subject in maths My question is what physical applications does such a model apply to? I am asking here because I have devoted quite a lot of time in the past to understanding convectors and the dual...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...

Similar threads

Back
Top