Submitted by WallabyDue2778 t3_y92tln in MachineLearning
Red-Portal t1_it5v31k wrote
Reply to comment by UncleVesem1r in [D] DDPM vs Score Matching by WallabyDue2778
>there's no guarantee that it leads to accurate score function? But aren't the score matching algorithms (denoising, projection) supposed to be able to solve the objective function involving grad_x log p(x)?
Oh no it's not. All it's doing is to minimize the mean-squares error against the score function. Minimizing this objective does not mean sampling using this score function will be a good idea; which it isn't. This is exactly why score modelling has to rely on adding noise. And by doing this, they converged to DDPM.
UncleVesem1r t1_it5wdui wrote
Very cool! I think the pitfalls mentioned in the SM paper also make more sense now.
Thank you kind sir/madam
Viewing a single comment thread. View all comments