Update to version 1.7.0

#2
by bconsolvo - opened
This view is limited to 50 files because it contains too many changes.  See the raw diff here.
Files changed (50) hide show
  1. .cache/empty.txt +0 -0
  2. .gitattributes +4 -345
  3. LICENSE +82 -0
  4. README.md +51 -41
  5. SD1.5 NPU Model support for UL Procyon SD1.5_third_party_notices.txt +0 -220
  6. feature_extractor/preprocessor_config.json +20 -0
  7. libs/ryzenai_onnx_utils.dll +0 -0
  8. ryzen-ai-end-user-license-agreement-public.pdf +0 -3
  9. safety_checker/config.json +175 -0
  10. scheduler/scheduler_config.json +3 -9
  11. text_encoder/config.json +25 -0
  12. text_encoder/model.onnx +0 -3
  13. libs/onnx_custom_ops.dll → text_encoder/model.safetensors +2 -2
  14. tokenizer/special_tokens_map.json +1 -7
  15. tokenizer/tokenizer_config.json +25 -21
  16. unet/.cache/NhwcConv_0-conv_inConv_0.const +0 -0
  17. unet/.cache/NhwcConv_0-conv_inConv_1.const +0 -0
  18. unet/.cache/NhwcConv_0-conv_inConv_10.const +0 -3
  19. unet/.cache/NhwcConv_0-conv_inConv_100.const +0 -3
  20. unet/.cache/NhwcConv_0-conv_inConv_101.const +0 -3
  21. unet/.cache/NhwcConv_0-conv_inConv_102.const +0 -3
  22. unet/.cache/NhwcConv_0-conv_inConv_103.const +0 -3
  23. unet/.cache/NhwcConv_0-conv_inConv_104.const +0 -3
  24. unet/.cache/NhwcConv_0-conv_inConv_105.const +0 -3
  25. unet/.cache/NhwcConv_0-conv_inConv_106.const +0 -3
  26. unet/.cache/NhwcConv_0-conv_inConv_107.const +0 -3
  27. unet/.cache/NhwcConv_0-conv_inConv_108.const +0 -3
  28. unet/.cache/NhwcConv_0-conv_inConv_109.const +0 -3
  29. unet/.cache/NhwcConv_0-conv_inConv_11.const +0 -3
  30. unet/.cache/NhwcConv_0-conv_inConv_110.const +0 -3
  31. unet/.cache/NhwcConv_0-conv_inConv_111.const +0 -3
  32. unet/.cache/NhwcConv_0-conv_inConv_112.const +0 -3
  33. unet/.cache/NhwcConv_0-conv_inConv_113.const +0 -3
  34. unet/.cache/NhwcConv_0-conv_inConv_114.const +0 -0
  35. unet/.cache/NhwcConv_0-conv_inConv_115.const +0 -3
  36. unet/.cache/NhwcConv_0-conv_inConv_116.const +0 -0
  37. unet/.cache/NhwcConv_0-conv_inConv_117.const +0 -0
  38. unet/.cache/NhwcConv_0-conv_inConv_118.const +0 -3
  39. unet/.cache/NhwcConv_0-conv_inConv_119.const +0 -3
  40. unet/.cache/NhwcConv_0-conv_inConv_12.const +0 -3
  41. unet/.cache/NhwcConv_0-conv_inConv_120.const +0 -3
  42. unet/.cache/NhwcConv_0-conv_inConv_121.const +0 -3
  43. unet/.cache/NhwcConv_0-conv_inConv_122.const +0 -0
  44. unet/.cache/NhwcConv_0-conv_inConv_123.const +0 -0
  45. unet/.cache/NhwcConv_0-conv_inConv_124.const +0 -3
  46. unet/.cache/NhwcConv_0-conv_inConv_125.const +0 -0
  47. unet/.cache/NhwcConv_0-conv_inConv_126.const +0 -0
  48. unet/.cache/NhwcConv_0-conv_inConv_127.const +0 -3
  49. unet/.cache/NhwcConv_0-conv_inConv_128.const +0 -1
  50. unet/.cache/NhwcConv_0-conv_inConv_129.const +0 -0
.cache/empty.txt DELETED
File without changes
.gitattributes CHANGED
@@ -33,348 +33,7 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
33
  *.zip filter=lfs diff=lfs merge=lfs -text
34
  *.zst filter=lfs diff=lfs merge=lfs -text
35
  *tfevents* filter=lfs diff=lfs merge=lfs -text
36
- libs/fmt.dll filter=lfs diff=lfs merge=lfs -text
37
- libs/onnx_custom_ops.dll filter=lfs diff=lfs merge=lfs -text
38
- libs/ryzen_mm.dll filter=lfs diff=lfs merge=lfs -text
39
- libs/spdlog.dll filter=lfs diff=lfs merge=lfs -text
40
- unet/.cache/NhwcConv_0-conv_inConv_10.const filter=lfs diff=lfs merge=lfs -text
41
- unet/.cache/NhwcConv_0-conv_inConv_100.const filter=lfs diff=lfs merge=lfs -text
42
- unet/.cache/NhwcConv_0-conv_inConv_101.const filter=lfs diff=lfs merge=lfs -text
43
- unet/.cache/NhwcConv_0-conv_inConv_102.const filter=lfs diff=lfs merge=lfs -text
44
- unet/.cache/NhwcConv_0-conv_inConv_103.const filter=lfs diff=lfs merge=lfs -text
45
- unet/.cache/NhwcConv_0-conv_inConv_104.const filter=lfs diff=lfs merge=lfs -text
46
- unet/.cache/NhwcConv_0-conv_inConv_105.const filter=lfs diff=lfs merge=lfs -text
47
- unet/.cache/NhwcConv_0-conv_inConv_106.const filter=lfs diff=lfs merge=lfs -text
48
- unet/.cache/NhwcConv_0-conv_inConv_107.const filter=lfs diff=lfs merge=lfs -text
49
- unet/.cache/NhwcConv_0-conv_inConv_108.const filter=lfs diff=lfs merge=lfs -text
50
- unet/.cache/NhwcConv_0-conv_inConv_109.const filter=lfs diff=lfs merge=lfs -text
51
- unet/.cache/NhwcConv_0-conv_inConv_11.const filter=lfs diff=lfs merge=lfs -text
52
- unet/.cache/NhwcConv_0-conv_inConv_110.const filter=lfs diff=lfs merge=lfs -text
53
- unet/.cache/NhwcConv_0-conv_inConv_111.const filter=lfs diff=lfs merge=lfs -text
54
- unet/.cache/NhwcConv_0-conv_inConv_112.const filter=lfs diff=lfs merge=lfs -text
55
- unet/.cache/NhwcConv_0-conv_inConv_113.const filter=lfs diff=lfs merge=lfs -text
56
- unet/.cache/NhwcConv_0-conv_inConv_115.const filter=lfs diff=lfs merge=lfs -text
57
- unet/.cache/NhwcConv_0-conv_inConv_118.const filter=lfs diff=lfs merge=lfs -text
58
- unet/.cache/NhwcConv_0-conv_inConv_119.const filter=lfs diff=lfs merge=lfs -text
59
- unet/.cache/NhwcConv_0-conv_inConv_12.const filter=lfs diff=lfs merge=lfs -text
60
- unet/.cache/NhwcConv_0-conv_inConv_120.const filter=lfs diff=lfs merge=lfs -text
61
- unet/.cache/NhwcConv_0-conv_inConv_121.const filter=lfs diff=lfs merge=lfs -text
62
- unet/.cache/NhwcConv_0-conv_inConv_124.const filter=lfs diff=lfs merge=lfs -text
63
- unet/.cache/NhwcConv_0-conv_inConv_127.const filter=lfs diff=lfs merge=lfs -text
64
- unet/.cache/NhwcConv_0-conv_inConv_13.const filter=lfs diff=lfs merge=lfs -text
65
- unet/.cache/NhwcConv_0-conv_inConv_130.const filter=lfs diff=lfs merge=lfs -text
66
- unet/.cache/NhwcConv_0-conv_inConv_131.const filter=lfs diff=lfs merge=lfs -text
67
- unet/.cache/NhwcConv_0-conv_inConv_132.const filter=lfs diff=lfs merge=lfs -text
68
- unet/.cache/NhwcConv_0-conv_inConv_133.const filter=lfs diff=lfs merge=lfs -text
69
- unet/.cache/NhwcConv_0-conv_inConv_135.const filter=lfs diff=lfs merge=lfs -text
70
- unet/.cache/NhwcConv_0-conv_inConv_137.const filter=lfs diff=lfs merge=lfs -text
71
- unet/.cache/NhwcConv_0-conv_inConv_139.const filter=lfs diff=lfs merge=lfs -text
72
- unet/.cache/NhwcConv_0-conv_inConv_14.const filter=lfs diff=lfs merge=lfs -text
73
- unet/.cache/NhwcConv_0-conv_inConv_142.const filter=lfs diff=lfs merge=lfs -text
74
- unet/.cache/NhwcConv_0-conv_inConv_143.const filter=lfs diff=lfs merge=lfs -text
75
- unet/.cache/NhwcConv_0-conv_inConv_144.const filter=lfs diff=lfs merge=lfs -text
76
- unet/.cache/NhwcConv_0-conv_inConv_145.const filter=lfs diff=lfs merge=lfs -text
77
- unet/.cache/NhwcConv_0-conv_inConv_148.const filter=lfs diff=lfs merge=lfs -text
78
- unet/.cache/NhwcConv_0-conv_inConv_15.const filter=lfs diff=lfs merge=lfs -text
79
- unet/.cache/NhwcConv_0-conv_inConv_151.const filter=lfs diff=lfs merge=lfs -text
80
- unet/.cache/NhwcConv_0-conv_inConv_154.const filter=lfs diff=lfs merge=lfs -text
81
- unet/.cache/NhwcConv_0-conv_inConv_155.const filter=lfs diff=lfs merge=lfs -text
82
- unet/.cache/NhwcConv_0-conv_inConv_156.const filter=lfs diff=lfs merge=lfs -text
83
- unet/.cache/NhwcConv_0-conv_inConv_157.const filter=lfs diff=lfs merge=lfs -text
84
- unet/.cache/NhwcConv_0-conv_inConv_158.const filter=lfs diff=lfs merge=lfs -text
85
- unet/.cache/NhwcConv_0-conv_inConv_16.const filter=lfs diff=lfs merge=lfs -text
86
- unet/.cache/NhwcConv_0-conv_inConv_160.const filter=lfs diff=lfs merge=lfs -text
87
- unet/.cache/NhwcConv_0-conv_inConv_162.const filter=lfs diff=lfs merge=lfs -text
88
- unet/.cache/NhwcConv_0-conv_inConv_163.const filter=lfs diff=lfs merge=lfs -text
89
- unet/.cache/NhwcConv_0-conv_inConv_165.const filter=lfs diff=lfs merge=lfs -text
90
- unet/.cache/NhwcConv_0-conv_inConv_168.const filter=lfs diff=lfs merge=lfs -text
91
- unet/.cache/NhwcConv_0-conv_inConv_169.const filter=lfs diff=lfs merge=lfs -text
92
- unet/.cache/NhwcConv_0-conv_inConv_17.const filter=lfs diff=lfs merge=lfs -text
93
- unet/.cache/NhwcConv_0-conv_inConv_170.const filter=lfs diff=lfs merge=lfs -text
94
- unet/.cache/NhwcConv_0-conv_inConv_171.const filter=lfs diff=lfs merge=lfs -text
95
- unet/.cache/NhwcConv_0-conv_inConv_174.const filter=lfs diff=lfs merge=lfs -text
96
- unet/.cache/NhwcConv_0-conv_inConv_177.const filter=lfs diff=lfs merge=lfs -text
97
- unet/.cache/NhwcConv_0-conv_inConv_180.const filter=lfs diff=lfs merge=lfs -text
98
- unet/.cache/NhwcConv_0-conv_inConv_181.const filter=lfs diff=lfs merge=lfs -text
99
- unet/.cache/NhwcConv_0-conv_inConv_182.const filter=lfs diff=lfs merge=lfs -text
100
- unet/.cache/NhwcConv_0-conv_inConv_183.const filter=lfs diff=lfs merge=lfs -text
101
- unet/.cache/NhwcConv_0-conv_inConv_185.const filter=lfs diff=lfs merge=lfs -text
102
- unet/.cache/NhwcConv_0-conv_inConv_187.const filter=lfs diff=lfs merge=lfs -text
103
- unet/.cache/NhwcConv_0-conv_inConv_189.const filter=lfs diff=lfs merge=lfs -text
104
- unet/.cache/NhwcConv_0-conv_inConv_19.const filter=lfs diff=lfs merge=lfs -text
105
- unet/.cache/NhwcConv_0-conv_inConv_192.const filter=lfs diff=lfs merge=lfs -text
106
- unet/.cache/NhwcConv_0-conv_inConv_193.const filter=lfs diff=lfs merge=lfs -text
107
- unet/.cache/NhwcConv_0-conv_inConv_194.const filter=lfs diff=lfs merge=lfs -text
108
- unet/.cache/NhwcConv_0-conv_inConv_195.const filter=lfs diff=lfs merge=lfs -text
109
- unet/.cache/NhwcConv_0-conv_inConv_198.const filter=lfs diff=lfs merge=lfs -text
110
- unet/.cache/NhwcConv_0-conv_inConv_201.const filter=lfs diff=lfs merge=lfs -text
111
- unet/.cache/NhwcConv_0-conv_inConv_204.const filter=lfs diff=lfs merge=lfs -text
112
- unet/.cache/NhwcConv_0-conv_inConv_205.const filter=lfs diff=lfs merge=lfs -text
113
- unet/.cache/NhwcConv_0-conv_inConv_206.const filter=lfs diff=lfs merge=lfs -text
114
- unet/.cache/NhwcConv_0-conv_inConv_207.const filter=lfs diff=lfs merge=lfs -text
115
- unet/.cache/NhwcConv_0-conv_inConv_208.const filter=lfs diff=lfs merge=lfs -text
116
- unet/.cache/NhwcConv_0-conv_inConv_21.const filter=lfs diff=lfs merge=lfs -text
117
- unet/.cache/NhwcConv_0-conv_inConv_210.const filter=lfs diff=lfs merge=lfs -text
118
- unet/.cache/NhwcConv_0-conv_inConv_212.const filter=lfs diff=lfs merge=lfs -text
119
- unet/.cache/NhwcConv_0-conv_inConv_214.const filter=lfs diff=lfs merge=lfs -text
120
- unet/.cache/NhwcConv_0-conv_inConv_216.const filter=lfs diff=lfs merge=lfs -text
121
- unet/.cache/NhwcConv_0-conv_inConv_218.const filter=lfs diff=lfs merge=lfs -text
122
- unet/.cache/NhwcConv_0-conv_inConv_22.const filter=lfs diff=lfs merge=lfs -text
123
- unet/.cache/NhwcConv_0-conv_inConv_220.const filter=lfs diff=lfs merge=lfs -text
124
- unet/.cache/NhwcConv_0-conv_inConv_222.const filter=lfs diff=lfs merge=lfs -text
125
- unet/.cache/NhwcConv_0-conv_inConv_225.const filter=lfs diff=lfs merge=lfs -text
126
- unet/.cache/NhwcConv_0-conv_inConv_226.const filter=lfs diff=lfs merge=lfs -text
127
- unet/.cache/NhwcConv_0-conv_inConv_227.const filter=lfs diff=lfs merge=lfs -text
128
- unet/.cache/NhwcConv_0-conv_inConv_232.const filter=lfs diff=lfs merge=lfs -text
129
- unet/.cache/NhwcConv_0-conv_inConv_235.const filter=lfs diff=lfs merge=lfs -text
130
- unet/.cache/NhwcConv_0-conv_inConv_238.const filter=lfs diff=lfs merge=lfs -text
131
- unet/.cache/NhwcConv_0-conv_inConv_24.const filter=lfs diff=lfs merge=lfs -text
132
- unet/.cache/NhwcConv_0-conv_inConv_241.const filter=lfs diff=lfs merge=lfs -text
133
- unet/.cache/NhwcConv_0-conv_inConv_242.const filter=lfs diff=lfs merge=lfs -text
134
- unet/.cache/NhwcConv_0-conv_inConv_243.const filter=lfs diff=lfs merge=lfs -text
135
- unet/.cache/NhwcConv_0-conv_inConv_244.const filter=lfs diff=lfs merge=lfs -text
136
- unet/.cache/NhwcConv_0-conv_inConv_246.const filter=lfs diff=lfs merge=lfs -text
137
- unet/.cache/NhwcConv_0-conv_inConv_248.const filter=lfs diff=lfs merge=lfs -text
138
- unet/.cache/NhwcConv_0-conv_inConv_250.const filter=lfs diff=lfs merge=lfs -text
139
- unet/.cache/NhwcConv_0-conv_inConv_252.const filter=lfs diff=lfs merge=lfs -text
140
- unet/.cache/NhwcConv_0-conv_inConv_253.const filter=lfs diff=lfs merge=lfs -text
141
- unet/.cache/NhwcConv_0-conv_inConv_255.const filter=lfs diff=lfs merge=lfs -text
142
- unet/.cache/NhwcConv_0-conv_inConv_257.const filter=lfs diff=lfs merge=lfs -text
143
- unet/.cache/NhwcConv_0-conv_inConv_258.const filter=lfs diff=lfs merge=lfs -text
144
- unet/.cache/NhwcConv_0-conv_inConv_26.const filter=lfs diff=lfs merge=lfs -text
145
- unet/.cache/NhwcConv_0-conv_inConv_260.const filter=lfs diff=lfs merge=lfs -text
146
- unet/.cache/NhwcConv_0-conv_inConv_262.const filter=lfs diff=lfs merge=lfs -text
147
- unet/.cache/NhwcConv_0-conv_inConv_263.const filter=lfs diff=lfs merge=lfs -text
148
- unet/.cache/NhwcConv_0-conv_inConv_265.const filter=lfs diff=lfs merge=lfs -text
149
- unet/.cache/NhwcConv_0-conv_inConv_267.const filter=lfs diff=lfs merge=lfs -text
150
- unet/.cache/NhwcConv_0-conv_inConv_269.const filter=lfs diff=lfs merge=lfs -text
151
- unet/.cache/NhwcConv_0-conv_inConv_270.const filter=lfs diff=lfs merge=lfs -text
152
- unet/.cache/NhwcConv_0-conv_inConv_272.const filter=lfs diff=lfs merge=lfs -text
153
- unet/.cache/NhwcConv_0-conv_inConv_275.const filter=lfs diff=lfs merge=lfs -text
154
- unet/.cache/NhwcConv_0-conv_inConv_276.const filter=lfs diff=lfs merge=lfs -text
155
- unet/.cache/NhwcConv_0-conv_inConv_277.const filter=lfs diff=lfs merge=lfs -text
156
- unet/.cache/NhwcConv_0-conv_inConv_278.const filter=lfs diff=lfs merge=lfs -text
157
- unet/.cache/NhwcConv_0-conv_inConv_281.const filter=lfs diff=lfs merge=lfs -text
158
- unet/.cache/NhwcConv_0-conv_inConv_284.const filter=lfs diff=lfs merge=lfs -text
159
- unet/.cache/NhwcConv_0-conv_inConv_287.const filter=lfs diff=lfs merge=lfs -text
160
- unet/.cache/NhwcConv_0-conv_inConv_288.const filter=lfs diff=lfs merge=lfs -text
161
- unet/.cache/NhwcConv_0-conv_inConv_289.const filter=lfs diff=lfs merge=lfs -text
162
- unet/.cache/NhwcConv_0-conv_inConv_29.const filter=lfs diff=lfs merge=lfs -text
163
- unet/.cache/NhwcConv_0-conv_inConv_290.const filter=lfs diff=lfs merge=lfs -text
164
- unet/.cache/NhwcConv_0-conv_inConv_292.const filter=lfs diff=lfs merge=lfs -text
165
- unet/.cache/NhwcConv_0-conv_inConv_294.const filter=lfs diff=lfs merge=lfs -text
166
- unet/.cache/NhwcConv_0-conv_inConv_295.const filter=lfs diff=lfs merge=lfs -text
167
- unet/.cache/NhwcConv_0-conv_inConv_297.const filter=lfs diff=lfs merge=lfs -text
168
- unet/.cache/NhwcConv_0-conv_inConv_3.const filter=lfs diff=lfs merge=lfs -text
169
- unet/.cache/NhwcConv_0-conv_inConv_30.const filter=lfs diff=lfs merge=lfs -text
170
- unet/.cache/NhwcConv_0-conv_inConv_300.const filter=lfs diff=lfs merge=lfs -text
171
- unet/.cache/NhwcConv_0-conv_inConv_301.const filter=lfs diff=lfs merge=lfs -text
172
- unet/.cache/NhwcConv_0-conv_inConv_302.const filter=lfs diff=lfs merge=lfs -text
173
- unet/.cache/NhwcConv_0-conv_inConv_303.const filter=lfs diff=lfs merge=lfs -text
174
- unet/.cache/NhwcConv_0-conv_inConv_306.const filter=lfs diff=lfs merge=lfs -text
175
- unet/.cache/NhwcConv_0-conv_inConv_309.const filter=lfs diff=lfs merge=lfs -text
176
- unet/.cache/NhwcConv_0-conv_inConv_31.const filter=lfs diff=lfs merge=lfs -text
177
- unet/.cache/NhwcConv_0-conv_inConv_312.const filter=lfs diff=lfs merge=lfs -text
178
- unet/.cache/NhwcConv_0-conv_inConv_313.const filter=lfs diff=lfs merge=lfs -text
179
- unet/.cache/NhwcConv_0-conv_inConv_314.const filter=lfs diff=lfs merge=lfs -text
180
- unet/.cache/NhwcConv_0-conv_inConv_315.const filter=lfs diff=lfs merge=lfs -text
181
- unet/.cache/NhwcConv_0-conv_inConv_317.const filter=lfs diff=lfs merge=lfs -text
182
- unet/.cache/NhwcConv_0-conv_inConv_319.const filter=lfs diff=lfs merge=lfs -text
183
- unet/.cache/NhwcConv_0-conv_inConv_32.const filter=lfs diff=lfs merge=lfs -text
184
- unet/.cache/NhwcConv_0-conv_inConv_320.const filter=lfs diff=lfs merge=lfs -text
185
- unet/.cache/NhwcConv_0-conv_inConv_322.const filter=lfs diff=lfs merge=lfs -text
186
- unet/.cache/NhwcConv_0-conv_inConv_325.const filter=lfs diff=lfs merge=lfs -text
187
- unet/.cache/NhwcConv_0-conv_inConv_326.const filter=lfs diff=lfs merge=lfs -text
188
- unet/.cache/NhwcConv_0-conv_inConv_327.const filter=lfs diff=lfs merge=lfs -text
189
- unet/.cache/NhwcConv_0-conv_inConv_328.const filter=lfs diff=lfs merge=lfs -text
190
- unet/.cache/NhwcConv_0-conv_inConv_331.const filter=lfs diff=lfs merge=lfs -text
191
- unet/.cache/NhwcConv_0-conv_inConv_334.const filter=lfs diff=lfs merge=lfs -text
192
- unet/.cache/NhwcConv_0-conv_inConv_337.const filter=lfs diff=lfs merge=lfs -text
193
- unet/.cache/NhwcConv_0-conv_inConv_338.const filter=lfs diff=lfs merge=lfs -text
194
- unet/.cache/NhwcConv_0-conv_inConv_339.const filter=lfs diff=lfs merge=lfs -text
195
- unet/.cache/NhwcConv_0-conv_inConv_340.const filter=lfs diff=lfs merge=lfs -text
196
- unet/.cache/NhwcConv_0-conv_inConv_342.const filter=lfs diff=lfs merge=lfs -text
197
- unet/.cache/NhwcConv_0-conv_inConv_344.const filter=lfs diff=lfs merge=lfs -text
198
- unet/.cache/NhwcConv_0-conv_inConv_346.const filter=lfs diff=lfs merge=lfs -text
199
- unet/.cache/NhwcConv_0-conv_inConv_347.const filter=lfs diff=lfs merge=lfs -text
200
- unet/.cache/NhwcConv_0-conv_inConv_349.const filter=lfs diff=lfs merge=lfs -text
201
- unet/.cache/NhwcConv_0-conv_inConv_35.const filter=lfs diff=lfs merge=lfs -text
202
- unet/.cache/NhwcConv_0-conv_inConv_352.const filter=lfs diff=lfs merge=lfs -text
203
- unet/.cache/NhwcConv_0-conv_inConv_353.const filter=lfs diff=lfs merge=lfs -text
204
- unet/.cache/NhwcConv_0-conv_inConv_354.const filter=lfs diff=lfs merge=lfs -text
205
- unet/.cache/NhwcConv_0-conv_inConv_355.const filter=lfs diff=lfs merge=lfs -text
206
- unet/.cache/NhwcConv_0-conv_inConv_358.const filter=lfs diff=lfs merge=lfs -text
207
- unet/.cache/NhwcConv_0-conv_inConv_361.const filter=lfs diff=lfs merge=lfs -text
208
- unet/.cache/NhwcConv_0-conv_inConv_364.const filter=lfs diff=lfs merge=lfs -text
209
- unet/.cache/NhwcConv_0-conv_inConv_365.const filter=lfs diff=lfs merge=lfs -text
210
- unet/.cache/NhwcConv_0-conv_inConv_366.const filter=lfs diff=lfs merge=lfs -text
211
- unet/.cache/NhwcConv_0-conv_inConv_367.const filter=lfs diff=lfs merge=lfs -text
212
- unet/.cache/NhwcConv_0-conv_inConv_369.const filter=lfs diff=lfs merge=lfs -text
213
- unet/.cache/NhwcConv_0-conv_inConv_371.const filter=lfs diff=lfs merge=lfs -text
214
- unet/.cache/NhwcConv_0-conv_inConv_372.const filter=lfs diff=lfs merge=lfs -text
215
- unet/.cache/NhwcConv_0-conv_inConv_374.const filter=lfs diff=lfs merge=lfs -text
216
- unet/.cache/NhwcConv_0-conv_inConv_377.const filter=lfs diff=lfs merge=lfs -text
217
- unet/.cache/NhwcConv_0-conv_inConv_378.const filter=lfs diff=lfs merge=lfs -text
218
- unet/.cache/NhwcConv_0-conv_inConv_379.const filter=lfs diff=lfs merge=lfs -text
219
- unet/.cache/NhwcConv_0-conv_inConv_38.const filter=lfs diff=lfs merge=lfs -text
220
- unet/.cache/NhwcConv_0-conv_inConv_380.const filter=lfs diff=lfs merge=lfs -text
221
- unet/.cache/NhwcConv_0-conv_inConv_383.const filter=lfs diff=lfs merge=lfs -text
222
- unet/.cache/NhwcConv_0-conv_inConv_386.const filter=lfs diff=lfs merge=lfs -text
223
- unet/.cache/NhwcConv_0-conv_inConv_389.const filter=lfs diff=lfs merge=lfs -text
224
- unet/.cache/NhwcConv_0-conv_inConv_390.const filter=lfs diff=lfs merge=lfs -text
225
- unet/.cache/NhwcConv_0-conv_inConv_391.const filter=lfs diff=lfs merge=lfs -text
226
- unet/.cache/NhwcConv_0-conv_inConv_392.const filter=lfs diff=lfs merge=lfs -text
227
- unet/.cache/NhwcConv_0-conv_inConv_394.const filter=lfs diff=lfs merge=lfs -text
228
- unet/.cache/NhwcConv_0-conv_inConv_396.const filter=lfs diff=lfs merge=lfs -text
229
- unet/.cache/NhwcConv_0-conv_inConv_397.const filter=lfs diff=lfs merge=lfs -text
230
- unet/.cache/NhwcConv_0-conv_inConv_399.const filter=lfs diff=lfs merge=lfs -text
231
- unet/.cache/NhwcConv_0-conv_inConv_4.const filter=lfs diff=lfs merge=lfs -text
232
- unet/.cache/NhwcConv_0-conv_inConv_402.const filter=lfs diff=lfs merge=lfs -text
233
- unet/.cache/NhwcConv_0-conv_inConv_403.const filter=lfs diff=lfs merge=lfs -text
234
- unet/.cache/NhwcConv_0-conv_inConv_404.const filter=lfs diff=lfs merge=lfs -text
235
- unet/.cache/NhwcConv_0-conv_inConv_405.const filter=lfs diff=lfs merge=lfs -text
236
- unet/.cache/NhwcConv_0-conv_inConv_408.const filter=lfs diff=lfs merge=lfs -text
237
- unet/.cache/NhwcConv_0-conv_inConv_41.const filter=lfs diff=lfs merge=lfs -text
238
- unet/.cache/NhwcConv_0-conv_inConv_411.const filter=lfs diff=lfs merge=lfs -text
239
- unet/.cache/NhwcConv_0-conv_inConv_414.const filter=lfs diff=lfs merge=lfs -text
240
- unet/.cache/NhwcConv_0-conv_inConv_415.const filter=lfs diff=lfs merge=lfs -text
241
- unet/.cache/NhwcConv_0-conv_inConv_416.const filter=lfs diff=lfs merge=lfs -text
242
- unet/.cache/NhwcConv_0-conv_inConv_417.const filter=lfs diff=lfs merge=lfs -text
243
- unet/.cache/NhwcConv_0-conv_inConv_419.const filter=lfs diff=lfs merge=lfs -text
244
- unet/.cache/NhwcConv_0-conv_inConv_42.const filter=lfs diff=lfs merge=lfs -text
245
- unet/.cache/NhwcConv_0-conv_inConv_421.const filter=lfs diff=lfs merge=lfs -text
246
- unet/.cache/NhwcConv_0-conv_inConv_423.const filter=lfs diff=lfs merge=lfs -text
247
- unet/.cache/NhwcConv_0-conv_inConv_424.const filter=lfs diff=lfs merge=lfs -text
248
- unet/.cache/NhwcConv_0-conv_inConv_426.const filter=lfs diff=lfs merge=lfs -text
249
- unet/.cache/NhwcConv_0-conv_inConv_429.const filter=lfs diff=lfs merge=lfs -text
250
- unet/.cache/NhwcConv_0-conv_inConv_43.const filter=lfs diff=lfs merge=lfs -text
251
- unet/.cache/NhwcConv_0-conv_inConv_430.const filter=lfs diff=lfs merge=lfs -text
252
- unet/.cache/NhwcConv_0-conv_inConv_431.const filter=lfs diff=lfs merge=lfs -text
253
- unet/.cache/NhwcConv_0-conv_inConv_432.const filter=lfs diff=lfs merge=lfs -text
254
- unet/.cache/NhwcConv_0-conv_inConv_435.const filter=lfs diff=lfs merge=lfs -text
255
- unet/.cache/NhwcConv_0-conv_inConv_438.const filter=lfs diff=lfs merge=lfs -text
256
- unet/.cache/NhwcConv_0-conv_inConv_44.const filter=lfs diff=lfs merge=lfs -text
257
- unet/.cache/NhwcConv_0-conv_inConv_441.const filter=lfs diff=lfs merge=lfs -text
258
- unet/.cache/NhwcConv_0-conv_inConv_442.const filter=lfs diff=lfs merge=lfs -text
259
- unet/.cache/NhwcConv_0-conv_inConv_443.const filter=lfs diff=lfs merge=lfs -text
260
- unet/.cache/NhwcConv_0-conv_inConv_444.const filter=lfs diff=lfs merge=lfs -text
261
- unet/.cache/NhwcConv_0-conv_inConv_446.const filter=lfs diff=lfs merge=lfs -text
262
- unet/.cache/NhwcConv_0-conv_inConv_448.const filter=lfs diff=lfs merge=lfs -text
263
- unet/.cache/NhwcConv_0-conv_inConv_449.const filter=lfs diff=lfs merge=lfs -text
264
- unet/.cache/NhwcConv_0-conv_inConv_451.const filter=lfs diff=lfs merge=lfs -text
265
- unet/.cache/NhwcConv_0-conv_inConv_454.const filter=lfs diff=lfs merge=lfs -text
266
- unet/.cache/NhwcConv_0-conv_inConv_455.const filter=lfs diff=lfs merge=lfs -text
267
- unet/.cache/NhwcConv_0-conv_inConv_456.const filter=lfs diff=lfs merge=lfs -text
268
- unet/.cache/NhwcConv_0-conv_inConv_457.const filter=lfs diff=lfs merge=lfs -text
269
- unet/.cache/NhwcConv_0-conv_inConv_46.const filter=lfs diff=lfs merge=lfs -text
270
- unet/.cache/NhwcConv_0-conv_inConv_460.const filter=lfs diff=lfs merge=lfs -text
271
- unet/.cache/NhwcConv_0-conv_inConv_463.const filter=lfs diff=lfs merge=lfs -text
272
- unet/.cache/NhwcConv_0-conv_inConv_466.const filter=lfs diff=lfs merge=lfs -text
273
- unet/.cache/NhwcConv_0-conv_inConv_467.const filter=lfs diff=lfs merge=lfs -text
274
- unet/.cache/NhwcConv_0-conv_inConv_468.const filter=lfs diff=lfs merge=lfs -text
275
- unet/.cache/NhwcConv_0-conv_inConv_469.const filter=lfs diff=lfs merge=lfs -text
276
- unet/.cache/NhwcConv_0-conv_inConv_47.const filter=lfs diff=lfs merge=lfs -text
277
- unet/.cache/NhwcConv_0-conv_inConv_471.const filter=lfs diff=lfs merge=lfs -text
278
- unet/.cache/NhwcConv_0-conv_inConv_473.const filter=lfs diff=lfs merge=lfs -text
279
- unet/.cache/NhwcConv_0-conv_inConv_474.const filter=lfs diff=lfs merge=lfs -text
280
- unet/.cache/NhwcConv_0-conv_inConv_476.const filter=lfs diff=lfs merge=lfs -text
281
- unet/.cache/NhwcConv_0-conv_inConv_479.const filter=lfs diff=lfs merge=lfs -text
282
- unet/.cache/NhwcConv_0-conv_inConv_480.const filter=lfs diff=lfs merge=lfs -text
283
- unet/.cache/NhwcConv_0-conv_inConv_481.const filter=lfs diff=lfs merge=lfs -text
284
- unet/.cache/NhwcConv_0-conv_inConv_482.const filter=lfs diff=lfs merge=lfs -text
285
- unet/.cache/NhwcConv_0-conv_inConv_485.const filter=lfs diff=lfs merge=lfs -text
286
- unet/.cache/NhwcConv_0-conv_inConv_488.const filter=lfs diff=lfs merge=lfs -text
287
- unet/.cache/NhwcConv_0-conv_inConv_49.const filter=lfs diff=lfs merge=lfs -text
288
- unet/.cache/NhwcConv_0-conv_inConv_491.const filter=lfs diff=lfs merge=lfs -text
289
- unet/.cache/NhwcConv_0-conv_inConv_492.const filter=lfs diff=lfs merge=lfs -text
290
- unet/.cache/NhwcConv_0-conv_inConv_493.const filter=lfs diff=lfs merge=lfs -text
291
- unet/.cache/NhwcConv_0-conv_inConv_494.const filter=lfs diff=lfs merge=lfs -text
292
- unet/.cache/NhwcConv_0-conv_inConv_5.const filter=lfs diff=lfs merge=lfs -text
293
- unet/.cache/NhwcConv_0-conv_inConv_51.const filter=lfs diff=lfs merge=lfs -text
294
- unet/.cache/NhwcConv_0-conv_inConv_54.const filter=lfs diff=lfs merge=lfs -text
295
- unet/.cache/NhwcConv_0-conv_inConv_55.const filter=lfs diff=lfs merge=lfs -text
296
- unet/.cache/NhwcConv_0-conv_inConv_56.const filter=lfs diff=lfs merge=lfs -text
297
- unet/.cache/NhwcConv_0-conv_inConv_57.const filter=lfs diff=lfs merge=lfs -text
298
- unet/.cache/NhwcConv_0-conv_inConv_6.const filter=lfs diff=lfs merge=lfs -text
299
- unet/.cache/NhwcConv_0-conv_inConv_60.const filter=lfs diff=lfs merge=lfs -text
300
- unet/.cache/NhwcConv_0-conv_inConv_63.const filter=lfs diff=lfs merge=lfs -text
301
- unet/.cache/NhwcConv_0-conv_inConv_66.const filter=lfs diff=lfs merge=lfs -text
302
- unet/.cache/NhwcConv_0-conv_inConv_67.const filter=lfs diff=lfs merge=lfs -text
303
- unet/.cache/NhwcConv_0-conv_inConv_68.const filter=lfs diff=lfs merge=lfs -text
304
- unet/.cache/NhwcConv_0-conv_inConv_69.const filter=lfs diff=lfs merge=lfs -text
305
- unet/.cache/NhwcConv_0-conv_inConv_7.const filter=lfs diff=lfs merge=lfs -text
306
- unet/.cache/NhwcConv_0-conv_inConv_70.const filter=lfs diff=lfs merge=lfs -text
307
- unet/.cache/NhwcConv_0-conv_inConv_72.const filter=lfs diff=lfs merge=lfs -text
308
- unet/.cache/NhwcConv_0-conv_inConv_73.const filter=lfs diff=lfs merge=lfs -text
309
- unet/.cache/NhwcConv_0-conv_inConv_75.const filter=lfs diff=lfs merge=lfs -text
310
- unet/.cache/NhwcConv_0-conv_inConv_76.const filter=lfs diff=lfs merge=lfs -text
311
- unet/.cache/NhwcConv_0-conv_inConv_77.const filter=lfs diff=lfs merge=lfs -text
312
- unet/.cache/NhwcConv_0-conv_inConv_78.const filter=lfs diff=lfs merge=lfs -text
313
- unet/.cache/NhwcConv_0-conv_inConv_79.const filter=lfs diff=lfs merge=lfs -text
314
- unet/.cache/NhwcConv_0-conv_inConv_8.const filter=lfs diff=lfs merge=lfs -text
315
- unet/.cache/NhwcConv_0-conv_inConv_80.const filter=lfs diff=lfs merge=lfs -text
316
- unet/.cache/NhwcConv_0-conv_inConv_81.const filter=lfs diff=lfs merge=lfs -text
317
- unet/.cache/NhwcConv_0-conv_inConv_82.const filter=lfs diff=lfs merge=lfs -text
318
- unet/.cache/NhwcConv_0-conv_inConv_83.const filter=lfs diff=lfs merge=lfs -text
319
- unet/.cache/NhwcConv_0-conv_inConv_84.const filter=lfs diff=lfs merge=lfs -text
320
- unet/.cache/NhwcConv_0-conv_inConv_85.const filter=lfs diff=lfs merge=lfs -text
321
- unet/.cache/NhwcConv_0-conv_inConv_86.const filter=lfs diff=lfs merge=lfs -text
322
- unet/.cache/NhwcConv_0-conv_inConv_87.const filter=lfs diff=lfs merge=lfs -text
323
- unet/.cache/NhwcConv_0-conv_inConv_88.const filter=lfs diff=lfs merge=lfs -text
324
- unet/.cache/NhwcConv_0-conv_inConv_89.const filter=lfs diff=lfs merge=lfs -text
325
- unet/.cache/NhwcConv_0-conv_inConv_9.const filter=lfs diff=lfs merge=lfs -text
326
- unet/.cache/NhwcConv_0-conv_inConv_90.const filter=lfs diff=lfs merge=lfs -text
327
- unet/.cache/NhwcConv_0-conv_inConv_91.const filter=lfs diff=lfs merge=lfs -text
328
- unet/.cache/NhwcConv_0-conv_inConv_92.const filter=lfs diff=lfs merge=lfs -text
329
- unet/.cache/NhwcConv_0-conv_inConv_93.const filter=lfs diff=lfs merge=lfs -text
330
- unet/.cache/NhwcConv_0-conv_inConv_94.const filter=lfs diff=lfs merge=lfs -text
331
- unet/.cache/NhwcConv_0-conv_inConv_95.const filter=lfs diff=lfs merge=lfs -text
332
- unet/.cache/NhwcConv_0-conv_inConv_96.const filter=lfs diff=lfs merge=lfs -text
333
- unet/.cache/NhwcConv_0-conv_inConv_97.const filter=lfs diff=lfs merge=lfs -text
334
- unet/.cache/NhwcConv_0-conv_inConv_98.const filter=lfs diff=lfs merge=lfs -text
335
- unet/.cache/NhwcConv_0-conv_inConv_99.const filter=lfs diff=lfs merge=lfs -text
336
- unet/dd_metastate_SD15_Unet_NhwcConv_0-conv_inConv.ctrlpkt filter=lfs diff=lfs merge=lfs -text
337
- unet/dd_metastate_SD15_Unet_NhwcConv_0-conv_inConv.fconst filter=lfs diff=lfs merge=lfs -text
338
- unet/dd_metastate_SD15_Unet_NhwcConv_0-conv_inConv.state filter=lfs diff=lfs merge=lfs -text
339
- unet/dd_metastate_SD15_Unet_NhwcConv_0-conv_inConv.super filter=lfs diff=lfs merge=lfs -text
340
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_10.const filter=lfs diff=lfs merge=lfs -text
341
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_11.const filter=lfs diff=lfs merge=lfs -text
342
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_13.const filter=lfs diff=lfs merge=lfs -text
343
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_16.const filter=lfs diff=lfs merge=lfs -text
344
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_19.const filter=lfs diff=lfs merge=lfs -text
345
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_22.const filter=lfs diff=lfs merge=lfs -text
346
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_25.const filter=lfs diff=lfs merge=lfs -text
347
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_28.const filter=lfs diff=lfs merge=lfs -text
348
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_31.const filter=lfs diff=lfs merge=lfs -text
349
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_34.const filter=lfs diff=lfs merge=lfs -text
350
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_37.const filter=lfs diff=lfs merge=lfs -text
351
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_39.const filter=lfs diff=lfs merge=lfs -text
352
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_4.const filter=lfs diff=lfs merge=lfs -text
353
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_42.const filter=lfs diff=lfs merge=lfs -text
354
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_45.const filter=lfs diff=lfs merge=lfs -text
355
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_48.const filter=lfs diff=lfs merge=lfs -text
356
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_51.const filter=lfs diff=lfs merge=lfs -text
357
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_54.const filter=lfs diff=lfs merge=lfs -text
358
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_57.const filter=lfs diff=lfs merge=lfs -text
359
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_59.const filter=lfs diff=lfs merge=lfs -text
360
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_61.const filter=lfs diff=lfs merge=lfs -text
361
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_63.const filter=lfs diff=lfs merge=lfs -text
362
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_66.const filter=lfs diff=lfs merge=lfs -text
363
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_69.const filter=lfs diff=lfs merge=lfs -text
364
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_7.const filter=lfs diff=lfs merge=lfs -text
365
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_72.const filter=lfs diff=lfs merge=lfs -text
366
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_75.const filter=lfs diff=lfs merge=lfs -text
367
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_78.const filter=lfs diff=lfs merge=lfs -text
368
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_80.const filter=lfs diff=lfs merge=lfs -text
369
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_84.const filter=lfs diff=lfs merge=lfs -text
370
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_87.const filter=lfs diff=lfs merge=lfs -text
371
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_9.const filter=lfs diff=lfs merge=lfs -text
372
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_90.const filter=lfs diff=lfs merge=lfs -text
373
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_93.const filter=lfs diff=lfs merge=lfs -text
374
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_96.const filter=lfs diff=lfs merge=lfs -text
375
- vae_decoder/.cache/NhwcConv_0-post_quant_convConv_99.const filter=lfs diff=lfs merge=lfs -text
376
- vae_decoder/dd_metastate_Sd15_Decoder_NhwcConv_0-post_quant_convConv.ctrlpkt filter=lfs diff=lfs merge=lfs -text
377
- vae_decoder/dd_metastate_Sd15_Decoder_NhwcConv_0-post_quant_convConv.fconst filter=lfs diff=lfs merge=lfs -text
378
- vae_decoder/dd_metastate_Sd15_Decoder_NhwcConv_0-post_quant_convConv.state filter=lfs diff=lfs merge=lfs -text
379
- vae_decoder/dd_metastate_Sd15_Decoder_NhwcConv_0-post_quant_convConv.super filter=lfs diff=lfs merge=lfs -text
380
- ryzen-ai-end-user-license-agreement-public.pdf filter=lfs diff=lfs merge=lfs -text
 
33
  *.zip filter=lfs diff=lfs merge=lfs -text
34
  *.zst filter=lfs diff=lfs merge=lfs -text
35
  *tfevents* filter=lfs diff=lfs merge=lfs -text
36
+ *.ctrlpkt filter=lfs diff=lfs merge=lfs -text
37
+ *.fconst filter=lfs diff=lfs merge=lfs -text
38
+ *.state filter=lfs diff=lfs merge=lfs -text
39
+ *.super filter=lfs diff=lfs merge=lfs -text
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
LICENSE ADDED
@@ -0,0 +1,82 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ Copyright (c) 2022 Robin Rombach and Patrick Esser and contributors
2
+
3
+ CreativeML Open RAIL-M
4
+ dated August 22, 2022
5
+
6
+ Section I: PREAMBLE
7
+
8
+ Multimodal generative models are being widely adopted and used, and have the potential to transform the way artists, among other individuals, conceive and benefit from AI or ML technologies as a tool for content creation.
9
+
10
+ Notwithstanding the current and potential benefits that these artifacts can bring to society at large, there are also concerns about potential misuses of them, either due to their technical limitations or ethical considerations.
11
+
12
+ In short, this license strives for both the open and responsible downstream use of the accompanying model. When it comes to the open character, we took inspiration from open source permissive licenses regarding the grant of IP rights. Referring to the downstream responsible use, we added use-based restrictions not permitting the use of the Model in very specific scenarios, in order for the licensor to be able to enforce the license in case potential misuses of the Model may occur. At the same time, we strive to promote open and responsible research on generative models for art and content generation.
13
+
14
+ Even though downstream derivative versions of the model could be released under different licensing terms, the latter will always have to include - at minimum - the same use-based restrictions as the ones in the original license (this license). We believe in the intersection between open and responsible AI development; thus, this License aims to strike a balance between both in order to enable responsible open-science in the field of AI.
15
+
16
+ This License governs the use of the model (and its derivatives) and is informed by the model card associated with the model.
17
+
18
+ NOW THEREFORE, You and Licensor agree as follows:
19
+
20
+ 1. Definitions
21
+
22
+ - "License" means the terms and conditions for use, reproduction, and Distribution as defined in this document.
23
+ - "Data" means a collection of information and/or content extracted from the dataset used with the Model, including to train, pretrain, or otherwise evaluate the Model. The Data is not licensed under this License.
24
+ - "Output" means the results of operating a Model as embodied in informational content resulting therefrom.
25
+ - "Model" means any accompanying machine-learning based assemblies (including checkpoints), consisting of learnt weights, parameters (including optimizer states), corresponding to the model architecture as embodied in the Complementary Material, that have been trained or tuned, in whole or in part on the Data, using the Complementary Material.
26
+ - "Derivatives of the Model" means all modifications to the Model, works based on the Model, or any other model which is created or initialized by transfer of patterns of the weights, parameters, activations or output of the Model, to the other model, in order to cause the other model to perform similarly to the Model, including - but not limited to - distillation methods entailing the use of intermediate data representations or methods based on the generation of synthetic data by the Model for training the other model.
27
+ - "Complementary Material" means the accompanying source code and scripts used to define, run, load, benchmark or evaluate the Model, and used to prepare data for training or evaluation, if any. This includes any accompanying documentation, tutorials, examples, etc, if any.
28
+ - "Distribution" means any transmission, reproduction, publication or other sharing of the Model or Derivatives of the Model to a third party, including providing the Model as a hosted service made available by electronic or other remote means - e.g. API-based or web access.
29
+ - "Licensor" means the copyright owner or entity authorized by the copyright owner that is granting the License, including the persons or entities that may have rights in the Model and/or distributing the Model.
30
+ - "You" (or "Your") means an individual or Legal Entity exercising permissions granted by this License and/or making use of the Model for whichever purpose and in any field of use, including usage of the Model in an end-use application - e.g. chatbot, translator, image generator.
31
+ - "Third Parties" means individuals or legal entities that are not under common control with Licensor or You.
32
+ - "Contribution" means any work of authorship, including the original version of the Model and any modifications or additions to that Model or Derivatives of the Model thereof, that is intentionally submitted to Licensor for inclusion in the Model by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Model, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution."
33
+ - "Contributor" means Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Model.
34
+
35
+ Section II: INTELLECTUAL PROPERTY RIGHTS
36
+
37
+ Both copyright and patent grants apply to the Model, Derivatives of the Model and Complementary Material. The Model and Derivatives of the Model are subject to additional terms as described in Section III.
38
+
39
+ 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare, publicly display, publicly perform, sublicense, and distribute the Complementary Material, the Model, and Derivatives of the Model.
40
+ 3. Grant of Patent License. Subject to the terms and conditions of this License and where and as applicable, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this paragraph) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Model and the Complementary Material, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Model to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Model and/or Complementary Material or a Contribution incorporated within the Model and/or Complementary Material constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for the Model and/or Work shall terminate as of the date such litigation is asserted or filed.
41
+
42
+ Section III: CONDITIONS OF USAGE, DISTRIBUTION AND REDISTRIBUTION
43
+
44
+ 4. Distribution and Redistribution. You may host for Third Party remote access purposes (e.g. software-as-a-service), reproduce and distribute copies of the Model or Derivatives of the Model thereof in any medium, with or without modifications, provided that You meet the following conditions:
45
+ Use-based restrictions as referenced in paragraph 5 MUST be included as an enforceable provision by You in any type of legal agreement (e.g. a license) governing the use and/or distribution of the Model or Derivatives of the Model, and You shall give notice to subsequent users You Distribute to, that the Model or Derivatives of the Model are subject to paragraph 5. This provision does not apply to the use of Complementary Material.
46
+ You must give any Third Party recipients of the Model or Derivatives of the Model a copy of this License;
47
+ You must cause any modified files to carry prominent notices stating that You changed the files;
48
+ You must retain all copyright, patent, trademark, and attribution notices excluding those notices that do not pertain to any part of the Model, Derivatives of the Model.
49
+ You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions - respecting paragraph 4.a. - for use, reproduction, or Distribution of Your modifications, or for any such Derivatives of the Model as a whole, provided Your use, reproduction, and Distribution of the Model otherwise complies with the conditions stated in this License.
50
+ 5. Use-based restrictions. The restrictions set forth in Attachment A are considered Use-based restrictions. Therefore You cannot use the Model and the Derivatives of the Model for the specified restricted uses. You may use the Model subject to this License, including only for lawful purposes and in accordance with the License. Use may include creating any content with, finetuning, updating, running, training, evaluating and/or reparametrizing the Model. You shall require all of Your users who use the Model or a Derivative of the Model to comply with the terms of this paragraph (paragraph 5).
51
+ 6. The Output You Generate. Except as set forth herein, Licensor claims no rights in the Output You generate using the Model. You are accountable for the Output you generate and its subsequent uses. No use of the output can contravene any provision as stated in the License.
52
+
53
+ Section IV: OTHER PROVISIONS
54
+
55
+ 7. Updates and Runtime Restrictions. To the maximum extent permitted by law, Licensor reserves the right to restrict (remotely or otherwise) usage of the Model in violation of this License, update the Model through electronic means, or modify the Output of the Model based on updates. You shall undertake reasonable efforts to use the latest version of the Model.
56
+ 8. Trademarks and related. Nothing in this License permits You to make use of Licensors’ trademarks, trade names, logos or to otherwise suggest endorsement or misrepresent the relationship between the parties; and any rights not expressly granted herein are reserved by the Licensors.
57
+ 9. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Model and the Complementary Material (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Model, Derivatives of the Model, and the Complementary Material and assume any risks associated with Your exercise of permissions under this License.
58
+ 10. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Model and the Complementary Material (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
59
+ 11. Accepting Warranty or Additional Liability. While redistributing the Model, Derivatives of the Model and the Complementary Material thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability.
60
+ 12. If any provision of this License is held to be invalid, illegal or unenforceable, the remaining provisions shall be unaffected thereby and remain valid as if such provision had not been set forth herein.
61
+
62
+ END OF TERMS AND CONDITIONS
63
+
64
+
65
+
66
+
67
+ Attachment A
68
+
69
+ Use Restrictions
70
+
71
+ You agree not to use the Model or Derivatives of the Model:
72
+ - In any way that violates any applicable national, federal, state, local or international law or regulation;
73
+ - For the purpose of exploiting, harming or attempting to exploit or harm minors in any way;
74
+ - To generate or disseminate verifiably false information and/or content with the purpose of harming others;
75
+ - To generate or disseminate personal identifiable information that can be used to harm an individual;
76
+ - To defame, disparage or otherwise harass others;
77
+ - For fully automated decision making that adversely impacts an individual’s legal rights or otherwise creates or modifies a binding, enforceable obligation;
78
+ - For any use intended to or which has the effect of discriminating against or harming individuals or groups based on online or offline social behavior or known or predicted personal or personality characteristics;
79
+ - To exploit any of the vulnerabilities of a specific group of persons based on their age, social, physical or mental characteristics, in order to materially distort the behavior of a person pertaining to that group in a manner that causes or is likely to cause that person or another person physical or psychological harm;
80
+ - For any use intended to or which has the effect of discriminating against individuals or groups based on legally protected characteristics or categories;
81
+ - To provide medical advice and medical results interpretation;
82
+ - To generate or disseminate information for the purpose to be used for administration of justice, law enforcement, immigration or asylum processes, such as predicting an individual will commit fraud/crime commitment (e.g. by text profiling, drawing causal relationships between assertions made in documents, indiscriminate and arbitrarily-targeted use).
README.md CHANGED
@@ -1,70 +1,80 @@
1
  ---
 
2
  license: creativeml-openrail-m
 
 
 
 
 
 
 
 
 
3
  ---
4
- # Image Generation NPU Models SD 1.5
5
 
6
- This repository contains the ONNX models and runtime libraries required to run the image generation pipeline on AMD NPUs.
 
7
 
8
- The folder structure is organized to mirror the main components of the diffusion pipeline (UNet, VAE decoder, text encoder, tokenizer and scheduler), plus the platform-specific runtime libraries.
9
 
10
- ---
11
 
12
- ## Repository structure
13
 
14
- ```
15
- .
16
- ├─ libs/
17
  ├─ scheduler/
18
  ├─ text_encoder/
19
  ├─ tokenizer/
20
  ├─ unet/
21
  └─ vae_decoder/
22
  ```
 
23
 
24
- ### `libs/`
25
- This folder contains the dynamic libraries (`.dll`) required at runtime by the NPU backend.
26
- They must be placed in a location where the application can load them (e.g., in the same folder as the executable or in the system `PATH`).
27
 
28
- ### `unet/`
29
- This folder contains the UNet model used in the diffusion process.
30
- The UNet is exported and structured specifically to leverage the AMD NPU accelerator for the denoising steps.
31
 
32
- ### `vae_decoder/`
33
- This folder contains the VAE decoder model used to map latent representations back to the image space.
34
- The VAE decoder is also structured to make use of the NPU accelerator for efficient image reconstruction.
35
 
36
- ### `text_encoder/`
37
- This folder contains the text encoder model used to convert the input prompt into conditioning embeddings for the diffusion model.
38
 
39
- ### `tokenizer/`
40
- This folder contains the tokenizer configuration and vocabulary files required to preprocess the text prompt before it is fed to the text encoder.
41
 
42
- ### `scheduler/`
43
- This folder contains the scheduler configuration (timesteps, betas, alphas, etc.) used during the diffusion sampling process.
 
 
 
 
 
 
 
 
44
 
45
- ---
46
 
47
- ## Release 1113
48
 
49
- This release corresponds to the **1113 build**.
50
 
51
- **Included in this version:**
52
- - Updated UNet and VAE Decoder models optimized for AMD NPU execution.
53
- - Synchronized text encoder, tokenizer, and scheduler components aligned with the 1113 pipeline.
54
- - Updated runtime DLLs in the `libs/` folder.
55
- - Improved model folder structure for compatibility with Procyon and NPU execution environments.
56
 
57
- **Notes:**
58
- - All ONNX models in this release are validated with the 1113 test package.
59
- - Ensure that the DLLs from `libs/` are correctly placed in the application’s search path.
60
- - This release is intended for NPU execution; GPU versions are hosted separately.
61
 
62
- ---
63
 
64
- ## Notes
65
 
66
- - UNet and VAE decoder models are optimized and structured to run on AMD NPUs.
67
- - The other components (text encoder, tokenizer and scheduler) are shared between GPU and NPU pipelines, but are provided here for completeness.
68
- - Please refer to the associated application or benchmark documentation for detailed integration and usage instructions (e.g., how to set model paths, environment variables and library search paths).
69
 
70
- ---
 
 
 
 
 
 
 
 
 
 
1
  ---
2
+ language: en
3
  license: creativeml-openrail-m
4
+ tags:
5
+ - stable-diffusion
6
+ - stable-diffusion-diffusers
7
+ - text-to-image
8
+ - RyzenAI
9
+ - Quantization
10
+ - ONNX
11
+ - Computer Vision
12
+ inference: true
13
  ---
14
+ # 🚀 Stable Diffusion 1.5 on AMD AI PC NPU
15
 
16
+ "Stable Diffusion is a latent text-to-image diffusion model capable of generating photo-realistic images given any text input. For more information about how Stable Diffusion functions, please have a look at [🤗's Stable Diffusion blog](https://huggingface.co/blog/stable_diffusion)".
17
+ More details about this model can be found on the original Hugging Face model card: [stable-diffusion-v1-5/stable-diffusion-v1-5](https://huggingface.co/stable-diffusion-v1-5/stable-diffusion-v1-5).
18
 
19
+ This model repo contains the optimized ONNX models required to run the image generation pipeline for Stable Diffusion 1.5 on AMD NPUs.
20
 
21
+ ## Model Details
22
 
23
+ The folder structure is organized to mirror the main components of the diffusion pipeline (scheduler, text encoder, tokenizer, UNet, and VAE decoder).
24
 
25
+ ```text
 
 
26
  ├─ scheduler/
27
  ├─ text_encoder/
28
  ├─ tokenizer/
29
  ├─ unet/
30
  └─ vae_decoder/
31
  ```
32
+ The [scheduler](scheduler) folder contains the scheduler configuration (timesteps, betas, alphas, etc.) used during the diffusion sampling process.
33
 
34
+ The [text_encoder](text_encoder) folder contains the text encoder model used to convert the input prompt into conditioning embeddings for the diffusion model.
 
 
35
 
36
+ The [tokenizer](tokenizer) contains the tokenizer configuration and vocabulary files required to preprocess the text prompt before it is fed to the text encoder.
 
 
37
 
38
+ The [unet](unet) folder contains the UNet model used in the diffusion process. The UNet is exported and structured specifically to leverage the AMD NPU accelerator for the denoising steps.
 
 
39
 
40
+ The [vae_decoder](vae_decoder) folder contains the VAE decoder model used to map latent representations back to the image space. The VAE decoder is also structured to make use of the NPU accelerator for efficient image reconstruction.
 
41
 
42
+ > Note: UNet and VAE decoder models are optimized and structured to run on AMD NPUs. The other components (text encoder, tokenizer and scheduler) are shared between GPU and NPU pipelines, but are provided here for completeness.
 
43
 
44
+ | Model Details | Description |
45
+ | ----------- | ----------- |
46
+ | Person or organization developing model | [Giovanni Guasti (AMD)](https://huggingface.co/gguasti), [Benjamin Consolvo (AMD)](https://huggingface.co/bconsolvo) |
47
+ | Original model authors | [Robin Rombach](https://huggingface.co/rromb), [Patrick Esser](https://huggingface.co/pesser) |
48
+ | Model date | January 2026 |
49
+ | Model version | 1.7.0 |
50
+ | Model type | Diffusion-based text-to-image generation model |
51
+ | Information about training algorithms, parameters, fairness constraints or other applied approaches, and features | This is a model that can be used to generate and modify images based on text prompts. It is a [Latent Diffusion Model](https://arxiv.org/abs/2112.10752) that uses a fixed, pretrained text encoder ([CLIP ViT-L/14](https://arxiv.org/abs/2103.00020)) as suggested in the [Imagen paper](https://arxiv.org/abs/2205.11487). |
52
+ | License | [CreativeML OpenRAIL-M](LICENSE) |
53
+ | Where to send questions or comments about the model | [Community Tab](https://hf.co/amd/stable-diffusion-1.5-amdnpu/discussions) and [AMD Developer Community Discord](https://discord.gg/amd-dev) |
54
 
55
+ ## ⚡ Intended Use
56
 
57
+ #### Getting Started
58
 
59
+ To get started on with this model, visit [github.com/amd/sd-sandbox](https://github.com/amd/sd-sandbox).
60
 
61
+ ## Ethical Considerations
 
 
 
 
62
 
63
+ AMD is committed to conducting our business in a fair, ethical and honest manner and in compliance with all applicable laws, rules and regulations. You can find out more at the [AMD Ethics and Compliance](https://www.amd.com/en/corporate/corporate-responsibility/ethics-and-compliance.html) page.
 
 
 
64
 
65
+ ## ⚠️ Caveats and Recommendations
66
 
67
+ Please visit the original model card for more details: [stable-diffusion-v1-5/stable-diffusion-v1-5](https://huggingface.co/stable-diffusion-v1-5/stable-diffusion-v1-5).
68
 
69
+ ## 📌 Citation Details
 
 
70
 
71
+ ```bibtex
72
+ @InProceedings{Rombach_2022_CVPR,
73
+ author = {Rombach, Robin and Blattmann, Andreas and Lorenz, Dominik and Esser, Patrick and Ommer, Bj\"orn},
74
+ title = {High-Resolution Image Synthesis With Latent Diffusion Models},
75
+ booktitle = {Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)},
76
+ month = {June},
77
+ year = {2022},
78
+ pages = {10684-10695}
79
+ }
80
+ ```
SD1.5 NPU Model support for UL Procyon SD1.5_third_party_notices.txt DELETED
@@ -1,220 +0,0 @@
1
- Third-Party Notices Report for Inventory for SD1.5 NPU Model support for UL Procyon SD1.5
2
-
3
-
4
-
5
- AMD copyrighted code (MIT)
6
-
7
-
8
- Copyright Statements
9
-
10
- Copyright (C) 2018 - 2022 Xilinx, Inc. All rights reserved.
11
- Copyright (C) 2022-2024, Advanced Micro Devices, Inc. All Rights Reserved.
12
-
13
-
14
- License Text https://spdx.org/licenses/MIT.html
15
-
16
-
17
- Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
18
-
19
- The above copyright notice and this permission notice (including the next paragraph) shall be included in all copies or substantial portions of the Software.
20
-
21
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
22
-
23
- AMD copyrighted code (Apache-2.0)
24
-
25
-
26
- Copyright Statements
27
-
28
- Copyright?? 2022-2024 Advanced Micro Devices, Inc. All rights reserved.
29
- Copyright 2015-2022 Xilinx, Inc. All rights reserved
30
-
31
- Copyright (C) 2022 Xilinx, Inc
32
-
33
- License Text https://spdx.org/licenses/Apache-2.0.html
34
-
35
-
36
- Apache License
37
- Version 2.0, January 2004
38
- http://www.apache.org/licenses/
39
-
40
- TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
41
-
42
- 1. Definitions.
43
- "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document.
44
-
45
- "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License.
46
-
47
- "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
48
-
49
- "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License.
50
-
51
- "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files.
52
-
53
- "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types.
54
-
55
- "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below).
56
-
57
- "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof.
58
-
59
- "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution."
60
-
61
- "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work.
62
-
63
- 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form.
64
- 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed.
65
- 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions:
66
- (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and
67
- (b) You must cause any modified files to carry prominent notices stating that You changed the files; and
68
- (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and
69
- (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License.
70
- You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License.
71
-
72
- 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions.
73
- 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file.
74
- 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License.
75
- 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
76
- 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability.
77
- END OF TERMS AND CONDITIONS
78
-
79
- APPENDIX: How to apply the Apache License to your work.
80
-
81
- To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives.
82
-
83
- Copyright [yyyy] [name of copyright owner]
84
-
85
- Licensed under the Apache License, Version 2.0 (the "License");
86
- you may not use this file except in compliance with the License.
87
- You may obtain a copy of the License at
88
-
89
- http://www.apache.org/licenses/LICENSE-2.0
90
-
91
- Unless required by applicable law or agreed to in writing, software
92
- distributed under the License is distributed on an "AS IS" BASIS,
93
- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
94
- See the License for the specific language governing permissions and
95
- limitations under the License.
96
-
97
- Standard License Header
98
- Copyright [yyyy] [name of copyright owner]
99
-
100
- Licensed under the Apache License, Version 2.0 (the "License");
101
- you may not use this file except in compliance with the License.
102
- You may obtain a copy of the License at
103
-
104
- http://www.apache.org/licenses/LICENSE-2.0
105
-
106
- Unless required by applicable law or agreed to in writing, software
107
- distributed under the License is distributed on an "AS IS" BASIS,
108
- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
109
- See the License for the specific language governing permissions and
110
- limitations under the License.
111
-
112
- stbrumme-hash-library v-u (Zlib)
113
-
114
-
115
- Copyright Statements
116
-
117
- Copyright (c) 2014,2015 Stephan Brumme
118
-
119
-
120
- License Text https://spdx.org/licenses/Zlib.html
121
-
122
-
123
- This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software.
124
-
125
- Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions:
126
-
127
- 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
128
- 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
129
- 3. This notice may not be removed or altered from any source distribution.
130
-
131
- AMD copyrighted code (BSD-2-Clause)
132
-
133
-
134
- Copyright Statements
135
-
136
- Copyright (C) 2022 Xilinx, Inc. All rights reserved.
137
- * Copyright (C) 2023 ??? 2024 Advanced Micro Devices, Inc. All rights
138
- * reserved
139
-
140
- License Text https://spdx.org/licenses/BSD-2-Clause.html
141
-
142
-
143
- /*
144
- * The Xilinx Vitis AI Vaip in this distribution are provided under the
145
- * following free and permissive binary-only license, but are not provided in
146
- * source code form. While the following free and permissive license is similar
147
- * to the BSD open source license, it is NOT the BSD open source license nor
148
- * other OSI-approved open source license.
149
- *
150
- * Copyright ?? 2020 Xilinx, Inc.
151
- *
152
- * Redistribution and use in binary form only, without modification, is
153
- * permitted provided that the following conditions are met:
154
- *
155
- * 1. Redistributions must reproduce the above copyright notice, this list
156
- * of conditions and the following disclaimer in the documentation and/or other
157
- * materials provided with the distribution.
158
- *
159
- * 2. The name of Xilinx, Inc. may not be used to endorse or promote
160
- * products redistributed with this software without specific prior written
161
- * permission.
162
- *
163
- * THIS SOFTWARE IS PROVIDED BY XILINX, INC. "AS IS" AND ANY EXPRESS OR
164
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
165
- * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
166
- * EVENT SHALL XILINX, INC. BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
167
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
168
- * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
169
- * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
170
- * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
171
- * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
172
- * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE
173
- */
174
-
175
- Zlib 1.3.1 (Zlib)
176
-
177
-
178
- Copyright Statements
179
-
180
- Copyright (C) 2004, 2008, 2012 Mark Adler, all rights reserved
181
-
182
- License Text https://spdx.org/licenses/Zlib.html
183
-
184
-
185
- This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software.
186
-
187
- Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions:
188
-
189
- 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
190
- 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
191
- 3. This notice may not be removed or altered from any source distribution.
192
-
193
- Zlib-Dotzlib v-u (BSL-1.0)
194
-
195
-
196
- Copyright Statements
197
-
198
- Copyright Henrik Ravn 2004
199
-
200
- License Text https://spdx.org/licenses/BSL-1.0.html
201
-
202
-
203
- Permission is hereby granted, free of charge, to any person or organization obtaining a copy of the software and accompanying documentation covered by this license (the "Software") to use, reproduce, display, distribute, execute, and transmit the Software, and to prepare derivative works of the Software, and to permit third-parties to whom the Software is furnished to do so, all subject to the following:
204
-
205
- The copyright notices in the Software and this entire statement, including the above license grant, this restriction and the following disclaimer, must be included in all copies of the Software, in whole or in part, and all derivative works of the Software, unless such copies or derivative works are solely in the form of machine-executable object code generated by a source language processor.
206
-
207
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
208
-
209
- Zlib v-u (Public Domain)
210
-
211
-
212
- Copyright Statements
213
-
214
- NA
215
-
216
- License Text
217
-
218
-
219
- Not copyrighted -- provided to the public domain
220
-
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
feature_extractor/preprocessor_config.json ADDED
@@ -0,0 +1,20 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "crop_size": 224,
3
+ "do_center_crop": true,
4
+ "do_convert_rgb": true,
5
+ "do_normalize": true,
6
+ "do_resize": true,
7
+ "feature_extractor_type": "CLIPFeatureExtractor",
8
+ "image_mean": [
9
+ 0.48145466,
10
+ 0.4578275,
11
+ 0.40821073
12
+ ],
13
+ "image_std": [
14
+ 0.26862954,
15
+ 0.26130258,
16
+ 0.27577711
17
+ ],
18
+ "resample": 3,
19
+ "size": 224
20
+ }
libs/ryzenai_onnx_utils.dll DELETED
Binary file (16.4 kB)
 
ryzen-ai-end-user-license-agreement-public.pdf DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:587c5b4916ae6053f4a2fbc0a063532bd4ff9e50080491e75cb349c84f2b97a7
3
- size 168872
 
 
 
 
safety_checker/config.json ADDED
@@ -0,0 +1,175 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "_commit_hash": "4bb648a606ef040e7685bde262611766a5fdd67b",
3
+ "_name_or_path": "CompVis/stable-diffusion-safety-checker",
4
+ "architectures": [
5
+ "StableDiffusionSafetyChecker"
6
+ ],
7
+ "initializer_factor": 1.0,
8
+ "logit_scale_init_value": 2.6592,
9
+ "model_type": "clip",
10
+ "projection_dim": 768,
11
+ "text_config": {
12
+ "_name_or_path": "",
13
+ "add_cross_attention": false,
14
+ "architectures": null,
15
+ "attention_dropout": 0.0,
16
+ "bad_words_ids": null,
17
+ "bos_token_id": 0,
18
+ "chunk_size_feed_forward": 0,
19
+ "cross_attention_hidden_size": null,
20
+ "decoder_start_token_id": null,
21
+ "diversity_penalty": 0.0,
22
+ "do_sample": false,
23
+ "dropout": 0.0,
24
+ "early_stopping": false,
25
+ "encoder_no_repeat_ngram_size": 0,
26
+ "eos_token_id": 2,
27
+ "exponential_decay_length_penalty": null,
28
+ "finetuning_task": null,
29
+ "forced_bos_token_id": null,
30
+ "forced_eos_token_id": null,
31
+ "hidden_act": "quick_gelu",
32
+ "hidden_size": 768,
33
+ "id2label": {
34
+ "0": "LABEL_0",
35
+ "1": "LABEL_1"
36
+ },
37
+ "initializer_factor": 1.0,
38
+ "initializer_range": 0.02,
39
+ "intermediate_size": 3072,
40
+ "is_decoder": false,
41
+ "is_encoder_decoder": false,
42
+ "label2id": {
43
+ "LABEL_0": 0,
44
+ "LABEL_1": 1
45
+ },
46
+ "layer_norm_eps": 1e-05,
47
+ "length_penalty": 1.0,
48
+ "max_length": 20,
49
+ "max_position_embeddings": 77,
50
+ "min_length": 0,
51
+ "model_type": "clip_text_model",
52
+ "no_repeat_ngram_size": 0,
53
+ "num_attention_heads": 12,
54
+ "num_beam_groups": 1,
55
+ "num_beams": 1,
56
+ "num_hidden_layers": 12,
57
+ "num_return_sequences": 1,
58
+ "output_attentions": false,
59
+ "output_hidden_states": false,
60
+ "output_scores": false,
61
+ "pad_token_id": 1,
62
+ "prefix": null,
63
+ "problem_type": null,
64
+ "pruned_heads": {},
65
+ "remove_invalid_values": false,
66
+ "repetition_penalty": 1.0,
67
+ "return_dict": true,
68
+ "return_dict_in_generate": false,
69
+ "sep_token_id": null,
70
+ "task_specific_params": null,
71
+ "temperature": 1.0,
72
+ "tf_legacy_loss": false,
73
+ "tie_encoder_decoder": false,
74
+ "tie_word_embeddings": true,
75
+ "tokenizer_class": null,
76
+ "top_k": 50,
77
+ "top_p": 1.0,
78
+ "torch_dtype": null,
79
+ "torchscript": false,
80
+ "transformers_version": "4.22.0.dev0",
81
+ "typical_p": 1.0,
82
+ "use_bfloat16": false,
83
+ "vocab_size": 49408
84
+ },
85
+ "text_config_dict": {
86
+ "hidden_size": 768,
87
+ "intermediate_size": 3072,
88
+ "num_attention_heads": 12,
89
+ "num_hidden_layers": 12
90
+ },
91
+ "torch_dtype": "float32",
92
+ "transformers_version": null,
93
+ "vision_config": {
94
+ "_name_or_path": "",
95
+ "add_cross_attention": false,
96
+ "architectures": null,
97
+ "attention_dropout": 0.0,
98
+ "bad_words_ids": null,
99
+ "bos_token_id": null,
100
+ "chunk_size_feed_forward": 0,
101
+ "cross_attention_hidden_size": null,
102
+ "decoder_start_token_id": null,
103
+ "diversity_penalty": 0.0,
104
+ "do_sample": false,
105
+ "dropout": 0.0,
106
+ "early_stopping": false,
107
+ "encoder_no_repeat_ngram_size": 0,
108
+ "eos_token_id": null,
109
+ "exponential_decay_length_penalty": null,
110
+ "finetuning_task": null,
111
+ "forced_bos_token_id": null,
112
+ "forced_eos_token_id": null,
113
+ "hidden_act": "quick_gelu",
114
+ "hidden_size": 1024,
115
+ "id2label": {
116
+ "0": "LABEL_0",
117
+ "1": "LABEL_1"
118
+ },
119
+ "image_size": 224,
120
+ "initializer_factor": 1.0,
121
+ "initializer_range": 0.02,
122
+ "intermediate_size": 4096,
123
+ "is_decoder": false,
124
+ "is_encoder_decoder": false,
125
+ "label2id": {
126
+ "LABEL_0": 0,
127
+ "LABEL_1": 1
128
+ },
129
+ "layer_norm_eps": 1e-05,
130
+ "length_penalty": 1.0,
131
+ "max_length": 20,
132
+ "min_length": 0,
133
+ "model_type": "clip_vision_model",
134
+ "no_repeat_ngram_size": 0,
135
+ "num_attention_heads": 16,
136
+ "num_beam_groups": 1,
137
+ "num_beams": 1,
138
+ "num_channels": 3,
139
+ "num_hidden_layers": 24,
140
+ "num_return_sequences": 1,
141
+ "output_attentions": false,
142
+ "output_hidden_states": false,
143
+ "output_scores": false,
144
+ "pad_token_id": null,
145
+ "patch_size": 14,
146
+ "prefix": null,
147
+ "problem_type": null,
148
+ "pruned_heads": {},
149
+ "remove_invalid_values": false,
150
+ "repetition_penalty": 1.0,
151
+ "return_dict": true,
152
+ "return_dict_in_generate": false,
153
+ "sep_token_id": null,
154
+ "task_specific_params": null,
155
+ "temperature": 1.0,
156
+ "tf_legacy_loss": false,
157
+ "tie_encoder_decoder": false,
158
+ "tie_word_embeddings": true,
159
+ "tokenizer_class": null,
160
+ "top_k": 50,
161
+ "top_p": 1.0,
162
+ "torch_dtype": null,
163
+ "torchscript": false,
164
+ "transformers_version": "4.22.0.dev0",
165
+ "typical_p": 1.0,
166
+ "use_bfloat16": false
167
+ },
168
+ "vision_config_dict": {
169
+ "hidden_size": 1024,
170
+ "intermediate_size": 4096,
171
+ "num_attention_heads": 16,
172
+ "num_hidden_layers": 24,
173
+ "patch_size": 14
174
+ }
175
+ }
scheduler/scheduler_config.json CHANGED
@@ -1,19 +1,13 @@
1
  {
2
  "_class_name": "PNDMScheduler",
3
- "_diffusers_version": "0.31.0",
4
  "beta_end": 0.012,
5
  "beta_schedule": "scaled_linear",
6
  "beta_start": 0.00085,
7
- "clip_sample": false,
8
- "clip_sample_range": 1.0,
9
- "dynamic_thresholding_ratio": 0.995,
10
  "num_train_timesteps": 1000,
11
- "prediction_type": "epsilon",
12
- "sample_max_value": 1.0,
13
  "set_alpha_to_one": false,
14
  "skip_prk_steps": true,
15
  "steps_offset": 1,
16
- "thresholding": false,
17
- "timestep_spacing": "leading",
18
- "trained_betas": null
19
  }
 
1
  {
2
  "_class_name": "PNDMScheduler",
3
+ "_diffusers_version": "0.6.0",
4
  "beta_end": 0.012,
5
  "beta_schedule": "scaled_linear",
6
  "beta_start": 0.00085,
 
 
 
7
  "num_train_timesteps": 1000,
 
 
8
  "set_alpha_to_one": false,
9
  "skip_prk_steps": true,
10
  "steps_offset": 1,
11
+ "trained_betas": null,
12
+ "clip_sample": false
 
13
  }
text_encoder/config.json ADDED
@@ -0,0 +1,25 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "_name_or_path": "openai/clip-vit-large-patch14",
3
+ "architectures": [
4
+ "CLIPTextModel"
5
+ ],
6
+ "attention_dropout": 0.0,
7
+ "bos_token_id": 0,
8
+ "dropout": 0.0,
9
+ "eos_token_id": 2,
10
+ "hidden_act": "quick_gelu",
11
+ "hidden_size": 768,
12
+ "initializer_factor": 1.0,
13
+ "initializer_range": 0.02,
14
+ "intermediate_size": 3072,
15
+ "layer_norm_eps": 1e-05,
16
+ "max_position_embeddings": 77,
17
+ "model_type": "clip_text_model",
18
+ "num_attention_heads": 12,
19
+ "num_hidden_layers": 12,
20
+ "pad_token_id": 1,
21
+ "projection_dim": 768,
22
+ "torch_dtype": "float32",
23
+ "transformers_version": "4.22.0.dev0",
24
+ "vocab_size": 49408
25
+ }
text_encoder/model.onnx DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:225c1b4a1421e615946d416934e86a2445693e560d550405ef0dcb7218294d54
3
- size 246473790
 
 
 
 
libs/onnx_custom_ops.dll → text_encoder/model.safetensors RENAMED
@@ -1,3 +1,3 @@
1
  version https://git-lfs.github.com/spec/v1
2
- oid sha256:4a4c644dd19883a39f07529a8f08f10dd5ed0eb1025fc2a288ffe3317bc4a494
3
- size 305880576
 
1
  version https://git-lfs.github.com/spec/v1
2
+ oid sha256:d008943c017f0092921106440254dbbe00b6a285f7883ec8ba160c3faad88334
3
+ size 492265874
tokenizer/special_tokens_map.json CHANGED
@@ -13,13 +13,7 @@
13
  "rstrip": false,
14
  "single_word": false
15
  },
16
- "pad_token": {
17
- "content": "<|endoftext|>",
18
- "lstrip": false,
19
- "normalized": true,
20
- "rstrip": false,
21
- "single_word": false
22
- },
23
  "unk_token": {
24
  "content": "<|endoftext|>",
25
  "lstrip": false,
 
13
  "rstrip": false,
14
  "single_word": false
15
  },
16
+ "pad_token": "<|endoftext|>",
 
 
 
 
 
 
17
  "unk_token": {
18
  "content": "<|endoftext|>",
19
  "lstrip": false,
tokenizer/tokenizer_config.json CHANGED
@@ -1,30 +1,34 @@
1
  {
2
  "add_prefix_space": false,
3
- "added_tokens_decoder": {
4
- "49406": {
5
- "content": "<|startoftext|>",
6
- "lstrip": false,
7
- "normalized": true,
8
- "rstrip": false,
9
- "single_word": false,
10
- "special": true
11
- },
12
- "49407": {
13
- "content": "<|endoftext|>",
14
- "lstrip": false,
15
- "normalized": true,
16
- "rstrip": false,
17
- "single_word": false,
18
- "special": true
19
- }
20
  },
21
- "bos_token": "<|startoftext|>",
22
- "clean_up_tokenization_spaces": true,
23
  "do_lower_case": true,
24
- "eos_token": "<|endoftext|>",
 
 
 
 
 
 
 
25
  "errors": "replace",
26
  "model_max_length": 77,
 
27
  "pad_token": "<|endoftext|>",
 
28
  "tokenizer_class": "CLIPTokenizer",
29
- "unk_token": "<|endoftext|>"
 
 
 
 
 
 
 
30
  }
 
1
  {
2
  "add_prefix_space": false,
3
+ "bos_token": {
4
+ "__type": "AddedToken",
5
+ "content": "<|startoftext|>",
6
+ "lstrip": false,
7
+ "normalized": true,
8
+ "rstrip": false,
9
+ "single_word": false
 
 
 
 
 
 
 
 
 
 
10
  },
 
 
11
  "do_lower_case": true,
12
+ "eos_token": {
13
+ "__type": "AddedToken",
14
+ "content": "<|endoftext|>",
15
+ "lstrip": false,
16
+ "normalized": true,
17
+ "rstrip": false,
18
+ "single_word": false
19
+ },
20
  "errors": "replace",
21
  "model_max_length": 77,
22
+ "name_or_path": "openai/clip-vit-large-patch14",
23
  "pad_token": "<|endoftext|>",
24
+ "special_tokens_map_file": "./special_tokens_map.json",
25
  "tokenizer_class": "CLIPTokenizer",
26
+ "unk_token": {
27
+ "__type": "AddedToken",
28
+ "content": "<|endoftext|>",
29
+ "lstrip": false,
30
+ "normalized": true,
31
+ "rstrip": false,
32
+ "single_word": false
33
+ }
34
  }
unet/.cache/NhwcConv_0-conv_inConv_0.const DELETED
Binary file (31 kB)
 
unet/.cache/NhwcConv_0-conv_inConv_1.const DELETED
Binary file (128 Bytes)
 
unet/.cache/NhwcConv_0-conv_inConv_10.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:f9287037a4ff616e8340c495ba5aed425a01c49ebead342c2734895c3944c976
3
- size 563200
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_100.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:7f363eda1b86f2510b5c4bbfa8e4304a4eba32883eabb34b49dfff96daf01f05
3
- size 934400
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_101.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:3fda54a817686d9eaa2057ce4ac843ce21c4cd2abab55f33692c9939d4f74c6b
3
- size 934400
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_102.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:eabd19f63008feea9cbfc76a985a5bb20c17d5157e86563375cabf3f2e6c62f3
3
- size 934400
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_103.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:dd6e802361a2f3515cd1667d6cdf4370642dbd15f90b3c2d4d9bc0810b3c0c28
3
- size 281600
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_104.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:f6b2a6024142d0c528445fbea7deb5c608bc01726272fe7bbef4a0b7a83ead0a
3
- size 281600
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_105.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:d5f0384740d1ab366abc59c6135a0d06cea3b6b0bec92341441258fe7668a98d
3
- size 281600
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_106.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:e8a66a51189e8bd5e8bf40d945cd70bafeada5d17bc8feb4b0c0180f95427fa6
3
- size 281600
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_107.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:98f64dce1ec91a0c3361deb40b171cb6394fb7e1ff035260ccafbb2982d899a0
3
- size 281600
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_108.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:c4548f8a18eef990420f7fae92e90d527d2770fd622b04f19ccfd8cc1ed5fa4f
3
- size 281600
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_109.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:2862931e79a38b0c4544e2e6bc1748b5599ca5802eae8969fe6d246811f44f00
3
- size 467200
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_11.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:3d8a4370ae222b6b427a38c106a2b4e851e61c8c2d2258c9408a7ccf0e9a2ef5
3
- size 1121280
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_110.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:33d791c02c790bb84b0459276c9760feded2a21eb5050ec4da6658c0ae87d505
3
- size 467200
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_111.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:96da6df55780f55bd4317d4cd17fb93633f153363df6bd2bb906a4e8774e6d69
3
- size 467200
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_112.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:a20154997a7e6c16103c8d13122d9b59c70428acee57c0fe1dfd15619c904739
3
- size 4311040
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_113.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:7eba2d5e4be63117ec4f8fbd51f959a50ac5a0c30a55d2c5aab62a1d121d57d0
3
- size 250880
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_114.const DELETED
Binary file (2.56 kB)
 
unet/.cache/NhwcConv_0-conv_inConv_115.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:18a7bb0c7495c962f7436fe4c252ec6aea0f0c01416098112bd42c559e8d4a9f
3
- size 501760
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_116.const DELETED
Binary file (1.28 kB)
 
unet/.cache/NhwcConv_0-conv_inConv_117.const DELETED
Binary file (1.28 kB)
 
unet/.cache/NhwcConv_0-conv_inConv_118.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:422ba5540a498cef728922c329ad5389e46a287e18c45eff619b77fbb23ae657
3
- size 471040
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_119.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:17bdf2ffecaebea1e3c02a64039eae8707e277452aedf0ad7e5da887d1afa084
3
- size 471040
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_12.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:9bda1fac569a7d1e5e4761882f3f54ef2b1115b2ce0348414bbbb809a1ff8f37
3
- size 1121280
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_120.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:fb6d65075a39b439764372629d89edb3ebf47c1e63a83998ccdf2f6aa0455ad3
3
- size 471040
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_121.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:880bcf7442c67df41afa34d7cad96a186f7ec5cdbee840a59d354cbf11945297
3
- size 473600
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_122.const DELETED
Binary file (1.28 kB)
 
unet/.cache/NhwcConv_0-conv_inConv_123.const DELETED
Binary file (1.28 kB)
 
unet/.cache/NhwcConv_0-conv_inConv_124.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:2b2e1bbb8158545a312c336d2786df561672800d201f189785c7fdb87caa2b41
3
- size 471040
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_125.const DELETED
Binary file (128 Bytes)
 
unet/.cache/NhwcConv_0-conv_inConv_126.const DELETED
Binary file (128 Bytes)
 
unet/.cache/NhwcConv_0-conv_inConv_127.const DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:815b40ccad7d537efc35775abb325a102b91c18300e93692bfc0bb8dbccd605f
3
- size 473600
 
 
 
 
unet/.cache/NhwcConv_0-conv_inConv_128.const DELETED
@@ -1 +0,0 @@
1
- �>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>r>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>|>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>|>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>{>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>~>�>u>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>p>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>S>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>�>
 
 
unet/.cache/NhwcConv_0-conv_inConv_129.const DELETED
Binary file (1.28 kB)