import{s as Et,n as wt,o as Ct}from"../chunks/scheduler.53228c21.js";import{S as Lt,i as Ot,e as i,s,c,h as It,a as d,d as n,b as r,f as M,g as p,j as u,k as v,l as t,m,n as h,t as f,o as g,p as _}from"../chunks/index.100fac89.js";import{C as Ht}from"../chunks/CopyLLMTxtMenu.20a72e0e.js";import{D}from"../chunks/Docstring.49101787.js";import{H as at,E as Vt}from"../chunks/MermaidChart.svelte_svelte_type_style_lang.4d82655d.js";function qt(ct){let x,ge,he,_e,I,ve,H,Me,V,pt='<code>EDMDPMSolverMultistepScheduler</code> is a <a href="https://huggingface.co/papers/2206.00364" rel="nofollow">Karras formulation</a> of <code>DPMSolverMultistepScheduler</code>, a multistep scheduler from <a href="https://huggingface.co/papers/2206.00927" rel="nofollow">DPM-Solver: A Fast ODE Solver for Diffusion Probabilistic Model Sampling in Around 10 Steps</a> and <a href="https://huggingface.co/papers/2211.01095" rel="nofollow">DPM-Solver++: Fast Solver for Guided Sampling of Diffusion Probabilistic Models</a> by Cheng Lu, Yuhao Zhou, Fan Bao, Jianfei Chen, Chongxuan Li, and Jun Zhu.',De,q,ut=`DPMSolver (and the improved version DPMSolver++) is a fast dedicated high-order solver for diffusion ODEs with convergence order guarantee. Empirically, DPMSolver sampling with only 20 steps can generate high-quality
samples, and it can generate quite good samples even in 10 steps.`,Se,z,xe,o,A,Ae,X,mt=`Implements DPMSolverMultistepScheduler in EDM formulation as presented in Karras et al. 2022 [1].
<code>EDMDPMSolverMultistepScheduler</code> is a fast dedicated high-order solver for diffusion ODEs.`,Ne,ee,ht=`[1] Karras, Tero, et al. “Elucidating the Design Space of Diffusion-Based Generative Models.”
<a href="https://huggingface.co/papers/2206.00364" rel="nofollow">https://huggingface.co/papers/2206.00364</a>`,ke,te,ft=`This model inherits from <a href="/docs/diffusers/main/en/api/schedulers/overview#diffusers.SchedulerMixin">SchedulerMixin</a> and <a href="/docs/diffusers/main/en/api/configuration#diffusers.ConfigMixin">ConfigMixin</a>. Check the superclass documentation for the generic
methods the library implements for all schedulers such as loading and saving.`,Fe,$,N,Ue,se,gt="Add noise to the original samples according to the noise schedule at the specified timesteps.",je,S,k,Be,re,_t=`Convert the model output to the corresponding type the DPMSolver/DPMSolver++ algorithm needs. DPM-Solver is
designed to discretize an integral of the noise prediction model, and DPM-Solver++ is designed to discretize an
integral of the data prediction model.`,Ge,F,vt=`<p>&gt; The algorithm and model type are decoupled. You can use either DPMSolver or DPMSolver++ for both
noise &gt; prediction and data prediction models.</p>`,Ke,T,U,We,oe,Mt="One step for the first-order DPMSolver (equivalent to DDIM).",Je,y,j,Ye,ne,Dt="Find the index for a given timestep in the schedule.",Ze,P,B,Qe,ie,St="One step for the second-order multistep DPMSolver.",Re,E,G,Xe,de,xt="One step for the third-order multistep DPMSolver.",et,w,K,tt,le,bt=`Ensures interchangeability with schedulers that need to scale the denoising model input depending on the
current timestep. Scales the denoising model input by <code>(sigma**2 + 1) ** 0.5</code> to match the Euler algorithm.`,st,C,W,rt,ae,$t="Sets the begin index for the scheduler. This function should be run from pipeline before the inference.",ot,L,J,nt,ce,Tt="Sets the discrete timesteps used for the diffusion chain (to be run before inference).",it,O,Y,dt,pe,yt=`Predict the sample from the previous timestep by reversing the SDE. This function propagates the sample with
the multistep DPMSolver.`,be,Z,$e,b,Q,lt,ue,Pt="Base class for the output of a scheduler’s <code>step</code> function.",Te,R,ye,fe,Pe;return I=new Ht({props:{containerStyle:"float: right; margin-left: 10px; display: inline-flex; position: relative; z-index: 10;"}}),H=new at({props:{title:"EDMDPMSolverMultistepScheduler",local:"edmdpmsolvermultistepscheduler",headingTag:"h1"}}),z=new at({props:{title:"EDMDPMSolverMultistepScheduler",local:"diffusers.EDMDPMSolverMultistepScheduler",headingTag:"h2"}}),A=new D({props:{name:"class diffusers.EDMDPMSolverMultistepScheduler",anchor:"diffusers.EDMDPMSolverMultistepScheduler",parameters:[{name:"sigma_min",val:": float = 0.002"},{name:"sigma_max",val:": float = 80.0"},{name:"sigma_data",val:": float = 0.5"},{name:"sigma_schedule",val:": str = 'karras'"},{name:"num_train_timesteps",val:": int = 1000"},{name:"prediction_type",val:": str = 'epsilon'"},{name:"rho",val:": float = 7.0"},{name:"solver_order",val:": int = 2"},{name:"thresholding",val:": bool = False"},{name:"dynamic_thresholding_ratio",val:": float = 0.995"},{name:"sample_max_value",val:": float = 1.0"},{name:"algorithm_type",val:": str = 'dpmsolver++'"},{name:"solver_type",val:": str = 'midpoint'"},{name:"lower_order_final",val:": bool = True"},{name:"euler_at_final",val:": bool = False"},{name:"final_sigmas_type",val:": typing.Optional[str] = 'zero'"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.sigma_min",description:`<strong>sigma_min</strong> (<code>float</code>, <em>optional</em>, defaults to 0.002) &#x2014;
Minimum noise magnitude in the sigma schedule. This was set to 0.002 in the EDM paper [1]; a reasonable
range is [0, 10].`,name:"sigma_min"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.sigma_max",description:`<strong>sigma_max</strong> (<code>float</code>, <em>optional</em>, defaults to 80.0) &#x2014;
Maximum noise magnitude in the sigma schedule. This was set to 80.0 in the EDM paper [1]; a reasonable
range is [0.2, 80.0].`,name:"sigma_max"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.sigma_data",description:`<strong>sigma_data</strong> (<code>float</code>, <em>optional</em>, defaults to 0.5) &#x2014;
The standard deviation of the data distribution. This is set to 0.5 in the EDM paper [1].`,name:"sigma_data"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.sigma_schedule",description:`<strong>sigma_schedule</strong> (<code>str</code>, <em>optional</em>, defaults to <code>karras</code>) &#x2014;
Sigma schedule to compute the <code>sigmas</code>. By default, we the schedule introduced in the EDM paper
(<a href="https://huggingface.co/papers/2206.00364" rel="nofollow">https://huggingface.co/papers/2206.00364</a>). Other acceptable value is &#x201C;exponential&#x201D;. The exponential
schedule was incorporated in this model: <a href="https://huggingface.co/stabilityai/cosxl" rel="nofollow">https://huggingface.co/stabilityai/cosxl</a>.`,name:"sigma_schedule"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.num_train_timesteps",description:`<strong>num_train_timesteps</strong> (<code>int</code>, defaults to 1000) &#x2014;
The number of diffusion steps to train the model.`,name:"num_train_timesteps"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.solver_order",description:`<strong>solver_order</strong> (<code>int</code>, defaults to 2) &#x2014;
The DPMSolver order which can be <code>1</code> or <code>2</code> or <code>3</code>. It is recommended to use <code>solver_order=2</code> for guided
sampling, and <code>solver_order=3</code> for unconditional sampling.`,name:"solver_order"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.prediction_type",description:`<strong>prediction_type</strong> (<code>str</code>, defaults to <code>epsilon</code>, <em>optional</em>) &#x2014;
Prediction type of the scheduler function; can be <code>epsilon</code> (predicts the noise of the diffusion process),
<code>sample</code> (directly predicts the noisy sample<code>) or </code>v_prediction\` (see section 2.4 of <a href="https://huggingface.co/papers/2210.02303" rel="nofollow">Imagen
Video</a> paper).`,name:"prediction_type"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.thresholding",description:`<strong>thresholding</strong> (<code>bool</code>, defaults to <code>False</code>) &#x2014;
Whether to use the &#x201C;dynamic thresholding&#x201D; method. This is unsuitable for latent-space diffusion models such
as Stable Diffusion.`,name:"thresholding"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.dynamic_thresholding_ratio",description:`<strong>dynamic_thresholding_ratio</strong> (<code>float</code>, defaults to 0.995) &#x2014;
The ratio for the dynamic thresholding method. Valid only when <code>thresholding=True</code>.`,name:"dynamic_thresholding_ratio"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.sample_max_value",description:`<strong>sample_max_value</strong> (<code>float</code>, defaults to 1.0) &#x2014;
The threshold value for dynamic thresholding. Valid only when <code>thresholding=True</code> and
<code>algorithm_type=&quot;dpmsolver++&quot;</code>.`,name:"sample_max_value"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.algorithm_type",description:`<strong>algorithm_type</strong> (<code>str</code>, defaults to <code>dpmsolver++</code>) &#x2014;
Algorithm type for the solver; can be <code>dpmsolver++</code> or <code>sde-dpmsolver++</code>. The <code>dpmsolver++</code> type implements
the algorithms in the <a href="https://huggingface.co/papers/2211.01095" rel="nofollow">DPMSolver++</a> paper. It is recommended to
use <code>dpmsolver++</code> or <code>sde-dpmsolver++</code> with <code>solver_order=2</code> for guided sampling like in Stable Diffusion.`,name:"algorithm_type"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.solver_type",description:`<strong>solver_type</strong> (<code>str</code>, defaults to <code>midpoint</code>) &#x2014;
Solver type for the second-order solver; can be <code>midpoint</code> or <code>heun</code>. The solver type slightly affects the
sample quality, especially for a small number of steps. It is recommended to use <code>midpoint</code> solvers.`,name:"solver_type"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.lower_order_final",description:`<strong>lower_order_final</strong> (<code>bool</code>, defaults to <code>True</code>) &#x2014;
Whether to use lower-order solvers in the final steps. Only valid for &lt; 15 inference steps. This can
stabilize the sampling of DPMSolver for steps &lt; 15, especially for steps &lt;= 10.`,name:"lower_order_final"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.euler_at_final",description:`<strong>euler_at_final</strong> (<code>bool</code>, defaults to <code>False</code>) &#x2014;
Whether to use Euler&#x2019;s method in the final step. It is a trade-off between numerical stability and detail
richness. This can stabilize the sampling of the SDE variant of DPMSolver for small number of inference
steps, but sometimes may result in blurring.`,name:"euler_at_final"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.final_sigmas_type",description:`<strong>final_sigmas_type</strong> (<code>str</code>, defaults to <code>&quot;zero&quot;</code>) &#x2014;
The final <code>sigma</code> value for the noise schedule during the sampling process. If <code>&quot;sigma_min&quot;</code>, the final
sigma is the same as the last sigma in the training schedule. If <code>zero</code>, the final sigma is set to 0.`,name:"final_sigmas_type"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L28"}}),N=new D({props:{name:"add_noise",anchor:"diffusers.EDMDPMSolverMultistepScheduler.add_noise",parameters:[{name:"original_samples",val:": Tensor"},{name:"noise",val:": Tensor"},{name:"timesteps",val:": Tensor"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.add_noise.original_samples",description:`<strong>original_samples</strong> (<code>torch.Tensor</code>) &#x2014;
The original samples to which noise will be added.`,name:"original_samples"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.add_noise.noise",description:`<strong>noise</strong> (<code>torch.Tensor</code>) &#x2014;
The noise tensor to add to the original samples.`,name:"noise"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.add_noise.timesteps",description:`<strong>timesteps</strong> (<code>torch.Tensor</code>) &#x2014;
The timesteps at which to add noise, determining the noise level from the schedule.`,name:"timesteps"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L711",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>The noisy samples with added noise scaled according to the timestep schedule.</p>
`,returnType:`<script context="module">export const metadata = 'undefined';<\/script>


<p><code>torch.Tensor</code></p>
`}}),k=new D({props:{name:"convert_model_output",anchor:"diffusers.EDMDPMSolverMultistepScheduler.convert_model_output",parameters:[{name:"model_output",val:": Tensor"},{name:"sample",val:": Tensor = None"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.convert_model_output.model_output",description:`<strong>model_output</strong> (<code>torch.Tensor</code>) &#x2014;
The direct output from the learned diffusion model.`,name:"model_output"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.convert_model_output.sample",description:`<strong>sample</strong> (<code>torch.Tensor</code>) &#x2014;
A current instance of a sample created by the diffusion process.`,name:"sample"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L386",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>The converted model output.</p>
`,returnType:`<script context="module">export const metadata = 'undefined';<\/script>


<p><code>torch.Tensor</code></p>
`}}),U=new D({props:{name:"dpm_solver_first_order_update",anchor:"diffusers.EDMDPMSolverMultistepScheduler.dpm_solver_first_order_update",parameters:[{name:"model_output",val:": Tensor"},{name:"sample",val:": Tensor = None"},{name:"noise",val:": typing.Optional[torch.Tensor] = None"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.dpm_solver_first_order_update.model_output",description:`<strong>model_output</strong> (<code>torch.Tensor</code>) &#x2014;
The direct output from the learned diffusion model.`,name:"model_output"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.dpm_solver_first_order_update.sample",description:`<strong>sample</strong> (<code>torch.Tensor</code>) &#x2014;
A current instance of a sample created by the diffusion process.`,name:"sample"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L417",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>The sample tensor at the previous timestep.</p>
`,returnType:`<script context="module">export const metadata = 'undefined';<\/script>


<p><code>torch.Tensor</code></p>
`}}),j=new D({props:{name:"index_for_timestep",anchor:"diffusers.EDMDPMSolverMultistepScheduler.index_for_timestep",parameters:[{name:"timestep",val:": typing.Union[int, torch.Tensor]"},{name:"schedule_timesteps",val:": typing.Optional[torch.Tensor] = None"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.index_for_timestep.timestep",description:`<strong>timestep</strong> (<code>int</code> or <code>torch.Tensor</code>) &#x2014;
The timestep for which to find the index.`,name:"timestep"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.index_for_timestep.schedule_timesteps",description:`<strong>schedule_timesteps</strong> (<code>torch.Tensor</code>, <em>optional</em>) &#x2014;
The timestep schedule to search in. If <code>None</code>, uses <code>self.timesteps</code>.`,name:"schedule_timesteps"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L581",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>The index of the timestep in the schedule.</p>
`,returnType:`<script context="module">export const metadata = 'undefined';<\/script>


<p><code>int</code></p>
`}}),B=new D({props:{name:"multistep_dpm_solver_second_order_update",anchor:"diffusers.EDMDPMSolverMultistepScheduler.multistep_dpm_solver_second_order_update",parameters:[{name:"model_output_list",val:": typing.List[torch.Tensor]"},{name:"sample",val:": Tensor = None"},{name:"noise",val:": typing.Optional[torch.Tensor] = None"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.multistep_dpm_solver_second_order_update.model_output_list",description:`<strong>model_output_list</strong> (<code>List[torch.Tensor]</code>) &#x2014;
The direct outputs from learned diffusion model at current and latter timesteps.`,name:"model_output_list"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.multistep_dpm_solver_second_order_update.sample",description:`<strong>sample</strong> (<code>torch.Tensor</code>) &#x2014;
A current instance of a sample created by the diffusion process.`,name:"sample"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L455",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>The sample tensor at the previous timestep.</p>
`,returnType:`<script context="module">export const metadata = 'undefined';<\/script>


<p><code>torch.Tensor</code></p>
`}}),G=new D({props:{name:"multistep_dpm_solver_third_order_update",anchor:"diffusers.EDMDPMSolverMultistepScheduler.multistep_dpm_solver_third_order_update",parameters:[{name:"model_output_list",val:": typing.List[torch.Tensor]"},{name:"sample",val:": Tensor = None"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.multistep_dpm_solver_third_order_update.model_output_list",description:`<strong>model_output_list</strong> (<code>List[torch.Tensor]</code>) &#x2014;
The direct outputs from learned diffusion model at current and latter timesteps.`,name:"model_output_list"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.multistep_dpm_solver_third_order_update.sample",description:`<strong>sample</strong> (<code>torch.Tensor</code>) &#x2014;
A current instance of a sample created by diffusion process.`,name:"sample"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L526",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>The sample tensor at the previous timestep.</p>
`,returnType:`<script context="module">export const metadata = 'undefined';<\/script>


<p><code>torch.Tensor</code></p>
`}}),K=new D({props:{name:"scale_model_input",anchor:"diffusers.EDMDPMSolverMultistepScheduler.scale_model_input",parameters:[{name:"sample",val:": Tensor"},{name:"timestep",val:": typing.Union[float, torch.Tensor]"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.scale_model_input.sample",description:`<strong>sample</strong> (<code>torch.Tensor</code>) &#x2014;
The input sample.`,name:"sample"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.scale_model_input.timestep",description:`<strong>timestep</strong> (<code>int</code>, <em>optional</em>) &#x2014;
The current timestep in the diffusion chain.`,name:"timestep"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L209",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>A scaled input sample.</p>
`,returnType:`<script context="module">export const metadata = 'undefined';<\/script>


<p><code>torch.Tensor</code></p>
`}}),W=new D({props:{name:"set_begin_index",anchor:"diffusers.EDMDPMSolverMultistepScheduler.set_begin_index",parameters:[{name:"begin_index",val:": int = 0"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.set_begin_index.begin_index",description:`<strong>begin_index</strong> (<code>int</code>, defaults to <code>0</code>) &#x2014;
The begin index for the scheduler.`,name:"begin_index"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L167"}}),J=new D({props:{name:"set_timesteps",anchor:"diffusers.EDMDPMSolverMultistepScheduler.set_timesteps",parameters:[{name:"num_inference_steps",val:": int = None"},{name:"device",val:": typing.Union[str, torch.device] = None"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.set_timesteps.num_inference_steps",description:`<strong>num_inference_steps</strong> (<code>int</code>) &#x2014;
The number of diffusion steps used when generating samples with a pre-trained model.`,name:"num_inference_steps"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.set_timesteps.device",description:`<strong>device</strong> (<code>str</code> or <code>torch.device</code>, <em>optional</em>) &#x2014;
The device to which the timesteps should be moved to. If <code>None</code>, the timesteps are not moved.`,name:"device"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L233"}}),Y=new D({props:{name:"step",anchor:"diffusers.EDMDPMSolverMultistepScheduler.step",parameters:[{name:"model_output",val:": Tensor"},{name:"timestep",val:": typing.Union[int, torch.Tensor]"},{name:"sample",val:": Tensor"},{name:"generator",val:" = None"},{name:"return_dict",val:": bool = True"}],parametersDescription:[{anchor:"diffusers.EDMDPMSolverMultistepScheduler.step.model_output",description:`<strong>model_output</strong> (<code>torch.Tensor</code>) &#x2014;
The direct output from learned diffusion model.`,name:"model_output"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.step.timestep",description:`<strong>timestep</strong> (<code>int</code>) &#x2014;
The current discrete timestep in the diffusion chain.`,name:"timestep"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.step.sample",description:`<strong>sample</strong> (<code>torch.Tensor</code>) &#x2014;
A current instance of a sample created by the diffusion process.`,name:"sample"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.step.generator",description:`<strong>generator</strong> (<code>torch.Generator</code>, <em>optional</em>) &#x2014;
A random number generator.`,name:"generator"},{anchor:"diffusers.EDMDPMSolverMultistepScheduler.step.return_dict",description:`<strong>return_dict</strong> (<code>bool</code>) &#x2014;
Whether or not to return a <a href="/docs/diffusers/main/en/api/schedulers/pndm#diffusers.schedulers.scheduling_utils.SchedulerOutput">SchedulerOutput</a> or <code>tuple</code>.`,name:"return_dict"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_edm_dpmsolver_multistep.py#L632",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


<p>If return_dict is <code>True</code>, <a
  href="/docs/diffusers/main/en/api/schedulers/pndm#diffusers.schedulers.scheduling_utils.SchedulerOutput"
>SchedulerOutput</a> is returned, otherwise a
tuple is returned where the first element is the sample tensor.</p>
`,returnType:`<script context="module">export const metadata = 'undefined';<\/script>


<p><a
  href="/docs/diffusers/main/en/api/schedulers/pndm#diffusers.schedulers.scheduling_utils.SchedulerOutput"
>SchedulerOutput</a> or <code>tuple</code></p>
`}}),Z=new at({props:{title:"SchedulerOutput",local:"diffusers.schedulers.scheduling_utils.SchedulerOutput",headingTag:"h2"}}),Q=new D({props:{name:"class diffusers.schedulers.scheduling_utils.SchedulerOutput",anchor:"diffusers.schedulers.scheduling_utils.SchedulerOutput",parameters:[{name:"prev_sample",val:": Tensor"}],parametersDescription:[{anchor:"diffusers.schedulers.scheduling_utils.SchedulerOutput.prev_sample",description:`<strong>prev_sample</strong> (<code>torch.Tensor</code> of shape <code>(batch_size, num_channels, height, width)</code> for images) &#x2014;
Computed sample <code>(x_{t-1})</code> of previous timestep. <code>prev_sample</code> should be used as next model input in the
denoising loop.`,name:"prev_sample"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_utils.py#L62"}}),R=new Vt({props:{source:"https://github.com/huggingface/diffusers/blob/main/docs/source/en/api/schedulers/edm_multistep_dpm_solver.md"}}),{c(){x=i("meta"),ge=s(),he=i("p"),_e=s(),c(I.$$.fragment),ve=s(),c(H.$$.fragment),Me=s(),V=i("p"),V.innerHTML=pt,De=s(),q=i("p"),q.textContent=ut,Se=s(),c(z.$$.fragment),xe=s(),o=i("div"),c(A.$$.fragment),Ae=s(),X=i("p"),X.innerHTML=mt,Ne=s(),ee=i("p"),ee.innerHTML=ht,ke=s(),te=i("p"),te.innerHTML=ft,Fe=s(),$=i("div"),c(N.$$.fragment),Ue=s(),se=i("p"),se.textContent=gt,je=s(),S=i("div"),c(k.$$.fragment),Be=s(),re=i("p"),re.textContent=_t,Ge=s(),F=i("blockquote"),F.innerHTML=vt,Ke=s(),T=i("div"),c(U.$$.fragment),We=s(),oe=i("p"),oe.textContent=Mt,Je=s(),y=i("div"),c(j.$$.fragment),Ye=s(),ne=i("p"),ne.textContent=Dt,Ze=s(),P=i("div"),c(B.$$.fragment),Qe=s(),ie=i("p"),ie.textContent=St,Re=s(),E=i("div"),c(G.$$.fragment),Xe=s(),de=i("p"),de.textContent=xt,et=s(),w=i("div"),c(K.$$.fragment),tt=s(),le=i("p"),le.innerHTML=bt,st=s(),C=i("div"),c(W.$$.fragment),rt=s(),ae=i("p"),ae.textContent=$t,ot=s(),L=i("div"),c(J.$$.fragment),nt=s(),ce=i("p"),ce.textContent=Tt,it=s(),O=i("div"),c(Y.$$.fragment),dt=s(),pe=i("p"),pe.textContent=yt,be=s(),c(Z.$$.fragment),$e=s(),b=i("div"),c(Q.$$.fragment),lt=s(),ue=i("p"),ue.innerHTML=Pt,Te=s(),c(R.$$.fragment),ye=s(),fe=i("p"),this.h()},l(e){const a=It("svelte-u9bgzb",document.head);x=d(a,"META",{name:!0,content:!0}),a.forEach(n),ge=r(e),he=d(e,"P",{}),M(he).forEach(n),_e=r(e),p(I.$$.fragment,e),ve=r(e),p(H.$$.fragment,e),Me=r(e),V=d(e,"P",{"data-svelte-h":!0}),u(V)!=="svelte-1ak0e1h"&&(V.innerHTML=pt),De=r(e),q=d(e,"P",{"data-svelte-h":!0}),u(q)!=="svelte-l6rv24"&&(q.textContent=ut),Se=r(e),p(z.$$.fragment,e),xe=r(e),o=d(e,"DIV",{class:!0});var l=M(o);p(A.$$.fragment,l),Ae=r(l),X=d(l,"P",{"data-svelte-h":!0}),u(X)!=="svelte-5b1txv"&&(X.innerHTML=mt),Ne=r(l),ee=d(l,"P",{"data-svelte-h":!0}),u(ee)!=="svelte-bibwfr"&&(ee.innerHTML=ht),ke=r(l),te=d(l,"P",{"data-svelte-h":!0}),u(te)!=="svelte-linuuh"&&(te.innerHTML=ft),Fe=r(l),$=d(l,"DIV",{class:!0});var Ee=M($);p(N.$$.fragment,Ee),Ue=r(Ee),se=d(Ee,"P",{"data-svelte-h":!0}),u(se)!=="svelte-rz9b5o"&&(se.textContent=gt),Ee.forEach(n),je=r(l),S=d(l,"DIV",{class:!0});var me=M(S);p(k.$$.fragment,me),Be=r(me),re=d(me,"P",{"data-svelte-h":!0}),u(re)!=="svelte-1st02i8"&&(re.textContent=_t),Ge=r(me),F=d(me,"BLOCKQUOTE",{class:!0,"data-svelte-h":!0}),u(F)!=="svelte-lwd2ft"&&(F.innerHTML=vt),me.forEach(n),Ke=r(l),T=d(l,"DIV",{class:!0});var we=M(T);p(U.$$.fragment,we),We=r(we),oe=d(we,"P",{"data-svelte-h":!0}),u(oe)!=="svelte-4nw43d"&&(oe.textContent=Mt),we.forEach(n),Je=r(l),y=d(l,"DIV",{class:!0});var Ce=M(y);p(j.$$.fragment,Ce),Ye=r(Ce),ne=d(Ce,"P",{"data-svelte-h":!0}),u(ne)!=="svelte-1c8f4j7"&&(ne.textContent=Dt),Ce.forEach(n),Ze=r(l),P=d(l,"DIV",{class:!0});var Le=M(P);p(B.$$.fragment,Le),Qe=r(Le),ie=d(Le,"P",{"data-svelte-h":!0}),u(ie)!=="svelte-1d6o6zu"&&(ie.textContent=St),Le.forEach(n),Re=r(l),E=d(l,"DIV",{class:!0});var Oe=M(E);p(G.$$.fragment,Oe),Xe=r(Oe),de=d(Oe,"P",{"data-svelte-h":!0}),u(de)!=="svelte-17nne8p"&&(de.textContent=xt),Oe.forEach(n),et=r(l),w=d(l,"DIV",{class:!0});var Ie=M(w);p(K.$$.fragment,Ie),tt=r(Ie),le=d(Ie,"P",{"data-svelte-h":!0}),u(le)!=="svelte-1hew89w"&&(le.innerHTML=bt),Ie.forEach(n),st=r(l),C=d(l,"DIV",{class:!0});var He=M(C);p(W.$$.fragment,He),rt=r(He),ae=d(He,"P",{"data-svelte-h":!0}),u(ae)!=="svelte-1k141rk"&&(ae.textContent=$t),He.forEach(n),ot=r(l),L=d(l,"DIV",{class:!0});var Ve=M(L);p(J.$$.fragment,Ve),nt=r(Ve),ce=d(Ve,"P",{"data-svelte-h":!0}),u(ce)!=="svelte-1vzm9q"&&(ce.textContent=Tt),Ve.forEach(n),it=r(l),O=d(l,"DIV",{class:!0});var qe=M(O);p(Y.$$.fragment,qe),dt=r(qe),pe=d(qe,"P",{"data-svelte-h":!0}),u(pe)!=="svelte-7jbjgx"&&(pe.textContent=yt),qe.forEach(n),l.forEach(n),be=r(e),p(Z.$$.fragment,e),$e=r(e),b=d(e,"DIV",{class:!0});var ze=M(b);p(Q.$$.fragment,ze),lt=r(ze),ue=d(ze,"P",{"data-svelte-h":!0}),u(ue)!=="svelte-6ojmkw"&&(ue.innerHTML=Pt),ze.forEach(n),Te=r(e),p(R.$$.fragment,e),ye=r(e),fe=d(e,"P",{}),M(fe).forEach(n),this.h()},h(){v(x,"name","hf:doc:metadata"),v(x,"content",zt),v($,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(F,"class","tip"),v(S,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(T,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(y,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(P,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(E,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(w,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(C,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(L,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(O,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(o,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),v(b,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8")},m(e,a){t(document.head,x),m(e,ge,a),m(e,he,a),m(e,_e,a),h(I,e,a),m(e,ve,a),h(H,e,a),m(e,Me,a),m(e,V,a),m(e,De,a),m(e,q,a),m(e,Se,a),h(z,e,a),m(e,xe,a),m(e,o,a),h(A,o,null),t(o,Ae),t(o,X),t(o,Ne),t(o,ee),t(o,ke),t(o,te),t(o,Fe),t(o,$),h(N,$,null),t($,Ue),t($,se),t(o,je),t(o,S),h(k,S,null),t(S,Be),t(S,re),t(S,Ge),t(S,F),t(o,Ke),t(o,T),h(U,T,null),t(T,We),t(T,oe),t(o,Je),t(o,y),h(j,y,null),t(y,Ye),t(y,ne),t(o,Ze),t(o,P),h(B,P,null),t(P,Qe),t(P,ie),t(o,Re),t(o,E),h(G,E,null),t(E,Xe),t(E,de),t(o,et),t(o,w),h(K,w,null),t(w,tt),t(w,le),t(o,st),t(o,C),h(W,C,null),t(C,rt),t(C,ae),t(o,ot),t(o,L),h(J,L,null),t(L,nt),t(L,ce),t(o,it),t(o,O),h(Y,O,null),t(O,dt),t(O,pe),m(e,be,a),h(Z,e,a),m(e,$e,a),m(e,b,a),h(Q,b,null),t(b,lt),t(b,ue),m(e,Te,a),h(R,e,a),m(e,ye,a),m(e,fe,a),Pe=!0},p:wt,i(e){Pe||(f(I.$$.fragment,e),f(H.$$.fragment,e),f(z.$$.fragment,e),f(A.$$.fragment,e),f(N.$$.fragment,e),f(k.$$.fragment,e),f(U.$$.fragment,e),f(j.$$.fragment,e),f(B.$$.fragment,e),f(G.$$.fragment,e),f(K.$$.fragment,e),f(W.$$.fragment,e),f(J.$$.fragment,e),f(Y.$$.fragment,e),f(Z.$$.fragment,e),f(Q.$$.fragment,e),f(R.$$.fragment,e),Pe=!0)},o(e){g(I.$$.fragment,e),g(H.$$.fragment,e),g(z.$$.fragment,e),g(A.$$.fragment,e),g(N.$$.fragment,e),g(k.$$.fragment,e),g(U.$$.fragment,e),g(j.$$.fragment,e),g(B.$$.fragment,e),g(G.$$.fragment,e),g(K.$$.fragment,e),g(W.$$.fragment,e),g(J.$$.fragment,e),g(Y.$$.fragment,e),g(Z.$$.fragment,e),g(Q.$$.fragment,e),g(R.$$.fragment,e),Pe=!1},d(e){e&&(n(ge),n(he),n(_e),n(ve),n(Me),n(V),n(De),n(q),n(Se),n(xe),n(o),n(be),n($e),n(b),n(Te),n(ye),n(fe)),n(x),_(I,e),_(H,e),_(z,e),_(A),_(N),_(k),_(U),_(j),_(B),_(G),_(K),_(W),_(J),_(Y),_(Z,e),_(Q),_(R,e)}}}const zt='{"title":"EDMDPMSolverMultistepScheduler","local":"edmdpmsolvermultistepscheduler","sections":[{"title":"EDMDPMSolverMultistepScheduler","local":"diffusers.EDMDPMSolverMultistepScheduler","sections":[],"depth":2},{"title":"SchedulerOutput","local":"diffusers.schedulers.scheduling_utils.SchedulerOutput","sections":[],"depth":2}],"depth":1}';function At(ct){return Ct(()=>{new URLSearchParams(window.location.search).get("fw")}),[]}class Bt extends Lt{constructor(x){super(),Ot(this,x,At,qt,Et,{})}}export{Bt as component};
