Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Sign in / Register
Toggle navigation
S
Stable Diffusion Webui
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Locked Files
Issues
0
Issues
0
List
Boards
Labels
Service Desk
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Security & Compliance
Security & Compliance
Dependency List
License Compliance
Packages
Packages
List
Container Registry
Analytics
Analytics
CI / CD
Code Review
Insights
Issues
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
novelai-storage
Stable Diffusion Webui
Commits
fe5d9889
Commit
fe5d9889
authored
May 11, 2023
by
AUTOMATIC1111
Committed by
GitHub
May 11, 2023
Browse files
Options
Browse Files
Download
Plain Diff
Merge pull request #10268 from Sakura-Luna/pbar
UniPC progress bar adjustment
parents
b7e160a8
ae17e978
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
37 additions
and
33 deletions
+37
-33
modules/models/diffusion/uni_pc/uni_pc.py
modules/models/diffusion/uni_pc/uni_pc.py
+37
-33
No files found.
modules/models/diffusion/uni_pc/uni_pc.py
View file @
fe5d9889
import
torch
import
math
from
tqdm.auto
import
trange
import
tqdm
class
NoiseScheduleVP
:
...
...
@@ -759,40 +759,44 @@ class UniPC:
vec_t
=
timesteps
[
0
]
.
expand
((
x
.
shape
[
0
]))
model_prev_list
=
[
self
.
model_fn
(
x
,
vec_t
)]
t_prev_list
=
[
vec_t
]
# Init the first `order` values by lower order multistep DPM-Solver.
for
init_order
in
range
(
1
,
order
):
vec_t
=
timesteps
[
init_order
]
.
expand
(
x
.
shape
[
0
])
x
,
model_x
=
self
.
multistep_uni_pc_update
(
x
,
model_prev_list
,
t_prev_list
,
vec_t
,
init_order
,
use_corrector
=
True
)
if
model_x
is
None
:
model_x
=
self
.
model_fn
(
x
,
vec_t
)
if
self
.
after_update
is
not
None
:
self
.
after_update
(
x
,
model_x
)
model_prev_list
.
append
(
model_x
)
t_prev_list
.
append
(
vec_t
)
for
step
in
trange
(
order
,
steps
+
1
):
vec_t
=
timesteps
[
step
]
.
expand
(
x
.
shape
[
0
])
if
lower_order_final
:
step_order
=
min
(
order
,
steps
+
1
-
step
)
else
:
step_order
=
order
#print('this step order:', step_order)
if
step
==
steps
:
#print('do not run corrector at the last step')
use_corrector
=
False
else
:
use_corrector
=
True
x
,
model_x
=
self
.
multistep_uni_pc_update
(
x
,
model_prev_list
,
t_prev_list
,
vec_t
,
step_order
,
use_corrector
=
use_corrector
)
if
self
.
after_update
is
not
None
:
self
.
after_update
(
x
,
model_x
)
for
i
in
range
(
order
-
1
):
t_prev_list
[
i
]
=
t_prev_list
[
i
+
1
]
model_prev_list
[
i
]
=
model_prev_list
[
i
+
1
]
t_prev_list
[
-
1
]
=
vec_t
# We do not need to evaluate the final model value.
if
step
<
steps
:
with
tqdm
.
tqdm
(
total
=
steps
)
as
pbar
:
# Init the first `order` values by lower order multistep DPM-Solver.
for
init_order
in
range
(
1
,
order
):
vec_t
=
timesteps
[
init_order
]
.
expand
(
x
.
shape
[
0
])
x
,
model_x
=
self
.
multistep_uni_pc_update
(
x
,
model_prev_list
,
t_prev_list
,
vec_t
,
init_order
,
use_corrector
=
True
)
if
model_x
is
None
:
model_x
=
self
.
model_fn
(
x
,
vec_t
)
model_prev_list
[
-
1
]
=
model_x
if
self
.
after_update
is
not
None
:
self
.
after_update
(
x
,
model_x
)
model_prev_list
.
append
(
model_x
)
t_prev_list
.
append
(
vec_t
)
pbar
.
update
()
for
step
in
range
(
order
,
steps
+
1
):
vec_t
=
timesteps
[
step
]
.
expand
(
x
.
shape
[
0
])
if
lower_order_final
:
step_order
=
min
(
order
,
steps
+
1
-
step
)
else
:
step_order
=
order
#print('this step order:', step_order)
if
step
==
steps
:
#print('do not run corrector at the last step')
use_corrector
=
False
else
:
use_corrector
=
True
x
,
model_x
=
self
.
multistep_uni_pc_update
(
x
,
model_prev_list
,
t_prev_list
,
vec_t
,
step_order
,
use_corrector
=
use_corrector
)
if
self
.
after_update
is
not
None
:
self
.
after_update
(
x
,
model_x
)
for
i
in
range
(
order
-
1
):
t_prev_list
[
i
]
=
t_prev_list
[
i
+
1
]
model_prev_list
[
i
]
=
model_prev_list
[
i
+
1
]
t_prev_list
[
-
1
]
=
vec_t
# We do not need to evaluate the final model value.
if
step
<
steps
:
if
model_x
is
None
:
model_x
=
self
.
model_fn
(
x
,
vec_t
)
model_prev_list
[
-
1
]
=
model_x
pbar
.
update
()
else
:
raise
NotImplementedError
()
if
denoise_to_zero
:
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment