MCPcopy Create free account
hub / github.com/Meshcapade/difflocks / propose_step

Method propose_step

k_diffusion/sampling.py:318–330  ·  view source on GitHub ↗
(self, error)

Source from the content-addressed store, hash-verified

316 return 1 + math.atan(x - 1)
317
318 def propose_step(self, error):
319 inv_error = 1 / (float(error) + self.eps)
320 if not self.errs:
321 self.errs = [inv_error, inv_error, inv_error]
322 self.errs[0] = inv_error
323 factor = self.errs[0] ** self.b1 * self.errs[1] ** self.b2 * self.errs[2] ** self.b3
324 factor = self.limiter(factor)
325 accept = factor >= self.accept_safety
326 if accept:
327 self.errs[2] = self.errs[1]
328 self.errs[1] = self.errs[0]
329 self.h *= factor
330 return accept
331
332
333class DPMSolver(nn.Module):

Callers 1

dpm_solver_adaptiveMethod · 0.95

Calls 1

limiterMethod · 0.95

Tested by

no test coverage detected