Buckets:
| import{s as I,n as O,o as Q}from"../chunks/scheduler.505acc25.js";import{S as R,i as U,e as d,s as r,c as q,h as D,a as g,d as a,b as s,f as B,g as L,j as S,k as G,l as J,m as n,n as T,t as z,o as E,p as F}from"../chunks/index.1238bded.js";import{C as K,H as V,E as W}from"../chunks/MermaidChart.svelte_svelte_type_style_lang.cccc31f8.js";import{C as X}from"../chunks/CourseFloatingBanner.0b6e065b.js";function Y(N){let i,v,$,_,o,b,l,x,p,w,m,j='Questa è la dine della prima parte del corso! La seconda parte sarà rilasciata il 15 Novembre durante un grande evento della comunità. Per maggiori informazioni <a href="https://huggingface.co/blog/course-launch-event" rel="nofollow">vedere qui</a>.',P,u,A='A questo punto dovreste essere in grado di affinare un modello pre-addestrato per un problema di classificazione tesutale (a frase signola o doppia), e caricare il risultato sull’Hub dei Modelli (Model Hub). Per assicurarvi di padroneggiare i contenuti di questa prima sezione, dovreste provare a fare esattamente questo su un problema che vi interessi (e non necessariamente in Inglese se parlate un’altra lingua)! Potete trovare aiuto nel <a href="https://discuss.huggingface.co/" rel="nofollow">forum di Hugging Face</a>, e quando avete finito potete condividere il vostro progetto in <a href="https://discuss.huggingface.co/t/share-your-projects/6803" rel="nofollow">questo topic</a>.',C,f,k="Non vediamo l’ora di scoprire cosa costruirete!",M,c,y,h,H;return o=new K({props:{containerStyle:"float: right; margin-left: 10px; display: inline-flex; position: relative; z-index: 10;"}}),l=new V({props:{title:"Fine della parte 1!",local:"fine-della-parte-1",headingTag:"h1"}}),p=new X({props:{chapter:4,classNames:"absolute z-10 right-0 top-0"}}),c=new W({props:{source:"https://github.com/huggingface/course/blob/main/chapters/it/chapter4/5.mdx"}}),{c(){i=d("meta"),v=r(),$=d("p"),_=r(),q(o.$$.fragment),b=r(),q(l.$$.fragment),x=r(),q(p.$$.fragment),w=r(),m=d("p"),m.innerHTML=j,P=r(),u=d("p"),u.innerHTML=A,C=r(),f=d("p"),f.textContent=k,M=r(),q(c.$$.fragment),y=r(),h=d("p"),this.h()},l(e){const t=D("svelte-u9bgzb",document.head);i=g(t,"META",{name:!0,content:!0}),t.forEach(a),v=s(e),$=g(e,"P",{}),B($).forEach(a),_=s(e),L(o.$$.fragment,e),b=s(e),L(l.$$.fragment,e),x=s(e),L(p.$$.fragment,e),w=s(e),m=g(e,"P",{"data-svelte-h":!0}),S(m)!=="svelte-1ggh0nv"&&(m.innerHTML=j),P=s(e),u=g(e,"P",{"data-svelte-h":!0}),S(u)!=="svelte-1defbyq"&&(u.innerHTML=A),C=s(e),f=g(e,"P",{"data-svelte-h":!0}),S(f)!=="svelte-1whm4x5"&&(f.textContent=k),M=s(e),L(c.$$.fragment,e),y=s(e),h=g(e,"P",{}),B(h).forEach(a),this.h()},h(){G(i,"name","hf:doc:metadata"),G(i,"content",Z)},m(e,t){J(document.head,i),n(e,v,t),n(e,$,t),n(e,_,t),T(o,e,t),n(e,b,t),T(l,e,t),n(e,x,t),T(p,e,t),n(e,w,t),n(e,m,t),n(e,P,t),n(e,u,t),n(e,C,t),n(e,f,t),n(e,M,t),T(c,e,t),n(e,y,t),n(e,h,t),H=!0},p:O,i(e){H||(z(o.$$.fragment,e),z(l.$$.fragment,e),z(p.$$.fragment,e),z(c.$$.fragment,e),H=!0)},o(e){E(o.$$.fragment,e),E(l.$$.fragment,e),E(p.$$.fragment,e),E(c.$$.fragment,e),H=!1},d(e){e&&(a(v),a($),a(_),a(b),a(x),a(w),a(m),a(P),a(u),a(C),a(f),a(M),a(y),a(h)),a(i),F(o,e),F(l,e),F(p,e),F(c,e)}}}const Z='{"title":"Fine della parte 1!","local":"fine-della-parte-1","sections":[],"depth":1}';function ee(N){return Q(()=>{new URLSearchParams(window.location.search).get("fw")}),[]}class re extends R{constructor(i){super(),U(this,i,ee,Y,I,{})}}export{re as component}; | |
Xet Storage Details
- Size:
- 3.44 kB
- Xet hash:
- 6a7acc1eaeaefe061346f794e7e6bae95cb14165cdbbf37cf6ff20ef944a00f7
·
Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.