Buckets:

rtrm's picture
download
raw
3.2 kB
import{s as G,n as N,o as O}from"../chunks/scheduler.37c15a92.js";import{S as R,i as U,g as c,s as l,r as y,A as D,h,f as a,c as o,j as F,u as E,x as M,k as B,y as I,a as n,v as T,d as L,t as j,w as S}from"../chunks/index.7cb9c9b8.js";import{C as J}from"../chunks/CourseFloatingBanner.df82c153.js";import{H as K,E as Q}from"../chunks/getInferenceSnippets.b6a8c7d2.js";function V(k){let s,_,$,d,r,b,i,v,m,q='これでコースのパート1は終了です!パート2は11月15日に開催される、大きなコミュニティイベントで公開される予定です。詳しくは<a href="https://huggingface.co/blog/course-launch-event" rel="nofollow">こちら</a>をご覧ください。',w,p,z='これで、テキスト分類問題(単一または文のペア)に対する学習済みモデルのファインチューニングを行い、結果をモデルハブにアップロードできるようになりました。この最初のセクションを確実にマスターするためには、自分の興味のある問題(英語でなくてもよい)をきっちりやっておくことが必要です。<a href="https://discuss.huggingface.co/" rel="nofollow">Hugging Face forums</a>で助けを求めることもできますし、完成したら<a href="https://discuss.huggingface.co/t/share-your-projects/6803" rel="nofollow">this topic</a>でプロジェクトを共有することもできます。',x,f,A="何ができるか楽しみです!",P,u,C,g,H;return r=new K({props:{title:"パート1終了!",local:"パート1終了",headingTag:"h1"}}),i=new J({props:{chapter:4,classNames:"absolute z-10 right-0 top-0"}}),u=new Q({props:{source:"https://github.com/huggingface/course/blob/main/chapters/ja/chapter4/5.mdx"}}),{c(){s=c("meta"),_=l(),$=c("p"),d=l(),y(r.$$.fragment),b=l(),y(i.$$.fragment),v=l(),m=c("p"),m.innerHTML=q,w=l(),p=c("p"),p.innerHTML=z,x=l(),f=c("p"),f.textContent=A,P=l(),y(u.$$.fragment),C=l(),g=c("p"),this.h()},l(t){const e=D("svelte-u9bgzb",document.head);s=h(e,"META",{name:!0,content:!0}),e.forEach(a),_=o(t),$=h(t,"P",{}),F($).forEach(a),d=o(t),E(r.$$.fragment,t),b=o(t),E(i.$$.fragment,t),v=o(t),m=h(t,"P",{"data-svelte-h":!0}),M(m)!=="svelte-1obmktr"&&(m.innerHTML=q),w=o(t),p=h(t,"P",{"data-svelte-h":!0}),M(p)!=="svelte-lqtl9c"&&(p.innerHTML=z),x=o(t),f=h(t,"P",{"data-svelte-h":!0}),M(f)!=="svelte-1rx8dyl"&&(f.textContent=A),P=o(t),E(u.$$.fragment,t),C=o(t),g=h(t,"P",{}),F(g).forEach(a),this.h()},h(){B(s,"name","hf:doc:metadata"),B(s,"content",W)},m(t,e){I(document.head,s),n(t,_,e),n(t,$,e),n(t,d,e),T(r,t,e),n(t,b,e),T(i,t,e),n(t,v,e),n(t,m,e),n(t,w,e),n(t,p,e),n(t,x,e),n(t,f,e),n(t,P,e),T(u,t,e),n(t,C,e),n(t,g,e),H=!0},p:N,i(t){H||(L(r.$$.fragment,t),L(i.$$.fragment,t),L(u.$$.fragment,t),H=!0)},o(t){j(r.$$.fragment,t),j(i.$$.fragment,t),j(u.$$.fragment,t),H=!1},d(t){t&&(a(_),a($),a(d),a(b),a(v),a(m),a(w),a(p),a(x),a(f),a(P),a(C),a(g)),a(s),S(r,t),S(i,t),S(u,t)}}}const W='{"title":"パート1終了!","local":"パート1終了","sections":[],"depth":1}';function X(k){return O(()=>{new URLSearchParams(window.location.search).get("fw")}),[]}class at extends R{constructor(s){super(),U(this,s,X,V,G,{})}}export{at as component};

Xet Storage Details

Size:
3.2 kB
·
Xet hash:
7eab7af93ddf156b5eef76ff924f4eabb1bf606db8b1155631ae1aa8753587dd

Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.