ScholarGate
Asistent

Uporedite metode

Pregledajte izabrane metode jednu pored druge; redovi koji se razlikuju su istaknuti.

LoRA i PEFT×Slučajna šuma×
OblastDuboko učenjeMašinsko učenje
PorodicaMachine learningMachine learning
Godina nastanka20222001
TvoracHu, E. J. et al.; Lester, B. et al.Breiman, L.
TipParameter-efficient fine-tuning of large pretrained modelsEnsemble (bagging of decision trees)
Temeljni izvorHu, E. J. et al. (2022). LoRA: Low-Rank Adaptation of Large Language Models. ICLR. link ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
Drugi naziviLoRA ve PEFT — Parametre Verimli İnce Ayar, Low-Rank Adaptation, parameter-efficient fine-tuning, prefix tuningRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Srodne54
SažetakLoRA (Low-Rank Adaptation), introduced by Hu et al. in 2022, and the broader family of parameter-efficient fine-tuning (PEFT) methods adapt large pretrained language models to new tasks by training only a small number of extra parameters instead of every weight in the model. This makes fine-tuning possible with far less GPU memory and compute while leaving the original model largely untouched.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretragu Preuzmi slajdove

ScholarGateUporedite metode: LoRA and PEFT · Random Forest. Preuzeto 2026-06-17 sa https://scholargate.app/sr/compare