From 575b31e33174d37f9b810d993517e85421deb7fd Mon Sep 17 00:00:00 2001 From: kghamilton89 <29099829+kghamilton89@users.noreply.github.com> Date: Wed, 13 Mar 2024 21:20:17 +0200 Subject: [PATCH 1/2] update get_order_list if statement --- src/diffusers/schedulers/scheduling_dpmsolver_singlestep.py | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/src/diffusers/schedulers/scheduling_dpmsolver_singlestep.py b/src/diffusers/schedulers/scheduling_dpmsolver_singlestep.py index 543f81e4c3fa..9e5e93b0866b 100644 --- a/src/diffusers/schedulers/scheduling_dpmsolver_singlestep.py +++ b/src/diffusers/schedulers/scheduling_dpmsolver_singlestep.py @@ -223,6 +223,8 @@ def get_order_list(self, num_inference_steps: int) -> List[int]: """ steps = num_inference_steps order = self.config.solver_order + if order > 3: + raise ValueError("Order > 3 is not supported by this scheduler") if self.config.lower_order_final: if order == 3: if steps % 3 == 0: @@ -239,7 +241,7 @@ def get_order_list(self, num_inference_steps: int) -> List[int]: elif order == 1: orders = [1] * steps else: - if order == 3: + if order >= 3: orders = [1, 2, 3] * (steps // 3) elif order == 2: orders = [1, 2] * (steps // 2) From 96b479fe673161c0366ce04502312fcdbf6df911 Mon Sep 17 00:00:00 2001 From: Kenneth Gerald Hamilton <29099829+kghamilton89@users.noreply.github.com> Date: Thu, 14 Mar 2024 07:03:26 +0300 Subject: [PATCH 2/2] revery --- src/diffusers/schedulers/scheduling_dpmsolver_singlestep.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/diffusers/schedulers/scheduling_dpmsolver_singlestep.py b/src/diffusers/schedulers/scheduling_dpmsolver_singlestep.py index 9e5e93b0866b..7bb201de4896 100644 --- a/src/diffusers/schedulers/scheduling_dpmsolver_singlestep.py +++ b/src/diffusers/schedulers/scheduling_dpmsolver_singlestep.py @@ -241,7 +241,7 @@ def get_order_list(self, num_inference_steps: int) -> List[int]: elif order == 1: orders = [1] * steps else: - if order >= 3: + if order == 3: orders = [1, 2, 3] * (steps // 3) elif order == 2: orders = [1, 2] * (steps // 2)