Extremely clear explanation, step by step, you dont presume we know too much about the algorithm aside from basic equations (and lets be honest if you can’t do that, you shouldn’t be here 😅). Thank you so much for sharing your wisdom 🙏
Thanks, Badri for the clear and concise explanation. Your video was super helpful and much easier to understand than the books I have read. The water toy HELPED! Great artifact to use to make things simple.
In the else if statement, there is a negative sign missing, it should be e ^ (-dE / T). This term represents the probability of accepting the new state, so it makes sense that e ^ (-dE / T) approaches 0 as dE increases and T decreases.
I'm also confused on this aspect. What would be the maximum temperature for your ring game. would it be 373 Kelvin since that's the temperature you would need to boil the water ?
Thanks for the information badri! One thing that I didn't understand is the repetition of the program , does it stop after the repetition of the epoch is 0 , or when the temperature reaches the minimum?
is the actual number e used to calculate the probability of picking a "bad" state? In other sources like Wikipedia I've seen that e refers to the energy of the state E(s), not to the number e. And to make the choice a probability function is used, based on delta E and T. Could anybody clarify this? Also I've no idea what probability function that is, can someone shed some light?
Hi, thank you for the video. I would like to know how you calculate state energy? I mean with which way you calculate each epoch energy for E(n) (Also E(c) for the initial state). How the temperature change at each iteration? I mean T(max) is as you said 3000 in the initial state. How I can calculate the second state temperature. Thank you for reading.
Agil Yolchuyev calculating energy E totally depends on your problem. For eg, when calculating shortest paths, sum of the distances could be your energy.
Thanks, helped me a lot :)
1:07 Our boi hooked 5 rings on his first try , what a mad lad.
Bwahahahahahaha
I know, right. I'm not even interested in SA anymore. I want to see this pro beat the bubble toy again. I can't believe what happened.
I like how he seemed to momentarily compute if he should comment on it, but then went on with the main subject... move not accepted
After reading paper after paper, I clapped on this video...amazing! Thank you
I clap your mom
Thank you for providing an analogy to the toy. I am not a mathematician but you have explained it simply and creatively. Well done!
The toy analogy is brillant. It really gives meaning to the algorithm.
Thanks a lot for this video !
This is literally the best video I have seen so far to explain the simulated annealing algorithm!!
Using the toy as a way of explaining the topic was brilliant! So well explained, congrats!
Badri. I love how you think through every thought in the explanation.
I am doing a udemy course and the guy is not given many examples. You tying it to the water bubble game made it easy to understand. Thank you.
Thanks for the toy ring analogy, this is the first video where I actually understood the crux and beauty of the algorithm :)
Extremely clear explanation, step by step, you dont presume we know too much about the algorithm aside from basic equations (and lets be honest if you can’t do that, you shouldn’t be here 😅).
Thank you so much for sharing your wisdom 🙏
Best explanation on Simulated Annealing
Once again, another good example of a TH-cam video being better than my actual school.
Thanks, Badri for the clear and concise explanation. Your video was super helpful and much easier to understand than the books I have read. The water toy HELPED! Great artifact to use to make things simple.
Thank you prof! this is my go to video for refreshing simulated annealing
Thank you fot analyzing the algorithm, I finally understand how this idea works.
Thank you for putting subtitles. It helps me watch at 2x speed.
The analogy is amazing! Thanks for the explanation
Thank you for the creative way of explaining that.
Wow, very well done, thanks so much Mr Adhikari for the good explanation and great example!
Example was the best to visualize this example. Thank you..
Thank you for the clear explanation, you are a great teacher !!
The ring game was a very helpful parallel, thank you!
In the else if statement, there is a negative sign missing, it should be e ^ (-dE / T). This term represents the probability of accepting the new state, so it makes sense that e ^ (-dE / T) approaches 0 as dE increases and T decreases.
thanks dai, ekdam useful thiyo yo video, voli exam chha, this was great way to review this particular algo
very well explanation..thank you 🙂🙃
where did the probability role came from?
Thank you very much sir, for your efforts. Kindly make more such videos
Great explanation! Thanks Prof. Adhikari!
Thanks! I had a game as the one in the example... I remember good childhood times!
Very well explained. Thank You!!
Great Explanation sir.
Good ,to the point,precise explanation
Thanks for the clear explanation!!!
Very nice explanation. Thank you!
Very nice explanation.Thanks
its a good video but i didn't understand something in this annealing algo we started from T max to T min, how did u say its a maximization problem ?
I'm also confused on this aspect. What would be the maximum temperature for your ring game. would it be 373 Kelvin since that's the temperature you would need to boil the water ?
Very nice explanation. Many thanks
Really well explained! The toy example was brilliant. And hill climbing was a bonus :)
Jazakallahu khoiron jazaa'. Thank you so much.
Very well explained sir. Thank you.
The only one who really could explain!
Nice explanation thank you sir
Thank you so much, very well explained.
Great explanation and analogy, Thank you very much
Thanks, Finally I can understand what it is about!
Thank you so much for this clear explanation!
Thanks for the information badri!
One thing that I didn't understand is the repetition of the program , does it stop after the repetition of the epoch is 0 , or when the temperature reaches the minimum?
Temp reaches minimum, because if you stop when ΔE = 0 then that will give you a local maxima and not a global maxima
Thank you - very clear explanation.
Thanks
Very useful explanation
Really good one! I was stuck on unclear explanations!
Great explanation!! Thank you!!
Best explanation out there, thank you so much :)
Very good explanation
very clear explanation, thank you
is the actual number e used to calculate the probability of picking a "bad" state? In other sources like Wikipedia I've seen that e refers to the energy of the state E(s), not to the number e. And to make the choice a probability function is used, based on delta E and T. Could anybody clarify this? Also I've no idea what probability function that is, can someone shed some light?
Thanks! When are generic algorithms a better option?
Nice video..easy to understand...
Really good explanation
thank you for explaining this SA algorithm. much appreciated.
Amazing explanation
Beautifully explained. Didn't like the toy thing that much but the 2nd half of you explaining the alg was just perfection. Thank you so much.
Nice way of explaining, thanks a bunch!
Thank you! Clear and concise!
Thank you! It’s really clear and helpful. Is there any example that shows how we use the algorithm to solve real problem?
Thank you sir, very helpful and interesting!
You explain very clear. Thank you!
Thank you for explaining it so clear and efficient.
Very wonderfully explained :)
fantastic lecture even kids will understand simulated annealing kudos to you...I would like to talk to you
Wow that was a great way of explaining the algo. Do u have a video on genetic algo alos?
10:20 Should be "Local Maxima".
Thanks for the content :)
Thank you, very good explanation
Nice content!!👍
i feel confused, which is correct? Delta E >0 or Delta E
Tempering and annealing both are same?
Vivid explanation, thanks!
Excellently explained!
Thank you for the explanation. Helped a lot!!
Very clear explanation, thanks!
Thank you
You are very good
can you tell what is a software can I use it to solve problems using simulated annealing and the tutorial of it
Nice a very good explanation
Thanks!! Helped me a lot.
Thank you sir! Very good explanation!
Thanks Prof, Crystal Clear explanation :)
10:20 I think you mean 'Local Maxima' ?
That explanation was awesome. Thank you so much!!!!
Very good, clean, simple explanation. Probably best I've seen.
explained very well dai
sarthak mishra waow.
Sir, how to determine the maximum temperature?
how defines the 'next' function ?
Hi, thank you for the video. I would like to know how you calculate state energy? I mean with which way you calculate each epoch energy for E(n) (Also E(c) for the initial state). How the temperature change at each iteration? I mean T(max) is as you said 3000 in the initial state. How I can calculate the second state temperature. Thank you for reading.
Agil Yolchuyev calculating energy E totally depends on your problem. For eg, when calculating shortest paths, sum of the distances could be your energy.
Agil Yolchuyev for temperature try linear decrease like T = T -1 first. Then try other monotonic decreasing functions.
Algorithm is well explained, thanks a lot!!
Genius explanation!
Good Explanation!
Thank you very much for your help kind sir ^_^ You helped me out a lot.
very good explanation
I think that it is very good explanation I have ever seen
What do you set the max temperature as?
Really thank you.
Great explanation.