Giter VIP home page Giter VIP logo

Comments (4)

jzwar avatar jzwar commented on August 26, 2024

I implemented a crude version of the Levenberg-Marquardt-method, based on this. It significantly reduces the number of failures to:
[11 21 61 62 81 82 88] with the same example. It also uses a secondary metric from ILSB's numerics course (here as supposed to here), which seems to perform better.

There are two versions with a boolean flag here, where either the lambda * diag(J^TJ) is added or lambda * I, as shown in the wiki article. I did not observe any meaningful difference.

If only LM is used the failures are these:
[ 1 11 19 20 21 29 31 61 62 80 81 82 88 91]

@j042 : Is this worth further investigation?

from splinepy.

jzwar avatar jzwar commented on August 26, 2024

I implemented a crude version of the Levenberg-Marquardt-method, based on this. It significantly reduces the number of failures to: [11 21 61 62 81 82 88] with the same example. It also uses a secondary metric from ILSB's numerics course (here as supposed to here), which seems to perform better.

There are two versions with a boolean flag here, where either the lambda * diag(J^TJ) is added or lambda * I, as shown in the wiki article. I did not observe any meaningful difference.

If only LM is used the failures are these: [ 1 11 19 20 21 29 31 61 62 80 81 82 88 91]

@j042 : Is this worth further investigation?

Side-note. If we do not change the penalisation damping parameter, even if the coefficient rho is out of bounds, but only when the solution gets worse, it converges for all points. This is the latest version in the branch

from splinepy.

j042 avatar j042 commented on August 26, 2024

I implemented a crude version of the Levenberg-Marquardt-method, based on this. It significantly reduces the number of failures to: [11 21 61 62 81 82 88] with the same example. It also uses a secondary metric from ILSB's numerics course (here as supposed to here), which seems to perform better.
There are two versions with a boolean flag here, where either the lambda * diag(J^TJ) is added or lambda * I, as shown in the wiki article. I did not observe any meaningful difference.
If only LM is used the failures are these: [ 1 11 19 20 21 29 31 61 62 80 81 82 88 91]
@j042 : Is this worth further investigation?

Side-note. If we do not change the penalisation damping parameter, even if the coefficient rho is out of bounds, but only when the solution gets worse, it converges for all points. This is the latest version in the branch

Thanks a lot for implementing this, sounds great to me!

from splinepy.

j042 avatar j042 commented on August 26, 2024

I had a weird case where max_iterations value was set to 0 at ~60 query within a call. This happened at PySpline::Proximities. I wonder if that was compiler error or something that happens due to our implementation.

from splinepy.

Related Issues (20)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.