Buckets:
| import{s as D,n as I,o as J}from"../chunks/scheduler.37c15a92.js";import{S as K,i as V,g as r,s as l,r as G,A as W,h as i,f as n,c as s,j as Q,u as S,x as C,k as X,y as Z,a,v as j,d as A,t as R,w as U}from"../chunks/index.7cb9c9b8.js";import{Y as tt}from"../chunks/Youtube.8666c400.js";import{C as et}from"../chunks/CourseFloatingBanner.df82c153.js";import{H as nt,E as at}from"../chunks/getInferenceSnippets.a2135f3c.js";function lt(Y){let o,v,d,w,m,b,f,P,p,T,u,k="デコーダーモデルとは、Transformerモデルのデコーダーのみを使用したモデルを指します。 処理の各段階で、処理対象の単語について、attention層はその単語より前に出現した単語にのみアクセスすることができます。 このようなモデルは<em>自己回帰モデル</em>と呼ばれます。",L,c,B=" デコーダーモデルの事前学習は、次に続く単語を予測するタスクを解くことを中心に展開されます。",E,$,F="これらのモデルは、文を生成するタスクに最も適しています。",H,h,N="デコーダーモデルでは以下のものが代表的です:",M,_,O='<li><a href="https://huggingface.co/transformers/model_doc/ctrl.html" rel="nofollow">CTRL</a></li> <li><a href="https://huggingface.co/docs/transformers/model_doc/openai-gpt" rel="nofollow">GPT</a></li> <li><a href="https://huggingface.co/transformers/model_doc/gpt2.html" rel="nofollow">GPT-2</a></li> <li><a href="https://huggingface.co/transformers/model_doc/transfo-xl.html" rel="nofollow">Transformer XL</a></li>',y,g,z,x,q;return m=new nt({props:{title:"デコーダーモデル",local:"デコーダーモデル",headingTag:"h1"}}),f=new et({props:{chapter:1,classNames:"absolute z-10 right-0 top-0"}}),p=new tt({props:{id:"d_ixlCubqQw"}}),g=new at({props:{source:"https://github.com/huggingface/course/blob/main/chapters/ja/chapter1/6.mdx"}}),{c(){o=r("meta"),v=l(),d=r("p"),w=l(),G(m.$$.fragment),b=l(),G(f.$$.fragment),P=l(),G(p.$$.fragment),T=l(),u=r("p"),u.innerHTML=k,L=l(),c=r("p"),c.textContent=B,E=l(),$=r("p"),$.textContent=F,H=l(),h=r("p"),h.textContent=N,M=l(),_=r("ul"),_.innerHTML=O,y=l(),G(g.$$.fragment),z=l(),x=r("p"),this.h()},l(t){const e=W("svelte-u9bgzb",document.head);o=i(e,"META",{name:!0,content:!0}),e.forEach(n),v=s(t),d=i(t,"P",{}),Q(d).forEach(n),w=s(t),S(m.$$.fragment,t),b=s(t),S(f.$$.fragment,t),P=s(t),S(p.$$.fragment,t),T=s(t),u=i(t,"P",{"data-svelte-h":!0}),C(u)!=="svelte-nthov6"&&(u.innerHTML=k),L=s(t),c=i(t,"P",{"data-svelte-h":!0}),C(c)!=="svelte-mfhtzo"&&(c.textContent=B),E=s(t),$=i(t,"P",{"data-svelte-h":!0}),C($)!=="svelte-ic0gz7"&&($.textContent=F),H=s(t),h=i(t,"P",{"data-svelte-h":!0}),C(h)!=="svelte-igdfsl"&&(h.textContent=N),M=s(t),_=i(t,"UL",{"data-svelte-h":!0}),C(_)!=="svelte-1tiql5w"&&(_.innerHTML=O),y=s(t),S(g.$$.fragment,t),z=s(t),x=i(t,"P",{}),Q(x).forEach(n),this.h()},h(){X(o,"name","hf:doc:metadata"),X(o,"content",st)},m(t,e){Z(document.head,o),a(t,v,e),a(t,d,e),a(t,w,e),j(m,t,e),a(t,b,e),j(f,t,e),a(t,P,e),j(p,t,e),a(t,T,e),a(t,u,e),a(t,L,e),a(t,c,e),a(t,E,e),a(t,$,e),a(t,H,e),a(t,h,e),a(t,M,e),a(t,_,e),a(t,y,e),j(g,t,e),a(t,z,e),a(t,x,e),q=!0},p:I,i(t){q||(A(m.$$.fragment,t),A(f.$$.fragment,t),A(p.$$.fragment,t),A(g.$$.fragment,t),q=!0)},o(t){R(m.$$.fragment,t),R(f.$$.fragment,t),R(p.$$.fragment,t),R(g.$$.fragment,t),q=!1},d(t){t&&(n(v),n(d),n(w),n(b),n(P),n(T),n(u),n(L),n(c),n(E),n($),n(H),n(h),n(M),n(_),n(y),n(z),n(x)),n(o),U(m,t),U(f,t),U(p,t),U(g,t)}}}const st='{"title":"デコーダーモデル","local":"デコーダーモデル","sections":[],"depth":1}';function ot(Y){return J(()=>{new URLSearchParams(window.location.search).get("fw")}),[]}class ut extends K{constructor(o){super(),V(this,o,ot,lt,D,{})}}export{ut as component}; | |
Xet Storage Details
- Size:
- 3.78 kB
- Xet hash:
- c1edd1824e577e8a37b3313eabd61ea7e916fb4150725a0db89c700082927dee
·
Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.