<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>LoRA: Low-Rank Adaptation of Large Language Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2106.09685/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2106.09685/feed.xml" rel="self" type="application/rss+xml" /><item><title>LoRA: Low-Rank Adaptation of Large Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=50101266</link><guid isPermaLink="false">urn:hackerpapers:submission:2106.09685:50101266</guid><pubDate>Thu, 15 Oct 2026 09:30:38 GMT</pubDate><description>&lt;p&gt;LoRA: Low-Rank Adaptation of Large Language Models (2021)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by supriyo-biswas</title><link>https://news.ycombinator.com/item?id=49320161</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:49320161</guid><pubDate>Sun, 16 Aug 2026 13:59:59 GMT</pubDate><description>&lt;p&gt;In this token-mania frenzy that has taken hold of the industry, I guess solutions like &amp;quot;soul document&amp;quot; and &amp;quot;system prompts&amp;quot; will continue for a while, and once the industry matures a bit we&amp;#x27;ll go back to things like LoRA[1] and control vectors[2][3]. The other explanation may be that these AI labs may be expecting more government scrutiny, and &amp;quot;here&amp;#x27;s a document&amp;quot; would probably go better than &amp;quot;here&amp;#x27;s some vector representation of our values&amp;quot; when talking to politicians. [1] https://arxiv.org/abs/2106.09685 [2] https://vgel.me/posts/representation-engineering/ [3]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by khalic</title><link>https://news.ycombinator.com/item?id=44275377</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:44275377</guid><pubDate>Sat, 14 Jun 2025 09:56:32 GMT</pubDate><description>&lt;p&gt;You should look into LoRA, it’s a partial retraining method, doesn’t require nearly as much as retraining the whole model. It’s different from what this paper is suggesting. The self improvements in this paper even sets the rules for the improvements, basically creating new data out of what it has. LoRA paper: https://arxiv.org/abs/2106.09685&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by kouteiheika</title><link>https://news.ycombinator.com/item?id=44253908</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:44253908</guid><pubDate>Thu, 12 Jun 2025 02:57:59 GMT</pubDate><description>&lt;p&gt;&amp;gt; Adapter Modules and LoRA (Low-Rank Adaptation) insert new knowledge through specialized, isolated subnetworks, leaving existing neurons untouched. This is best for stuff like formatting, specific chains, etc- all of which don’t require a complete neural network update. This highlights to me that the author doesn&amp;#x27;t know what they&amp;#x27;re talking about. LoRA does exactly the same thing as normal fine-tuning, it&amp;#x27;s just a trick to make it faster and/or be able to do it on lower end hardware. LoRA doesn&amp;#x27;t add &amp;quot;isolated subnetworks&amp;quot; - LoRA parameters are added to the original weights! Here&amp;#x27;s the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by kelseyfrog</title><link>https://news.ycombinator.com/item?id=42089755</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:42089755</guid><pubDate>Fri, 08 Nov 2024 19:30:26 GMT</pubDate><description>&lt;p&gt;&amp;gt; When you finetune with lora, you&amp;#x27;re updating maybe 5% of the parameters I&amp;#x27;m not sure I understand this comment. The LoRA paper[1] specifically says that all of the pretrained weights remain frozen. &amp;gt; keeping the pre-trained weights frozen Specifically, the LoRA paper differentiates itself from updating some parameters by stating &amp;gt; Many sought to mitigate this by adapting only some parameters or learning external modules for new tasks. 1. https://arxiv.org/pdf/2106.09685&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by magicalhippo</title><link>https://news.ycombinator.com/item?id=40682005</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:40682005</guid><pubDate>Fri, 14 Jun 2024 16:02:35 GMT</pubDate><description>&lt;p&gt;Bit late to the party and I&amp;#x27;m not into the AI scene, but from glossing over the three key papers they cite to describe their model, my take is as follows. The idea from LoRA[1] is to take pre-trained, dense weights W_0 for a model and adapt them to new training data by using the weights W = W_0 + BA for inference. The key is that the matrices A and B have a very low rank[2] compared to W_0. Training is then done by treating W_0 as constant, and only updating the A and B matrices. The idea from MoE[3] is to pick just a few &amp;quot;experts&amp;quot; from a large number using Softmax, and insert them between…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by supriyo-biswas</title><link>https://news.ycombinator.com/item?id=40679166</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:40679166</guid><pubDate>Fri, 14 Jun 2024 09:36:39 GMT</pubDate><description>&lt;p&gt;That&amp;#x27;s apparently Apple&amp;#x27;s term for LoRA[1]. [1] https://arxiv.org/abs/2106.09685&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by blissfulresup</title><link>https://news.ycombinator.com/item?id=39934975</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:39934975</guid><pubDate>Thu, 04 Apr 2024 19:48:48 GMT</pubDate><description>&lt;p&gt;Look into LoRa https://arxiv.org/abs/2106.09685&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by thijson</title><link>https://news.ycombinator.com/item?id=39908094</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:39908094</guid><pubDate>Tue, 02 Apr 2024 17:02:16 GMT</pubDate><description>&lt;p&gt;This seems to be an order of magnitude better than LoRa (https://lora-alliance.org/ not https://arxiv.org/abs/2106.09685). LoRa doesn&amp;#x27;t have all the features this one does like OFDM, TDM, FDM, and HARQ. I didn&amp;#x27;t know there&amp;#x27;s spectrum dedicated for DECT use.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by krisoft</title><link>https://news.ycombinator.com/item?id=38677299</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:38677299</guid><pubDate>Sun, 17 Dec 2023 23:02:26 GMT</pubDate><description>&lt;p&gt;&amp;gt; Anyone have any ideas / knowledge on how they deploy little incremental fixes to exploited jailbreaks, etc? LoRa[1] would be my guess. For detailed explanation I recommend the paper. But the short explanation is that it is a trick which lets you train a smaller, lower dimensional model which when you add to the original model it gets you the result you want. 1: https://arxiv.org/abs/2106.09685&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by abrichr</title><link>https://news.ycombinator.com/item?id=38266592</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:38266592</guid><pubDate>Tue, 14 Nov 2023 17:38:25 GMT</pubDate><description>&lt;p&gt;From https://arxiv.org/abs/2106.09685: &amp;gt; LoRA: Low-Rank Adaptation of Large Language Models &amp;gt; An important paradigm of natural language processing consists of large-scale pre-training on general domain data and adaptation to particular tasks or domains. As we pre-train larger models, full fine-tuning, which retrains all model parameters, becomes less feasible. Using GPT-3 175B as an example -- deploying independent instances of fine-tuned models, each with 175B parameters, is prohibitively expensive. We propose Low-Rank Adaptation, or LoRA, which freezes the pre-trained model weights and…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by hnfong</title><link>https://news.ycombinator.com/item?id=37555886</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:37555886</guid><pubDate>Mon, 18 Sep 2023 13:34:24 GMT</pubDate><description>&lt;p&gt;Somewhat yes. See &amp;quot;LoRA&amp;quot;: https://arxiv.org/abs/2106.09685 They&amp;#x27;re not composable in the sense that you can take these adaptation layers and arbitrarily combine them, but training different models while sharing a common base of weights is a solved problem.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by uoaei</title><link>https://news.ycombinator.com/item?id=37417415</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:37417415</guid><pubDate>Thu, 07 Sep 2023 11:28:21 GMT</pubDate><description>&lt;p&gt;With all the naive AI zealotry on HN can you really fault me? They&amp;#x27;re referring to this: https://arxiv.org/abs/2106.09685&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by maurits</title><link>https://news.ycombinator.com/item?id=36847713</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:36847713</guid><pubDate>Mon, 24 Jul 2023 13:31:39 GMT</pubDate><description>&lt;p&gt;LoRA: Low-Rank Adaptation of Large Language Models [1] [1]: https://arxiv.org/abs/2106.09685&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by jiggawatts</title><link>https://news.ycombinator.com/item?id=35912079</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35912079</guid><pubDate>Fri, 12 May 2023 04:57:00 GMT</pubDate><description>&lt;p&gt;Open-source LLM projects have largely solved this using Low-Rank Adaptation of Large Language Models (LoRA): https://arxiv.org/abs/2106.09685 Apparently an RTX 4090 running overnight is sufficient to produce a fine-tuned model that can spit out new Harry Potter stories, or whatever...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=35833868</link><guid isPermaLink="false">urn:hackerpapers:submission:2106.09685:35833868</guid><pubDate>Fri, 05 May 2023 19:10:58 GMT</pubDate><description>&lt;p&gt;LORA: Low-Rank Adaptation of Large Language Models&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;42 points; 3 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by batch12</title><link>https://news.ycombinator.com/item?id=35751990</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35751990</guid><pubDate>Sat, 29 Apr 2023 11:37:23 GMT</pubDate><description>&lt;p&gt;I haven&amp;#x27;t done this with sentence transformers but I imagine it&amp;#x27;s possible since they can be loaded as regular transformers. Check out https://github.com/huggingface/peft -- they&amp;#x27;ve packaged it up nicely- and read up on LoRA (https://arxiv.org/pdf/2106.09685.pdf) That should get you started.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by lordswork</title><link>https://news.ycombinator.com/item?id=35356873</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35356873</guid><pubDate>Wed, 29 Mar 2023 13:20:34 GMT</pubDate><description>&lt;p&gt;No need to pay yourself. Uploaded https://arxiv.org/pdf/2106.09685.pdf to scisummary: This text discusses various studies and advancements in the field of natural language processing (NLP) and machine learning. One study focuses on parameter-efficient transfer learning, and another examines the efficiency of adapter layers in NLP models. Further studies evaluate specific datasets for evaluating NLP models. The article proposes a method called LoRA (low rank adaptation) for adapting pre-trained neural network models to new tasks with fewer trainable parameters. LoRA allows for partial…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by Grothendank</title><link>https://news.ycombinator.com/item?id=35355045</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35355045</guid><pubDate>Wed, 29 Mar 2023 10:17:34 GMT</pubDate><description>&lt;p&gt;There&amp;#x27;s a difference between buzzwords and jargon. Buzzwords can start out as jargon, but have their technical meaning stripped by users who are just trying to sound persuasive. Examples include words like synergy, vertical, dynamic, cyber strategy, and NFT. That&amp;#x27;s not what&amp;#x27;s happening in the parent comment. They&amp;#x27;re talking about projects like https://github.com/ZrrSkywalker/LLaMA-Adapter https://github.com/microsoft/LoRA https://github.com/tloen/alpaca-lora and specifically the paper: https://arxiv.org/pdf/2106.09685.pdf Lora is just a way to re-train a network for less effort. Before we had…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by Grothendank</title><link>https://news.ycombinator.com/item?id=35354714</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35354714</guid><pubDate>Wed, 29 Mar 2023 09:35:32 GMT</pubDate><description>&lt;p&gt;There&amp;#x27;s a neat trick when you encounter jargon. 1. Identify the jargon terms you don&amp;#x27;t understand 2. Lookup papers that introduce the jargon terms 3. Skim-read the paper to get the gist of the jargon If you don&amp;#x27;t want to do this, then you don&amp;#x27;t have to feel uneducated. You can simply choose to feel like your time is more important than skimming a dozen AI papers a week. But for example, here&amp;#x27;s what I did to understand the parent comment: 1. I had no idea what lora is or how it relates to alpaca. 2. I looked up https://github.com/tloen/alpaca-lora 3. I read the abstract of the Lora paper…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by robwwilliams</title><link>https://news.ycombinator.com/item?id=35351788</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35351788</guid><pubDate>Wed, 29 Mar 2023 03:06:55 GMT</pubDate><description>&lt;p&gt;Here is a good start in “low-rank adaptation” or LoRA module. A way to train/adapt a general purpose LLM to efficiently and iteratively accommodate specialize data types and knowledge. A bolt-on. https://arxiv.org/pdf/2106.09685.pdf Not “on top” but more “in parallel” if I understand correctly&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by dpiers</title><link>https://news.ycombinator.com/item?id=35350838</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35350838</guid><pubDate>Wed, 29 Mar 2023 01:28:08 GMT</pubDate><description>&lt;p&gt;LoRA: https://arxiv.org/pdf/2106.09685.pdf LLaMA: https://ai.facebook.com/blog/large-language-model-llama-meta... Both have been the subjects of numerous HN posts in the last month.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by h11h</title><link>https://news.ycombinator.com/item?id=35350835</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35350835</guid><pubDate>Wed, 29 Mar 2023 01:27:49 GMT</pubDate><description>&lt;p&gt;LLaMA is Facebook&amp;#x27;s LLM (large language model, comparable with GPT). It&amp;#x27;s publicly available (anyone can download the weights and run it themselves), so it&amp;#x27;s popular here. LoRA, or Low-Rank Adaptation of Large Language Models, lets people fine tune a LLM (making it perform better for a particular application) using vastly less resources. Paper: https://arxiv.org/pdf/2106.09685.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by GaggiX</title><link>https://news.ycombinator.com/item?id=35295165</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35295165</guid><pubDate>Fri, 24 Mar 2023 20:42:39 GMT</pubDate><description>&lt;p&gt;&amp;gt;when it is well-known in the field that parameter-efficient fine-tuning always pays a cost in terms of performance relative to full fine-tuning The LoRA paper clearly states the performance of the method &amp;quot;LoRA performs on-par or better than fine-tuning in model quality on RoBERTa, DeBERTa, GPT-2, and GPT-3, despite having fewer trainable parameters, a higher training throughput, and, unlike adapters, no additional inference latency. &amp;quot;: https://arxiv.org/abs/2106.09685&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by eternalban</title><link>https://news.ycombinator.com/item?id=35293799</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35293799</guid><pubDate>Fri, 24 Mar 2023 18:53:17 GMT</pubDate><description>&lt;p&gt;https://ar5iv.labs.arxiv.org/html/2106.09685/assets/x1.png &amp;gt; incurs a non-trivial computation cost The hit seems to be in energy/cpu not time since the W0 computation is in parallel with the BAx. (My assumption based on the latency claims in paper.) So an issue in edge deployments (battery life, etc.). &amp;gt; you are stuck with that one model on that device Upfront I have 0 clue on the actual numbers, but from a purely software architecture pov [in unmerged setup], having that W0 forward process once with n distinct BAx paths (for distinct fine tunings!) would address that, no? [p.s. say an…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by return_to_monke</title><link>https://news.ycombinator.com/item?id=35293723</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35293723</guid><pubDate>Fri, 24 Mar 2023 18:46:40 GMT</pubDate><description>&lt;p&gt;I think your first statement is incorrect. Lora seems to be a method to fine-tune and optimize the weights of models like Alpaca. It is not a different dataset. This reduces model sizes and therefore also compute costs. See the abstract of https://arxiv.org/pdf/2106.09685.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by eternalban</title><link>https://news.ycombinator.com/item?id=35291385</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35291385</guid><pubDate>Fri, 24 Mar 2023 16:24:25 GMT</pubDate><description>&lt;p&gt;They address prompt tuning&amp;#x27;s issues in the paper: &amp;quot;The other direction, as exemplified by prefix tuning (Li &amp;amp; Liang, 2021), faces a different challenge. We observe that prefix tuning is difficult to optimize and that its performance changes non-monotonically in trainable parameters, confirming similar observations in the original paper. More fundamentally, reserving a part of the sequence length for adaptation necessarily reduces the sequence length available to process a downstream task, which we suspect makes tuning the prompt less performant compared to other methods.&amp;quot;…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by nl</title><link>https://news.ycombinator.com/item?id=35283997</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35283997</guid><pubDate>Fri, 24 Mar 2023 01:40:39 GMT</pubDate><description>&lt;p&gt;LoRA is an alternative to traditional fine tuning (which is usually done on specific layers as you mentioned). To quote the LoRA paper[1]: &amp;gt; We hypothesize that the change in weights during model adaptation also has a low “intrinsic rank”, leading to our proposed Low-Rank Adaptation (LoRA) approach. LoRA allows us to train some dense layers in a neural network indirectly by optimizing rank decomposition matrices of the dense layers’ change during adaptation instead, while keeping the pre-trained weights frozen It&amp;#x27;s truly revolutionary: It basically lets you create a very small &amp;quot;diff&amp;quot; which…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by angch</title><link>https://news.ycombinator.com/item?id=35193312</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35193312</guid><pubDate>Fri, 17 Mar 2023 04:56:23 GMT</pubDate><description>&lt;p&gt;What&amp;#x27;s fun is that the recent references to LoRA stands for Low-Rank Adaptation [1], not Low-Resource Adapters[2] (??? don&amp;#x27;t know if this even exists), but because Low-Rank Adaptation came out in 2021, chatgpt only explains what Low-Resource Adapters is, not Low-Rank Adaptation, which is what is being used in recent break throughs. My own questioning of chatgpt on LoRA returns &amp;quot;Logistic Regression Algorithm&amp;quot; instead. Looks like it&amp;#x27;s too new to ChatGPT. [1] https://arxiv.org/abs/2106.09685 [2] https://rentry.co/vafkn&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by benob</title><link>https://news.ycombinator.com/item?id=35187835</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35187835</guid><pubDate>Thu, 16 Mar 2023 20:17:21 GMT</pubDate><description>&lt;p&gt;Picked the wrong one. LoRA, Low-rank Adaptation of LLMs (https://arxiv.org/pdf/2106.09685.pdf), consists in adapting the weights of a big neural network to a target task (here, answering to instructions). It doesn&amp;#x27;t touch the weights of the original model, but rather adds the product of two low-rank matrices to select layers. The weights from those matrices are learnable. The method allows to adapt big models on (relatively) low-memory GPUs.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>LoRA: Low-Rank Adaptation of Large Language Models — mentioned by GaggiX</title><link>https://news.ycombinator.com/item?id=35186643</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.09685:35186643</guid><pubDate>Thu, 16 Mar 2023 18:57:59 GMT</pubDate><description>&lt;p&gt;&amp;gt;they perform a little worse. Be aware that LoRA performs on-par or better than fine-tuning in model quality if trained correctly as the paper shows: https://arxiv.org/abs/2106.09685&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.09685/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
