import{S as ar,i as dr,s as cr,e as s,k as c,w as f,t as i,M as lr,c as o,d as r,m as l,a as n,x as g,h as a,b as d,G as e,g as h,y as v,L as ur,q as _,o as S,B as b,v as pr}from"../../../chunks/vendor-hf-doc-builder.js";import{D as Q}from"../../../chunks/Docstring-hf-doc-builder.js";import{I as Nt}from"../../../chunks/IconCopyLink-hf-doc-builder.js";function mr(qt){let w,we,$,k,oe,q,Be,ne,Ge,$e,y,ie,ze,Ke,M,He,Je,ye,X,Re,Ee,L,ae,je,Ue,Ve,E,O,de,W,Ye,ce,Qe,xe,u,B,Xe,Z,le,Ze,et,tt,V,rt,ee,st,ot,te,nt,it,at,C,G,dt,ue,ct,lt,P,z,ut,x,pt,pe,mt,ht,me,ft,gt,vt,I,K,_t,he,St,bt,A,H,wt,J,$t,fe,yt,Et,Vt,F,R,xt,ge,Dt,De,D,N,ve,j,Tt,_e,kt,Te,T,U,Ot,Y,Ct,Se,Pt,It,ke;return q=new Nt({}),W=new Nt({}),B=new Q({props:{name:"class diffusers.ScoreSdeVeScheduler",anchor:"diffusers.ScoreSdeVeScheduler",parameters:[{name:"num_train_timesteps",val:": int = 2000"},{name:"snr",val:": float = 0.15"},{name:"sigma_min",val:": float = 0.01"},{name:"sigma_max",val:": float = 1348.0"},{name:"sampling_eps",val:": float = 1e-05"},{name:"correct_steps",val:": int = 1"}],parametersDescription:[{anchor:"diffusers.ScoreSdeVeScheduler.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.ScoreSdeVeScheduler.snr",description:`<strong>snr</strong> (<code>float</code>, defaults to 0.15) &#x2014;
A coefficient weighting the step from the <code>model_output</code> sample (from the network) to the random noise.`,name:"snr"},{anchor:"diffusers.ScoreSdeVeScheduler.sigma_min",description:`<strong>sigma_min</strong> (<code>float</code>, defaults to 0.01) &#x2014;
The initial noise scale for the sigma sequence in the sampling procedure. The minimum sigma should mirror
the distribution of the data.`,name:"sigma_min"},{anchor:"diffusers.ScoreSdeVeScheduler.sigma_max",description:`<strong>sigma_max</strong> (<code>float</code>, defaults to 1348.0) &#x2014;
The maximum value used for the range of continuous timesteps passed into the model.`,name:"sigma_max"},{anchor:"diffusers.ScoreSdeVeScheduler.sampling_eps",description:`<strong>sampling_eps</strong> (<code>float</code>, defaults to 1e-5) &#x2014;
The end value of sampling where timesteps decrease progressively from 1 to epsilon.`,name:"sampling_eps"},{anchor:"diffusers.ScoreSdeVeScheduler.correct_steps",description:`<strong>correct_steps</strong> (<code>int</code>, defaults to 1) &#x2014;
The number of correction steps performed on a produced sample.`,name:"correct_steps"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_sde_ve.py#L45"}}),G=new Q({props:{name:"scale_model_input",anchor:"diffusers.ScoreSdeVeScheduler.scale_model_input",parameters:[{name:"sample",val:": FloatTensor"},{name:"timestep",val:": typing.Optional[int] = None"}],parametersDescription:[{anchor:"diffusers.ScoreSdeVeScheduler.scale_model_input.sample",description:`<strong>sample</strong> (<code>torch.FloatTensor</code>) &#x2014;
The input sample.`,name:"sample"},{anchor:"diffusers.ScoreSdeVeScheduler.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_sde_ve.py#L88",returnDescription:`
<p>A scaled input sample.</p>
`,returnType:`
<p><code>torch.FloatTensor</code></p>
`}}),z=new Q({props:{name:"set_sigmas",anchor:"diffusers.ScoreSdeVeScheduler.set_sigmas",parameters:[{name:"num_inference_steps",val:": int"},{name:"sigma_min",val:": float = None"},{name:"sigma_max",val:": float = None"},{name:"sampling_eps",val:": float = None"}],parametersDescription:[{anchor:"diffusers.ScoreSdeVeScheduler.set_sigmas.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.ScoreSdeVeScheduler.set_sigmas.sigma_min",description:`<strong>sigma_min</strong> (<code>float</code>, optional) &#x2014;
The initial noise scale value (overrides value given during scheduler instantiation).`,name:"sigma_min"},{anchor:"diffusers.ScoreSdeVeScheduler.set_sigmas.sigma_max",description:`<strong>sigma_max</strong> (<code>float</code>, optional) &#x2014;
The final noise scale value (overrides value given during scheduler instantiation).`,name:"sigma_max"},{anchor:"diffusers.ScoreSdeVeScheduler.set_sigmas.sampling_eps",description:`<strong>sampling_eps</strong> (<code>float</code>, optional) &#x2014;
The final timestep value (overrides value given during scheduler instantiation).`,name:"sampling_eps"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_sde_ve.py#L124"}}),K=new Q({props:{name:"set_timesteps",anchor:"diffusers.ScoreSdeVeScheduler.set_timesteps",parameters:[{name:"num_inference_steps",val:": int"},{name:"sampling_eps",val:": float = None"},{name:"device",val:": typing.Union[str, torch.device] = None"}],parametersDescription:[{anchor:"diffusers.ScoreSdeVeScheduler.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.ScoreSdeVeScheduler.set_timesteps.sampling_eps",description:`<strong>sampling_eps</strong> (<code>float</code>, <em>optional</em>) &#x2014;
The final timestep value (overrides value given during scheduler instantiation).`,name:"sampling_eps"},{anchor:"diffusers.ScoreSdeVeScheduler.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_sde_ve.py#L105"}}),H=new Q({props:{name:"step_correct",anchor:"diffusers.ScoreSdeVeScheduler.step_correct",parameters:[{name:"model_output",val:": FloatTensor"},{name:"sample",val:": FloatTensor"},{name:"generator",val:": typing.Optional[torch._C.Generator] = None"},{name:"return_dict",val:": bool = True"}],parametersDescription:[{anchor:"diffusers.ScoreSdeVeScheduler.step_correct.model_output",description:`<strong>model_output</strong> (<code>torch.FloatTensor</code>) &#x2014;
The direct output from learned diffusion model.`,name:"model_output"},{anchor:"diffusers.ScoreSdeVeScheduler.step_correct.sample",description:`<strong>sample</strong> (<code>torch.FloatTensor</code>) &#x2014;
A current instance of a sample created by the diffusion process.`,name:"sample"},{anchor:"diffusers.ScoreSdeVeScheduler.step_correct.generator",description:`<strong>generator</strong> (<code>torch.Generator</code>, <em>optional</em>) &#x2014;
A random number generator.`,name:"generator"},{anchor:"diffusers.ScoreSdeVeScheduler.step_correct.return_dict",description:`<strong>return_dict</strong> (<code>bool</code>, <em>optional</em>, defaults to <code>True</code>) &#x2014;
Whether or not to return a <a href="/docs/diffusers/main/en/api/schedulers/score_sde_ve#diffusers.schedulers.scheduling_sde_ve.SdeVeOutput">SdeVeOutput</a> or <code>tuple</code>.`,name:"return_dict"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_sde_ve.py#L227",returnDescription:`
<p>If return_dict is <code>True</code>, <a
  href="/docs/diffusers/main/en/api/schedulers/score_sde_ve#diffusers.schedulers.scheduling_sde_ve.SdeVeOutput"
>SdeVeOutput</a> is returned, otherwise a tuple
is returned where the first element is the sample tensor.</p>
`,returnType:`
<p><a
  href="/docs/diffusers/main/en/api/schedulers/score_sde_ve#diffusers.schedulers.scheduling_sde_ve.SdeVeOutput"
>SdeVeOutput</a> or <code>tuple</code></p>
`}}),R=new Q({props:{name:"step_pred",anchor:"diffusers.ScoreSdeVeScheduler.step_pred",parameters:[{name:"model_output",val:": FloatTensor"},{name:"timestep",val:": int"},{name:"sample",val:": FloatTensor"},{name:"generator",val:": typing.Optional[torch._C.Generator] = None"},{name:"return_dict",val:": bool = True"}],parametersDescription:[{anchor:"diffusers.ScoreSdeVeScheduler.step_pred.model_output",description:`<strong>model_output</strong> (<code>torch.FloatTensor</code>) &#x2014;
The direct output from learned diffusion model.`,name:"model_output"},{anchor:"diffusers.ScoreSdeVeScheduler.step_pred.timestep",description:`<strong>timestep</strong> (<code>int</code>) &#x2014;
The current discrete timestep in the diffusion chain.`,name:"timestep"},{anchor:"diffusers.ScoreSdeVeScheduler.step_pred.sample",description:`<strong>sample</strong> (<code>torch.FloatTensor</code>) &#x2014;
A current instance of a sample created by the diffusion process.`,name:"sample"},{anchor:"diffusers.ScoreSdeVeScheduler.step_pred.generator",description:`<strong>generator</strong> (<code>torch.Generator</code>, <em>optional</em>) &#x2014;
A random number generator.`,name:"generator"},{anchor:"diffusers.ScoreSdeVeScheduler.step_pred.return_dict",description:`<strong>return_dict</strong> (<code>bool</code>, <em>optional</em>, defaults to <code>True</code>) &#x2014;
Whether or not to return a <a href="/docs/diffusers/main/en/api/schedulers/score_sde_ve#diffusers.schedulers.scheduling_sde_ve.SdeVeOutput">SdeVeOutput</a> or <code>tuple</code>.`,name:"return_dict"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_sde_ve.py#L159",returnDescription:`
<p>If return_dict is <code>True</code>, <a
  href="/docs/diffusers/main/en/api/schedulers/score_sde_ve#diffusers.schedulers.scheduling_sde_ve.SdeVeOutput"
>SdeVeOutput</a> is returned, otherwise a tuple
is returned where the first element is the sample tensor.</p>
`,returnType:`
<p><a
  href="/docs/diffusers/main/en/api/schedulers/score_sde_ve#diffusers.schedulers.scheduling_sde_ve.SdeVeOutput"
>SdeVeOutput</a> or <code>tuple</code></p>
`}}),j=new Nt({}),U=new Q({props:{name:"class diffusers.schedulers.scheduling_sde_ve.SdeVeOutput",anchor:"diffusers.schedulers.scheduling_sde_ve.SdeVeOutput",parameters:[{name:"prev_sample",val:": FloatTensor"},{name:"prev_sample_mean",val:": FloatTensor"}],parametersDescription:[{anchor:"diffusers.schedulers.scheduling_sde_ve.SdeVeOutput.prev_sample",description:`<strong>prev_sample</strong> (<code>torch.FloatTensor</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"},{anchor:"diffusers.schedulers.scheduling_sde_ve.SdeVeOutput.prev_sample_mean",description:`<strong>prev_sample_mean</strong> (<code>torch.FloatTensor</code> of shape <code>(batch_size, num_channels, height, width)</code> for images) &#x2014;
Mean averaged <code>prev_sample</code> over previous timesteps.`,name:"prev_sample_mean"}],source:"https://github.com/huggingface/diffusers/blob/main/src/diffusers/schedulers/scheduling_sde_ve.py#L29"}}),{c(){w=s("meta"),we=c(),$=s("h1"),k=s("a"),oe=s("span"),f(q.$$.fragment),Be=c(),ne=s("span"),Ge=i("ScoreSdeVeScheduler"),$e=c(),y=s("p"),ie=s("code"),ze=i("ScoreSdeVeScheduler"),Ke=i(" is a variance exploding stochastic differential equation (SDE) scheduler. It was introduced in the "),M=s("a"),He=i("Score-Based Generative Modeling through Stochastic Differential Equations"),Je=i(" paper by Yang Song, Jascha Sohl-Dickstein, Diederik P. Kingma, Abhishek Kumar, Stefano Ermon, Ben Poole."),ye=c(),X=s("p"),Re=i("The abstract from the paper is:"),Ee=c(),L=s("p"),ae=s("em"),je=i("Creating noise from data is easy; creating data from noise is generative modeling. We present a stochastic differential equation (SDE) that smoothly transforms a complex data distribution to a known prior distribution by slowly injecting noise, and a corresponding reverse-time SDE that transforms the prior distribution back into the data distribution by slowly removing the noise. Crucially, the reverse-time SDE depends only on the time-dependent gradient field (\\aka, score) of the perturbed data distribution. By leveraging advances in score-based generative modeling, we can accurately estimate these scores with neural networks, and use numerical SDE solvers to generate samples. We show that this framework encapsulates previous approaches in score-based generative modeling and diffusion probabilistic modeling, allowing for new sampling procedures and new modeling capabilities. In particular, we introduce a predictor-corrector framework to correct errors in the evolution of the discretized reverse-time SDE. We also derive an equivalent neural ODE that samples from the same distribution as the SDE, but additionally enables exact likelihood computation, and improved sampling efficiency. In addition, we provide a new way to solve inverse problems with score-based models, as demonstrated with experiments on class-conditional generation, image inpainting, and colorization. Combined with multiple architectural improvements, we achieve record-breaking performance for unconditional image generation on CIFAR-10 with an Inception score of 9.89 and FID of 2.20, a competitive likelihood of 2.99 bits/dim, and demonstrate high fidelity generation of 1024 x 1024 images for the first time from a score-based generative model"),Ue=i("."),Ve=c(),E=s("h2"),O=s("a"),de=s("span"),f(W.$$.fragment),Ye=c(),ce=s("span"),Qe=i("ScoreSdeVeScheduler"),xe=c(),u=s("div"),f(B.$$.fragment),Xe=c(),Z=s("p"),le=s("code"),Ze=i("ScoreSdeVeScheduler"),et=i(" is a variance exploding stochastic differential equation (SDE) scheduler."),tt=c(),V=s("p"),rt=i("This model inherits from "),ee=s("a"),st=i("SchedulerMixin"),ot=i(" and "),te=s("a"),nt=i("ConfigMixin"),it=i(`. Check the superclass documentation for the generic
methods the library implements for all schedulers such as loading and saving.`),at=c(),C=s("div"),f(G.$$.fragment),dt=c(),ue=s("p"),ct=i(`Ensures interchangeability with schedulers that need to scale the denoising model input depending on the
current timestep.`),lt=c(),P=s("div"),f(z.$$.fragment),ut=c(),x=s("p"),pt=i(`Sets the noise scales used for the diffusion chain (to be run before inference). The sigmas control the weight
of the `),pe=s("code"),mt=i("drift"),ht=i(" and "),me=s("code"),ft=i("diffusion"),gt=i(" components of the sample update."),vt=c(),I=s("div"),f(K.$$.fragment),_t=c(),he=s("p"),St=i("Sets the continuous timesteps used for the diffusion chain (to be run before inference)."),bt=c(),A=s("div"),f(H.$$.fragment),wt=c(),J=s("p"),$t=i("Correct the predicted sample based on the "),fe=s("code"),yt=i("model_output"),Et=i(` of the network. This is often run repeatedly after
making the prediction for the previous timestep.`),Vt=c(),F=s("div"),f(R.$$.fragment),xt=c(),ge=s("p"),Dt=i(`Predict the sample from the previous timestep by reversing the SDE. This function propagates the diffusion
process from the learned model outputs (most often the predicted noise).`),De=c(),D=s("h2"),N=s("a"),ve=s("span"),f(j.$$.fragment),Tt=c(),_e=s("span"),kt=i("SdeVeOutput"),Te=c(),T=s("div"),f(U.$$.fragment),Ot=c(),Y=s("p"),Ct=i("Output class for the scheduler\u2019s "),Se=s("code"),Pt=i("step"),It=i(" function output."),this.h()},l(t){const p=lr('[data-svelte="svelte-1phssyn"]',document.head);w=o(p,"META",{name:!0,content:!0}),p.forEach(r),we=l(t),$=o(t,"H1",{class:!0});var Oe=n($);k=o(Oe,"A",{id:!0,class:!0,href:!0});var Mt=n(k);oe=o(Mt,"SPAN",{});var Lt=n(oe);g(q.$$.fragment,Lt),Lt.forEach(r),Mt.forEach(r),Be=l(Oe),ne=o(Oe,"SPAN",{});var Wt=n(ne);Ge=a(Wt,"ScoreSdeVeScheduler"),Wt.forEach(r),Oe.forEach(r),$e=l(t),y=o(t,"P",{});var be=n(y);ie=o(be,"CODE",{});var Bt=n(ie);ze=a(Bt,"ScoreSdeVeScheduler"),Bt.forEach(r),Ke=a(be," is a variance exploding stochastic differential equation (SDE) scheduler. It was introduced in the "),M=o(be,"A",{href:!0,rel:!0});var Gt=n(M);He=a(Gt,"Score-Based Generative Modeling through Stochastic Differential Equations"),Gt.forEach(r),Je=a(be," paper by Yang Song, Jascha Sohl-Dickstein, Diederik P. Kingma, Abhishek Kumar, Stefano Ermon, Ben Poole."),be.forEach(r),ye=l(t),X=o(t,"P",{});var zt=n(X);Re=a(zt,"The abstract from the paper is:"),zt.forEach(r),Ee=l(t),L=o(t,"P",{});var At=n(L);ae=o(At,"EM",{});var Kt=n(ae);je=a(Kt,"Creating noise from data is easy; creating data from noise is generative modeling. We present a stochastic differential equation (SDE) that smoothly transforms a complex data distribution to a known prior distribution by slowly injecting noise, and a corresponding reverse-time SDE that transforms the prior distribution back into the data distribution by slowly removing the noise. Crucially, the reverse-time SDE depends only on the time-dependent gradient field (\\aka, score) of the perturbed data distribution. By leveraging advances in score-based generative modeling, we can accurately estimate these scores with neural networks, and use numerical SDE solvers to generate samples. We show that this framework encapsulates previous approaches in score-based generative modeling and diffusion probabilistic modeling, allowing for new sampling procedures and new modeling capabilities. In particular, we introduce a predictor-corrector framework to correct errors in the evolution of the discretized reverse-time SDE. We also derive an equivalent neural ODE that samples from the same distribution as the SDE, but additionally enables exact likelihood computation, and improved sampling efficiency. In addition, we provide a new way to solve inverse problems with score-based models, as demonstrated with experiments on class-conditional generation, image inpainting, and colorization. Combined with multiple architectural improvements, we achieve record-breaking performance for unconditional image generation on CIFAR-10 with an Inception score of 9.89 and FID of 2.20, a competitive likelihood of 2.99 bits/dim, and demonstrate high fidelity generation of 1024 x 1024 images for the first time from a score-based generative model"),Kt.forEach(r),Ue=a(At,"."),At.forEach(r),Ve=l(t),E=o(t,"H2",{class:!0});var Ce=n(E);O=o(Ce,"A",{id:!0,class:!0,href:!0});var Ht=n(O);de=o(Ht,"SPAN",{});var Jt=n(de);g(W.$$.fragment,Jt),Jt.forEach(r),Ht.forEach(r),Ye=l(Ce),ce=o(Ce,"SPAN",{});var Rt=n(ce);Qe=a(Rt,"ScoreSdeVeScheduler"),Rt.forEach(r),Ce.forEach(r),xe=l(t),u=o(t,"DIV",{class:!0});var m=n(u);g(B.$$.fragment,m),Xe=l(m),Z=o(m,"P",{});var Ft=n(Z);le=o(Ft,"CODE",{});var jt=n(le);Ze=a(jt,"ScoreSdeVeScheduler"),jt.forEach(r),et=a(Ft," is a variance exploding stochastic differential equation (SDE) scheduler."),Ft.forEach(r),tt=l(m),V=o(m,"P",{});var re=n(V);rt=a(re,"This model inherits from "),ee=o(re,"A",{href:!0});var Ut=n(ee);st=a(Ut,"SchedulerMixin"),Ut.forEach(r),ot=a(re," and "),te=o(re,"A",{href:!0});var Yt=n(te);nt=a(Yt,"ConfigMixin"),Yt.forEach(r),it=a(re,`. Check the superclass documentation for the generic
methods the library implements for all schedulers such as loading and saving.`),re.forEach(r),at=l(m),C=o(m,"DIV",{class:!0});var Pe=n(C);g(G.$$.fragment,Pe),dt=l(Pe),ue=o(Pe,"P",{});var Qt=n(ue);ct=a(Qt,`Ensures interchangeability with schedulers that need to scale the denoising model input depending on the
current timestep.`),Qt.forEach(r),Pe.forEach(r),lt=l(m),P=o(m,"DIV",{class:!0});var Ie=n(P);g(z.$$.fragment,Ie),ut=l(Ie),x=o(Ie,"P",{});var se=n(x);pt=a(se,`Sets the noise scales used for the diffusion chain (to be run before inference). The sigmas control the weight
of the `),pe=o(se,"CODE",{});var Xt=n(pe);mt=a(Xt,"drift"),Xt.forEach(r),ht=a(se," and "),me=o(se,"CODE",{});var Zt=n(me);ft=a(Zt,"diffusion"),Zt.forEach(r),gt=a(se," components of the sample update."),se.forEach(r),Ie.forEach(r),vt=l(m),I=o(m,"DIV",{class:!0});var Ae=n(I);g(K.$$.fragment,Ae),_t=l(Ae),he=o(Ae,"P",{});var er=n(he);St=a(er,"Sets the continuous timesteps used for the diffusion chain (to be run before inference)."),er.forEach(r),Ae.forEach(r),bt=l(m),A=o(m,"DIV",{class:!0});var Fe=n(A);g(H.$$.fragment,Fe),wt=l(Fe),J=o(Fe,"P",{});var Ne=n(J);$t=a(Ne,"Correct the predicted sample based on the "),fe=o(Ne,"CODE",{});var tr=n(fe);yt=a(tr,"model_output"),tr.forEach(r),Et=a(Ne,` of the network. This is often run repeatedly after
making the prediction for the previous timestep.`),Ne.forEach(r),Fe.forEach(r),Vt=l(m),F=o(m,"DIV",{class:!0});var qe=n(F);g(R.$$.fragment,qe),xt=l(qe),ge=o(qe,"P",{});var rr=n(ge);Dt=a(rr,`Predict the sample from the previous timestep by reversing the SDE. This function propagates the diffusion
process from the learned model outputs (most often the predicted noise).`),rr.forEach(r),qe.forEach(r),m.forEach(r),De=l(t),D=o(t,"H2",{class:!0});var Me=n(D);N=o(Me,"A",{id:!0,class:!0,href:!0});var sr=n(N);ve=o(sr,"SPAN",{});var or=n(ve);g(j.$$.fragment,or),or.forEach(r),sr.forEach(r),Tt=l(Me),_e=o(Me,"SPAN",{});var nr=n(_e);kt=a(nr,"SdeVeOutput"),nr.forEach(r),Me.forEach(r),Te=l(t),T=o(t,"DIV",{class:!0});var Le=n(T);g(U.$$.fragment,Le),Ot=l(Le),Y=o(Le,"P",{});var We=n(Y);Ct=a(We,"Output class for the scheduler\u2019s "),Se=o(We,"CODE",{});var ir=n(Se);Pt=a(ir,"step"),ir.forEach(r),It=a(We," function output."),We.forEach(r),Le.forEach(r),this.h()},h(){d(w,"name","hf:doc:metadata"),d(w,"content",JSON.stringify(hr)),d(k,"id","scoresdevescheduler"),d(k,"class","header-link block pr-1.5 text-lg no-hover:hidden with-hover:absolute with-hover:p-1.5 with-hover:opacity-0 with-hover:group-hover:opacity-100 with-hover:right-full"),d(k,"href","#scoresdevescheduler"),d($,"class","relative group"),d(M,"href","https://huggingface.co/papers/2011.13456"),d(M,"rel","nofollow"),d(O,"id","diffusers.ScoreSdeVeScheduler"),d(O,"class","header-link block pr-1.5 text-lg no-hover:hidden with-hover:absolute with-hover:p-1.5 with-hover:opacity-0 with-hover:group-hover:opacity-100 with-hover:right-full"),d(O,"href","#diffusers.ScoreSdeVeScheduler"),d(E,"class","relative group"),d(ee,"href","/docs/diffusers/main/en/api/schedulers/overview#diffusers.SchedulerMixin"),d(te,"href","/docs/diffusers/main/en/api/configuration#diffusers.ConfigMixin"),d(C,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),d(P,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),d(I,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),d(A,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),d(F,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),d(u,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),d(N,"id","diffusers.schedulers.scheduling_sde_ve.SdeVeOutput"),d(N,"class","header-link block pr-1.5 text-lg no-hover:hidden with-hover:absolute with-hover:p-1.5 with-hover:opacity-0 with-hover:group-hover:opacity-100 with-hover:right-full"),d(N,"href","#diffusers.schedulers.scheduling_sde_ve.SdeVeOutput"),d(D,"class","relative group"),d(T,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8")},m(t,p){e(document.head,w),h(t,we,p),h(t,$,p),e($,k),e(k,oe),v(q,oe,null),e($,Be),e($,ne),e(ne,Ge),h(t,$e,p),h(t,y,p),e(y,ie),e(ie,ze),e(y,Ke),e(y,M),e(M,He),e(y,Je),h(t,ye,p),h(t,X,p),e(X,Re),h(t,Ee,p),h(t,L,p),e(L,ae),e(ae,je),e(L,Ue),h(t,Ve,p),h(t,E,p),e(E,O),e(O,de),v(W,de,null),e(E,Ye),e(E,ce),e(ce,Qe),h(t,xe,p),h(t,u,p),v(B,u,null),e(u,Xe),e(u,Z),e(Z,le),e(le,Ze),e(Z,et),e(u,tt),e(u,V),e(V,rt),e(V,ee),e(ee,st),e(V,ot),e(V,te),e(te,nt),e(V,it),e(u,at),e(u,C),v(G,C,null),e(C,dt),e(C,ue),e(ue,ct),e(u,lt),e(u,P),v(z,P,null),e(P,ut),e(P,x),e(x,pt),e(x,pe),e(pe,mt),e(x,ht),e(x,me),e(me,ft),e(x,gt),e(u,vt),e(u,I),v(K,I,null),e(I,_t),e(I,he),e(he,St),e(u,bt),e(u,A),v(H,A,null),e(A,wt),e(A,J),e(J,$t),e(J,fe),e(fe,yt),e(J,Et),e(u,Vt),e(u,F),v(R,F,null),e(F,xt),e(F,ge),e(ge,Dt),h(t,De,p),h(t,D,p),e(D,N),e(N,ve),v(j,ve,null),e(D,Tt),e(D,_e),e(_e,kt),h(t,Te,p),h(t,T,p),v(U,T,null),e(T,Ot),e(T,Y),e(Y,Ct),e(Y,Se),e(Se,Pt),e(Y,It),ke=!0},p:ur,i(t){ke||(_(q.$$.fragment,t),_(W.$$.fragment,t),_(B.$$.fragment,t),_(G.$$.fragment,t),_(z.$$.fragment,t),_(K.$$.fragment,t),_(H.$$.fragment,t),_(R.$$.fragment,t),_(j.$$.fragment,t),_(U.$$.fragment,t),ke=!0)},o(t){S(q.$$.fragment,t),S(W.$$.fragment,t),S(B.$$.fragment,t),S(G.$$.fragment,t),S(z.$$.fragment,t),S(K.$$.fragment,t),S(H.$$.fragment,t),S(R.$$.fragment,t),S(j.$$.fragment,t),S(U.$$.fragment,t),ke=!1},d(t){r(w),t&&r(we),t&&r($),b(q),t&&r($e),t&&r(y),t&&r(ye),t&&r(X),t&&r(Ee),t&&r(L),t&&r(Ve),t&&r(E),b(W),t&&r(xe),t&&r(u),b(B),b(G),b(z),b(K),b(H),b(R),t&&r(De),t&&r(D),b(j),t&&r(Te),t&&r(T),b(U)}}}const hr={local:"scoresdevescheduler",sections:[{local:"diffusers.ScoreSdeVeScheduler",title:"ScoreSdeVeScheduler"},{local:"diffusers.schedulers.scheduling_sde_ve.SdeVeOutput",title:"SdeVeOutput"}],title:"ScoreSdeVeScheduler"};function fr(qt){return pr(()=>{new URLSearchParams(window.location.search).get("fw")}),[]}class Sr extends ar{constructor(w){super();dr(this,w,fr,mr,cr,{})}}export{Sr as default,hr as metadata};
