import{s as Ze,o as Ee,n as De}from"../chunks/scheduler.78382b47.js";import{S as ze,i as Oe,e as s,s as o,c as v,h as We,a as i,d as a,b as r,f as me,g as w,j as p,k as he,l as h,m as n,n as L,t as x,o as R,p as C}from"../chunks/index.6dd35eb6.js";import{C as qe,H as we,E as Ve}from"../chunks/MermaidChart.svelte_svelte_type_style_lang.fed9dfe4.js";import{D as Fe}from"../chunks/Docstring.32e826ec.js";import{C as Ge}from"../chunks/CodeBlock.af1ec02e.js";import{E as Je}from"../chunks/ExampleCodeBlock.7f184f2e.js";function Se(I){let d,k="Example:",b,f,m;return f=new Ge({props:{code:"ZnJvbSUyMHRyYW5zZm9ybWVycyUyMGltcG9ydCUyMEF1dG9Nb2RlbEZvckNhdXNhbExNJTBBZnJvbSUyMHBlZnQlMjBpbXBvcnQlMjBSYW5kTG9yYUNvbmZpZyUyQyUyMGdldF9wZWZ0X21vZGVsJTBBJTBBYmFzZV9tb2RlbCUyMCUzRCUyMEF1dG9Nb2RlbEZvckNhdXNhbExNLmZyb21fcHJldHJhaW5lZCglMjJmYWNlYm9vayUyRm9wdC0xMjVtJTIyKSUwQWNvbmZpZyUyMCUzRCUyMFJhbmRMb3JhQ29uZmlnKHIlM0QzMiklMEFtb2RlbCUyMCUzRCUyMGdldF9wZWZ0X21vZGVsKGJhc2VfbW9kZWwlMkMlMjBjb25maWcp",highlighted:`<span class="hljs-meta">&gt;&gt;&gt; </span><span class="hljs-keyword">from</span> transformers <span class="hljs-keyword">import</span> AutoModelForCausalLM
<span class="hljs-meta">&gt;&gt;&gt; </span><span class="hljs-keyword">from</span> peft <span class="hljs-keyword">import</span> RandLoraConfig, get_peft_model

<span class="hljs-meta">&gt;&gt;&gt; </span>base_model = AutoModelForCausalLM.from_pretrained(<span class="hljs-string">&quot;facebook/opt-125m&quot;</span>)
<span class="hljs-meta">&gt;&gt;&gt; </span>config = RandLoraConfig(r=<span class="hljs-number">32</span>)
<span class="hljs-meta">&gt;&gt;&gt; </span>model = get_peft_model(base_model, config)`,wrap:!1}}),{c(){d=s("p"),d.textContent=k,b=o(),v(f.$$.fragment)},l(l){d=i(l,"P",{"data-svelte-h":!0}),p(d)!=="svelte-11lpom8"&&(d.textContent=k),b=r(l),w(f.$$.fragment,l)},m(l,u){n(l,d,u),n(l,b,u),L(f,l,u),m=!0},p:De,i(l){m||(x(f.$$.fragment,l),m=!0)},o(l){R(f.$$.fragment,l),m=!1},d(l){l&&(a(d),a(b)),C(f,l)}}}function Ie(I){let d,k,b,f,m,l,u,Q,T,Le='<a href="https://huggingface.co/papers/2502.00987" rel="nofollow">RandLora</a> is a parameter-efficient fine-tuning technique that is similar to <a href="https://huggingface.co/papers/2106.09685" rel="nofollow">LoRA</a> and <a href="https://huggingface.co/papers/2310.11454" rel="nofollow">VeRA</a> but performs full rank updates to improve performance. RandLora can be particularly useful when adapting large model to hard tasks that require complex updates while preserving the parameter efficiency of LoRA. The full rank update of RandLora is achieved by linearly scaling random bases. The random bases are a collection of multiple low rank matrices such that the summation of their ranks if greater or equal to the full rank of the parameter matrices. The trainable parameters of RandLora are two diagonal matrices (vectors) that get multiplied with the right hand low rank random bases, in a similar way to VeRA’s update. To maintain low memory usage, RandLora uses a custom function that prevents storing unnecessary bases in memory for backpropagation.',Y,M,xe="RandLora presents the noteworthy difference that contrary to other LoRA-like PEFT algorithm, increasing RandLora’s random base ranks increases the amount of trainable parameters. Because number of bases x bases rank is constant in RandLora, reducing the rank will increase the number of random bases, hence the number of base-specific trainable diagonal bases.",K,U,Re="Because reducing the rank of RandLora’s random bases will increase their number, RandLora can become slower to train than LoRA for very small ranks where typically, ranks below 4 with result in a large training time increase. This does not affect inference though as the RandLora adapters can be merged into the pretrained weight matrices.",X,P,Ce='RandLora additionally supports training with sparse, ternary random bases (only containing -1, 0 and 1). These bases are as described in <a href="https://cs-people.bu.edu/evimaria/cs565/kdd-rp.pdf" rel="nofollow">Bingham et al.</a> and <a href="https://hastie.su.domains/Papers/Ping/KDD06_rp.pdf" rel="nofollow">Ping et al.</a> and could theoretically be used to reduce compute needs by performing aggregations instead of matrix multiplications to create the weight update. This is not currently supported. Although it does not currently reduce compute, using sparse random bases in RandLora can reduce overfitting in some cases. For users intersted in using sparse ternary bases, the <code>sparse</code> option is recommended over the <code>very_sparse</code> one that can reduce perfromance.',ee,j,$e="Similarly to VeRA, when saving the RandLora’s parameters, it’s possible to eschew storing the low rank matrices by setting <code>save_projection=False</code> on the <code>VeraConfig</code>. In that case, these matrices will be restored based on the fixed random seed from the <code>projection_prng_key</code> argument. This cuts down on the size of the checkpoint, but we cannot guarantee reproducibility on all devices and for all future versions of PyTorch. If you want to ensure reproducibility, set <code>save_projection=True</code> (which is the default).",te,A,ke="As in Vera and to handle different shapes of adapted layers, RandLora initializes shared A and B matrices with the largest required size for each dimension. During the forward pass, submatrices A and B for a given layer are sliced out from these shared matrices and used as described in the paper. For example, adapting two linear layers of shapes (100, 20) and (80, 50) will create A and B matrices of shapes (rank, 50) and (100, rank) respectively. Then, to adapt a layer of shape (100, 20), submatrices A and B of shapes (rank, 20) and (100, rank) will be extracted.",ae,B,Te="RandLora currently has the following constraint:",ne,N,Me="<li>Only <code>nn.Linear</code> layers are supported.</li>",oe,H,Ue="The abstract from the paper is:",re,F,Pe=`<p>Low-Rank Adaptation (LoRA) and its variants have shown impressive results in reducing the number of trainable parameters and memory requirements of large transformer networks while maintaining fine-tuning performance. The low-rank nature of the weight update inherently limits the representation power of fine-tuned models, however, thus potentially compromising performance on complex tasks. This raises a critical question: when a performance gap between LoRA and standard fine-tuning is observed, is it due to the reduced number of trainable parameters or the rank deficiency?
This paper aims to answer this question by introducing RandLora, a parameter-efficient method that performs full-rank updates using a learned linear combinations of low-rank, non-trainable random matrices. Our method limits the number of trainable parameters by restricting optimization to diagonal scaling matrices applied to the fixed random matrices. This allows us to effectively overcome the low-rank limitations while maintaining parameter and memory efficiency during training. Through extensive experimentation across vision, language, and vision-language benchmarks, we systematically evaluate the limitations of LoRA and existing random basis methods. Our findings reveal that full-rank updates are beneficial across vision and language tasks individually, and even more so for vision-language tasks, where RandLora significantly reduces---and sometimes eliminates---the performance gap between standard fine-tuning and LoRA, demonstrating its efficacy.</p>`,se,Z,ie,g,E,ue,W,je='This is the configuration class to store the configuration of a <a href="/docs/peft/main/en/package_reference/randlora#peft.RandLoraModel">RandLoraModel</a>.',ge,q,Ae='Paper: <a href="https://huggingface.co/papers/2502.00987" rel="nofollow">https://huggingface.co/papers/2502.00987</a>.',le,D,de,c,z,be,V,Be="Creates a RandLoRA model from a pretrained transformers model.",ye,$,_e,G,Ne="<strong>Attributes</strong>:",ve,J,He='<li><strong>model</strong> (<a href="https://huggingface.co/docs/transformers/main/en/main_classes/model#transformers.PreTrainedModel" rel="nofollow">PreTrainedModel</a>) — The model to be adapted.</li> <li><strong>peft_config</strong> (<a href="/docs/peft/main/en/package_reference/randlora#peft.RandLoraConfig">RandLoraConfig</a>): The configuration of the RandLora model.</li>',pe,O,ce,S,fe;return m=new qe({props:{containerStyle:"float: right; margin-left: 10px; display: inline-flex; position: relative; z-index: 10;"}}),u=new we({props:{title:"RandLora: Full-rank parameter-efficient fine-tuning of large models",local:"randlora-full-rank-parameter-efficient-fine-tuning-of-large-models",headingTag:"h1"}}),Z=new we({props:{title:"RandLoraConfig",local:"peft.RandLoraConfig",headingTag:"h2"}}),E=new Fe({props:{name:"class peft.RandLoraConfig",anchor:"peft.RandLoraConfig",parameters:[{name:"task_type",val:": Optional[Union[str, TaskType]] = None"},{name:"peft_type",val:": Optional[Union[str, PeftType]] = None"},{name:"auto_mapping",val:": Optional[dict] = None"},{name:"peft_version",val:": Optional[str] = None"},{name:"base_model_name_or_path",val:": Optional[str] = None"},{name:"revision",val:": Optional[str] = None"},{name:"inference_mode",val:": bool = False"},{name:"r",val:": int = 32"},{name:"target_modules",val:": typing.Union[list[str], str, NoneType] = None"},{name:"projection_prng_key",val:": int = 0"},{name:"save_projection",val:": bool = True"},{name:"sparse",val:": bool = False"},{name:"very_sparse",val:": bool = False"},{name:"randlora_dropout",val:": float = 0.0"},{name:"fan_in_fan_out",val:": bool = False"},{name:"randlora_alpha",val:": int = 640"},{name:"bias",val:": str = 'none'"},{name:"modules_to_save",val:": typing.Optional[list[str]] = None"},{name:"init_weights",val:": bool = True"},{name:"layers_to_transform",val:": typing.Union[list[int], int, NoneType] = None"},{name:"layers_pattern",val:": typing.Optional[str] = None"}],parametersDescription:[{anchor:"peft.RandLoraConfig.r",description:`<strong>r</strong> (<code>int</code>, <em>optional</em>, defaults to <code>32</code>) &#x2014;
RandLora&#x2019;s random basis rank dimension. Contrary to Lora, this parameter is inversely proportional to the
amount of trainable parameters as reducing it increases trainable parameters.`,name:"r"},{anchor:"peft.RandLoraConfig.target_modules",description:`<strong>target_modules</strong> (<code>Union[list[str], str]</code>) &#x2014;
The names of the modules to apply RandLora to. Only linear layers are supported.`,name:"target_modules"},{anchor:"peft.RandLoraConfig.projection_prng_key",description:`<strong>projection_prng_key</strong> (<code>int</code>) &#x2014;
RandLora PRNG init key. Used for initialising basis_A and basis_B for new models or when loading a
checkpoint that did not include these projections. Defaults to <code>0</code>.`,name:"projection_prng_key"},{anchor:"peft.RandLoraConfig.save_projection",description:`<strong>save_projection</strong> (<code>bool</code>) &#x2014;
Whether to save the global basis_A / basis_B random basis in the state dict alongside per layer lambda /
gamma diagonal matrices. This will increase the size of the checkpoint, but guarantee that we can reload
the checkpoint on all system configurations. Defaults to <code>True</code>.`,name:"save_projection"},{anchor:"peft.RandLoraConfig.sparse",description:`<strong>sparse</strong> (<code>bool</code>) &#x2014;
Whether to use sparse random bases as described in the RandLora paper. The bases are ternary sparse bases
(only containing -1, 0 and 1) where the attribution probability is 1/6 for -1 and 1 and 2/3 for 0. These
sparse matrices aim to be used for matmul free computation in the future, see
<a href="https://huggingface.co/papers/2406.02528v1" rel="nofollow">https://huggingface.co/papers/2406.02528v1</a> The current implementation is a proof of concept however where
the sparseness is not used to improve speed or memory usage. Using sparse matrices typically does not
reduce performance and can even help reduce overfitting. Defaults to <code>False</code>.`,name:"sparse"},{anchor:"peft.RandLoraConfig.very_sparse",description:`<strong>very_sparse</strong> (<code>bool</code>) &#x2014;
Whether to use highly sparse random bases as described in the RandLora paper. The very sparse bases are
ternary sparse bases (only containing -1, 0 and 1) given a matrix with smallest dimension d, the
attribution probability is 1/&#x221A;D for -1 and 1 and 1- 2/&#x221A;D for 0. Using these sparse matrices can further
reduce overfitting over the <code>sparse</code> alternatives but will most likely decrease performance as a results.
Use carefully. Defaults to <code>False</code>.`,name:"very_sparse"},{anchor:"peft.RandLoraConfig.randlora_dropout",description:`<strong>randlora_dropout</strong> (<code>float</code>) &#x2014;
The dropout probability for RandLora layers.`,name:"randlora_dropout"},{anchor:"peft.RandLoraConfig.randlora_alpha",description:`<strong>randlora_alpha</strong> (<code>float</code>) &#x2014;
The scaling coefficient for RandLora layers, this would typically be 20 times the rank. Because the
<code>randlora_alpha</code> coefficient is large by default, it can lead to numerical instabilities especially when
learning rates are high. If training is unstable, consider reducing the learning rate or the
<code>randlora_alpha</code> coefficient.`,name:"randlora_alpha"},{anchor:"peft.RandLoraConfig.fan_in_fan_out",description:`<strong>fan_in_fan_out</strong> (<code>bool</code>) &#x2014;
Set this to True if the layer to replace stores weight like (fan_in, fan_out). For example, gpt-2 uses
<code>Conv1D</code> which stores weights like (fan_in, fan_out) and hence this should be set to <code>True</code>.`,name:"fan_in_fan_out"},{anchor:"peft.RandLoraConfig.bias",description:`<strong>bias</strong> (<code>str</code>) &#x2014;
Bias type. Can be &#x2018;none&#x2019;, &#x2018;all&#x2019; or &#x2018;randlora_only&#x2019;. If &#x2018;all&#x2019; or &#x2018;randlora_only&#x2019;, the corresponding biases
will be updated during training. Be aware that this means that, even when disabling the adapters, the model
will not produce the same output as the base model would have without adaptation.`,name:"bias"},{anchor:"peft.RandLoraConfig.modules_to_save",description:`<strong>modules_to_save</strong> (<code>list[str]</code>) &#x2014;
list of modules apart from RandLora layers to be set as trainable and saved in the final checkpoint.`,name:"modules_to_save"},{anchor:"peft.RandLoraConfig.init_weights",description:`<strong>init_weights</strong> (<code>bool</code>) &#x2014;
Whether to initialize the weights of the RandLora layers with their default initialization. Don&#x2019;t change
this setting, except if you know exactly what you&#x2019;re doing.`,name:"init_weights"},{anchor:"peft.RandLoraConfig.layers_to_transform",description:`<strong>layers_to_transform</strong> (<code>Union[list[int],int]</code>) &#x2014;
The layer indexes to transform, if this argument is specified, it will apply the RandLora transformations
on the layer indexes that are specified in this list. If a single integer is passed, it will apply the
RandLora transformations on the layer at this index.`,name:"layers_to_transform"},{anchor:"peft.RandLoraConfig.layers_pattern",description:`<strong>layers_pattern</strong> (<code>str</code>) &#x2014;
The layer pattern name, used only if <code>layers_to_transform</code> is different from <code>None</code> and if the layer
pattern is not in the common layers pattern.`,name:"layers_pattern"}],source:"https://github.com/huggingface/peft/blob/main/src/peft/tuners/randlora/config.py#L24"}}),D=new we({props:{title:"RandLoraModel",local:"peft.RandLoraModel",headingTag:"h2"}}),z=new Fe({props:{name:"class peft.RandLoraModel",anchor:"peft.RandLoraModel",parameters:[{name:"model",val:""},{name:"peft_config",val:": Union[PeftConfig, dict[str, PeftConfig]]"},{name:"adapter_name",val:": str"},{name:"low_cpu_mem_usage",val:": bool = False"},{name:"state_dict",val:": Optional[dict[str, torch.Tensor]] = None"}],parametersDescription:[{anchor:"peft.RandLoraModel.model",description:'<strong>model</strong> (<a href="https://huggingface.co/docs/transformers/main/en/main_classes/model#transformers.PreTrainedModel" rel="nofollow">PreTrainedModel</a>) &#x2014; The model to be adapted.',name:"model"},{anchor:"peft.RandLoraModel.config",description:'<strong>config</strong> (<a href="/docs/peft/main/en/package_reference/randlora#peft.RandLoraConfig">RandLoraConfig</a>) &#x2014; The configuration of the RandLora model.',name:"config"},{anchor:"peft.RandLoraModel.adapter_name",description:"<strong>adapter_name</strong> (<code>str</code>) &#x2014; The name of the adapter, defaults to <code>&quot;default&quot;</code>.",name:"adapter_name"},{anchor:"peft.RandLoraModel.low_cpu_mem_usage",description:`<strong>low_cpu_mem_usage</strong> (<code>bool</code>, <code>optional</code>, defaults to <code>False</code>) &#x2014;
Create empty adapter weights on meta device. Useful to speed up the loading process.`,name:"low_cpu_mem_usage"}],source:"https://github.com/huggingface/peft/blob/main/src/peft/tuners/randlora/model.py#L67",returnDescription:`<script context="module">export const metadata = 'undefined';<\/script>


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


<p><code>torch.nn.Module</code></p>
`}}),$=new Je({props:{anchor:"peft.RandLoraModel.example",$$slots:{default:[Se]},$$scope:{ctx:I}}}),O=new Ve({props:{source:"https://github.com/huggingface/peft/blob/main/docs/source/package_reference/randlora.md"}}),{c(){d=s("meta"),k=o(),b=s("p"),f=o(),v(m.$$.fragment),l=o(),v(u.$$.fragment),Q=o(),T=s("p"),T.innerHTML=Le,Y=o(),M=s("p"),M.textContent=xe,K=o(),U=s("p"),U.textContent=Re,X=o(),P=s("p"),P.innerHTML=Ce,ee=o(),j=s("p"),j.innerHTML=$e,te=o(),A=s("p"),A.textContent=ke,ae=o(),B=s("p"),B.textContent=Te,ne=o(),N=s("ul"),N.innerHTML=Me,oe=o(),H=s("p"),H.textContent=Ue,re=o(),F=s("blockquote"),F.innerHTML=Pe,se=o(),v(Z.$$.fragment),ie=o(),g=s("div"),v(E.$$.fragment),ue=o(),W=s("p"),W.innerHTML=je,ge=o(),q=s("p"),q.innerHTML=Ae,le=o(),v(D.$$.fragment),de=o(),c=s("div"),v(z.$$.fragment),be=o(),V=s("p"),V.textContent=Be,ye=o(),v($.$$.fragment),_e=o(),G=s("p"),G.innerHTML=Ne,ve=o(),J=s("ul"),J.innerHTML=He,pe=o(),v(O.$$.fragment),ce=o(),S=s("p"),this.h()},l(e){const t=We("svelte-u9bgzb",document.head);d=i(t,"META",{name:!0,content:!0}),t.forEach(a),k=r(e),b=i(e,"P",{}),me(b).forEach(a),f=r(e),w(m.$$.fragment,e),l=r(e),w(u.$$.fragment,e),Q=r(e),T=i(e,"P",{"data-svelte-h":!0}),p(T)!=="svelte-11cj8z2"&&(T.innerHTML=Le),Y=r(e),M=i(e,"P",{"data-svelte-h":!0}),p(M)!=="svelte-cfxky3"&&(M.textContent=xe),K=r(e),U=i(e,"P",{"data-svelte-h":!0}),p(U)!=="svelte-19fx7od"&&(U.textContent=Re),X=r(e),P=i(e,"P",{"data-svelte-h":!0}),p(P)!=="svelte-1vop222"&&(P.innerHTML=Ce),ee=r(e),j=i(e,"P",{"data-svelte-h":!0}),p(j)!=="svelte-a8gpp"&&(j.innerHTML=$e),te=r(e),A=i(e,"P",{"data-svelte-h":!0}),p(A)!=="svelte-l4t88u"&&(A.textContent=ke),ae=r(e),B=i(e,"P",{"data-svelte-h":!0}),p(B)!=="svelte-87o406"&&(B.textContent=Te),ne=r(e),N=i(e,"UL",{"data-svelte-h":!0}),p(N)!=="svelte-18w7elh"&&(N.innerHTML=Me),oe=r(e),H=i(e,"P",{"data-svelte-h":!0}),p(H)!=="svelte-1cwsb16"&&(H.textContent=Ue),re=r(e),F=i(e,"BLOCKQUOTE",{"data-svelte-h":!0}),p(F)!=="svelte-p2gyd1"&&(F.innerHTML=Pe),se=r(e),w(Z.$$.fragment,e),ie=r(e),g=i(e,"DIV",{class:!0});var _=me(g);w(E.$$.fragment,_),ue=r(_),W=i(_,"P",{"data-svelte-h":!0}),p(W)!=="svelte-53axiy"&&(W.innerHTML=je),ge=r(_),q=i(_,"P",{"data-svelte-h":!0}),p(q)!=="svelte-ilfw0f"&&(q.innerHTML=Ae),_.forEach(a),le=r(e),w(D.$$.fragment,e),de=r(e),c=i(e,"DIV",{class:!0});var y=me(c);w(z.$$.fragment,y),be=r(y),V=i(y,"P",{"data-svelte-h":!0}),p(V)!=="svelte-13itvs0"&&(V.textContent=Be),ye=r(y),w($.$$.fragment,y),_e=r(y),G=i(y,"P",{"data-svelte-h":!0}),p(G)!=="svelte-1xx6nm4"&&(G.innerHTML=Ne),ve=r(y),J=i(y,"UL",{"data-svelte-h":!0}),p(J)!=="svelte-l8l6mm"&&(J.innerHTML=He),y.forEach(a),pe=r(e),w(O.$$.fragment,e),ce=r(e),S=i(e,"P",{}),me(S).forEach(a),this.h()},h(){he(d,"name","hf:doc:metadata"),he(d,"content",Qe),he(g,"class","docstring border-l-2 border-t-2 pl-4 pt-3.5 border-gray-100 rounded-tl-xl mb-6 mt-8"),he(c,"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,t){h(document.head,d),n(e,k,t),n(e,b,t),n(e,f,t),L(m,e,t),n(e,l,t),L(u,e,t),n(e,Q,t),n(e,T,t),n(e,Y,t),n(e,M,t),n(e,K,t),n(e,U,t),n(e,X,t),n(e,P,t),n(e,ee,t),n(e,j,t),n(e,te,t),n(e,A,t),n(e,ae,t),n(e,B,t),n(e,ne,t),n(e,N,t),n(e,oe,t),n(e,H,t),n(e,re,t),n(e,F,t),n(e,se,t),L(Z,e,t),n(e,ie,t),n(e,g,t),L(E,g,null),h(g,ue),h(g,W),h(g,ge),h(g,q),n(e,le,t),L(D,e,t),n(e,de,t),n(e,c,t),L(z,c,null),h(c,be),h(c,V),h(c,ye),L($,c,null),h(c,_e),h(c,G),h(c,ve),h(c,J),n(e,pe,t),L(O,e,t),n(e,ce,t),n(e,S,t),fe=!0},p(e,[t]){const _={};t&2&&(_.$$scope={dirty:t,ctx:e}),$.$set(_)},i(e){fe||(x(m.$$.fragment,e),x(u.$$.fragment,e),x(Z.$$.fragment,e),x(E.$$.fragment,e),x(D.$$.fragment,e),x(z.$$.fragment,e),x($.$$.fragment,e),x(O.$$.fragment,e),fe=!0)},o(e){R(m.$$.fragment,e),R(u.$$.fragment,e),R(Z.$$.fragment,e),R(E.$$.fragment,e),R(D.$$.fragment,e),R(z.$$.fragment,e),R($.$$.fragment,e),R(O.$$.fragment,e),fe=!1},d(e){e&&(a(k),a(b),a(f),a(l),a(Q),a(T),a(Y),a(M),a(K),a(U),a(X),a(P),a(ee),a(j),a(te),a(A),a(ae),a(B),a(ne),a(N),a(oe),a(H),a(re),a(F),a(se),a(ie),a(g),a(le),a(de),a(c),a(pe),a(ce),a(S)),a(d),C(m,e),C(u,e),C(Z,e),C(E),C(D,e),C(z),C($),C(O,e)}}}const Qe='{"title":"RandLora: Full-rank parameter-efficient fine-tuning of large models","local":"randlora-full-rank-parameter-efficient-fine-tuning-of-large-models","sections":[{"title":"RandLoraConfig","local":"peft.RandLoraConfig","sections":[],"depth":2},{"title":"RandLoraModel","local":"peft.RandLoraModel","sections":[],"depth":2}],"depth":1}';function Ye(I){return Ee(()=>{new URLSearchParams(window.location.search).get("fw")}),[]}class ot extends ze{constructor(d){super(),Oe(this,d,Ye,Ie,Ze,{})}}export{ot as component};
