File size: 84,451 Bytes
077605d
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740

=== PDF PAGE 1 ===
LORA: LOW-RANK ADAPTATION OF LARGE LAN-
GUAGE MODELS
Edward Hu∗
Yelong Shen∗
Phillip Wallis
Zeyuan Allen-Zhu
Yuanzhi Li
Shean Wang
Lu Wang
Weizhu Chen
Microsoft Corporation
{edwardhu, yeshe, phwallis, zeyuana,
yuanzhil, swang, luw, wzchen}@microsoft.com
yuanzhil@andrew.cmu.edu
(Version 2)
ABSTRACT
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 indepen-
dent 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 injects trainable rank decomposition matrices into each
layer of the Transformer architecture, greatly reducing the number of trainable pa-
rameters for downstream tasks. Compared to GPT-3 175B fine-tuned with Adam,
LoRA can reduce the number of trainable parameters by 10,000 times and the
GPU memory requirement by 3 times. LoRA performs on-par or better than fine-
tuning in model quality on RoBERTa, DeBERTa, GPT-2, and GPT-3, despite hav-
ing fewer trainable parameters, a higher training throughput, and, unlike adapters,
no additional inference latency. We also provide an empirical investigation into
rank-deficiency in language model adaptation, which sheds light on the efficacy of
LoRA. We release a package that facilitates the integration of LoRA with PyTorch
models and provide our implementations and model checkpoints for RoBERTa,
DeBERTa, and GPT-2 at https://github.com/microsoft/LoRA.
1
INTRODUCTION
Pretrained 
Weights
𝑊∈ℝ𝑑×𝑑
x
h
𝐵= 0
𝐴= 𝒩(0, 𝜎2)
𝑑
𝑟
Figure 1: Our reparametriza-
tion. We only train A and B.
Many applications in natural language processing rely on adapt-
ing one large-scale, pre-trained language model to multiple down-
stream applications. Such adaptation is usually done via fine-tuning,
which updates all the parameters of the pre-trained model. The ma-
jor downside of fine-tuning is that the new model contains as many
parameters as in the original model. As larger models are trained
every few months, this changes from a mere “inconvenience” for
GPT-2 (Radford et al., b) or RoBERTa large (Liu et al., 2019) to a
critical deployment challenge for GPT-3 (Brown et al., 2020) with
175 billion trainable parameters.1
Many sought to mitigate this by adapting only some parameters or
learning external modules for new tasks. This way, we only need
to store and load a small number of task-specific parameters in ad-
dition to the pre-trained model for each task, greatly boosting the
operational efficiency when deployed. However, existing techniques
∗Equal contribution.
0Compared to V1, this draft includes better baselines, experiments on GLUE, and more on adapter latency.
1While GPT-3 175B achieves non-trivial performance with few-shot learning, fine-tuning boosts its perfor-
mance significantly as shown in Appendix A.
1
arXiv:2106.09685v2  [cs.CL]  16 Oct 2021


=== PDF PAGE 2 ===
often introduce inference latency (Houlsby et al., 2019; Rebuffiet al., 2017) by extending model
depth or reduce the model’s usable sequence length (Li & Liang, 2021; Lester et al., 2021; Ham-
bardzumyan et al., 2020; Liu et al., 2021) (Section 3). More importantly, these method often fail to
match the fine-tuning baselines, posing a trade-off between efficiency and model quality.
We take inspiration from Li et al. (2018a); Aghajanyan et al. (2020) which show that the learned
over-parametrized models in fact reside on a low intrinsic dimension. 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, as shown in Figure 1. Using GPT-3
175B as an example, we show that a very low rank (i.e., r in Figure 1 can be one or two) suffices even
when the full rank (i.e., d) is as high as 12,288, making LoRA both storage- and compute-efficient.
LoRA possesses several key advantages.
• A pre-trained model can be shared and used to build many small LoRA modules for dif-
ferent tasks. We can freeze the shared model and efficiently switch tasks by replacing the
matrices A and B in Figure 1, reducing the storage requirement and task-switching over-
head significantly.
• LoRA makes training more efficient and lowers the hardware barrier to entry by up to 3
times when using adaptive optimizers since we do not need to calculate the gradients or
maintain the optimizer states for most parameters. Instead, we only optimize the injected,
much smaller low-rank matrices.
• Our simple linear design allows us to merge the trainable matrices with the frozen weights
when deployed, introducing no inference latency compared to a fully fine-tuned model, by
construction.
• LoRA is orthogonal to many prior methods and can be combined with many of them, such
as prefix-tuning. We provide an example in Appendix E.
Terminologies and Conventions
We make frequent references to the Transformer architecture
and use the conventional terminologies for its dimensions.
We call the input and output di-
mension size of a Transformer layer dmodel.
We use Wq, Wk, Wv, and Wo to refer to the
query/key/value/output projection matrices in the self-attention module. W or W0 refers to a pre-
trained weight matrix and ∆W its accumulated gradient update during adaptation. We use r to
denote the rank of a LoRA module. We follow the conventions set out by (Vaswani et al., 2017;
Brown et al., 2020) and use Adam (Loshchilov & Hutter, 2019; Kingma & Ba, 2017) for model
optimization and use a Transformer MLP feedforward dimension dffn = 4 × dmodel.
2
PROBLEM STATEMENT
While our proposal is agnostic to training objective, we focus on language modeling as our motivat-
ing use case. Below is a brief description of the language modeling problem and, in particular, the
maximization of conditional probabilities given a task-specific prompt.
Suppose we are given a pre-trained autoregressive language model PΦ(y|x) parametrized by Φ.
For instance, PΦ(y|x) can be a generic multi-task learner such as GPT (Radford et al., b; Brown
et al., 2020) based on the Transformer architecture (Vaswani et al., 2017). Consider adapting this
pre-trained model to downstream conditional text generation tasks, such as summarization, machine
reading comprehension (MRC), and natural language to SQL (NL2SQL). Each downstream task is
represented by a training dataset of context-target pairs: Z = {(xi, yi)}i=1,..,N, where both xi and
yi are sequences of tokens. For example, in NL2SQL, xi is a natural language query and yi its
corresponding SQL command; for summarization, xi is the content of an article and yi its summary.
2


=== PDF PAGE 3 ===
During full fine-tuning, the model is initialized to pre-trained weights Φ0 and updated to Φ0 + ∆Φ
by repeatedly following the gradient to maximize the conditional language modeling objective:
max
Φ
X
(x,y)∈Z
|y|
X
t=1
log (PΦ(yt|x, y<t))
(1)
One of the main drawbacks for full fine-tuning is that for each downstream task, we learn a different
set of parameters ∆Φ whose dimension |∆Φ| equals |Φ0|. Thus, if the pre-trained model is large
(such as GPT-3 with |Φ0| ≈175 Billion), storing and deploying many independent instances of
fine-tuned models can be challenging, if at all feasible.
In this paper, we adopt a more parameter-efficient approach, where the task-specific parameter
increment ∆Φ = ∆Φ(Θ) is further encoded by a much smaller-sized set of parameters Θ with
|Θ| ≪|Φ0|. The task of finding ∆Φ thus becomes optimizing over Θ:
max
Θ
X
(x,y)∈Z
|y|
X
t=1
log
[提取字符缺失,参见PDF]pΦ0+∆Φ(Θ)(yt|x, y<t)

(2)
In the subsequent sections, we propose to use a low-rank representation to encode ∆Φ that is both
compute- and memory-efficient. When the pre-trained model is GPT-3 175B, the number of train-
able parameters |Θ| can be as small as 0.01% of |Φ0|.
3
AREN’T EXISTING SOLUTIONS GOOD ENOUGH?
The problem we set out to tackle is by no means new. Since the inception of transfer learning, dozens
of works have sought to make model adaptation more parameter- and compute-efficient. See Sec-
tion 6 for a survey of some of the well-known works. Using language modeling as an example, there
are two prominent strategies when it comes to efficient adaptations: adding adapter layers (Houlsby
et al., 2019; Rebuffiet al., 2017; Pfeiffer et al., 2021; R¨uckl´e et al., 2020) or optimizing some forms
of the input layer activations (Li & Liang, 2021; Lester et al., 2021; Hambardzumyan et al., 2020;
Liu et al., 2021). However, both strategies have their limitations, especially in a large-scale and
latency-sensitive production scenario.
Adapter Layers Introduce Inference Latency
There are many variants of adapters. We focus
on the original design by Houlsby et al. (2019) which has two adapter layers per Transformer block
and a more recent one by Lin et al. (2020) which has only one per block but with an additional
LayerNorm (Ba et al., 2016). While one can reduce the overall latency by pruning layers or exploit-
ing multi-task settings (R¨uckl´e et al., 2020; Pfeiffer et al., 2021), there is no direct ways to bypass
the extra compute in adapter layers. This seems like a non-issue since adapter layers are designed
to have few parameters (sometimes <1% of the original model) by having a small bottleneck di-
mension, which limits the FLOPs they can add. However, large neural networks rely on hardware
parallelism to keep the latency low, and adapter layers have to be processed sequentially. This makes
a difference in the online inference setting where the batch size is typically as small as one. In a
generic scenario without model parallelism, such as running inference on GPT-2 (Radford et al., b)
medium on a single GPU, we see a noticeable increase in latency when using adapters, even with a
very small bottleneck dimension (Table 1).
This problem gets worse when we need to shard the model as done in Shoeybi et al. (2020); Lep-
ikhin et al. (2020), because the additional depth requires more synchronous GPU operations such as
AllReduce and Broadcast, unless we store the adapter parameters redundantly many times.
Directly Optimizing the Prompt is Hard
The other direction, as exemplified by prefix tuning (Li
& 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. We defer the study
on task performance to Section 5.
3


=== PDF PAGE 4 ===
Batch Size
32
16
1
Sequence Length
512
256
128
|Θ|
0.5M
11M
11M
Fine-Tune/LoRA
1449.4±0.8
338.0±0.6
19.8±2.7
AdapterL
1482.0±1.0 (+2.2%)
354.8±0.5 (+5.0%)
23.9±2.1 (+20.7%)
AdapterH
1492.2±1.0 (+3.0%)
366.3±0.5 (+8.4%)
25.8±2.2 (+30.3%)
Table 1: Infernece latency of a single forward pass in GPT-2 medium measured in milliseconds, av-
eraged over 100 trials. We use an NVIDIA Quadro RTX8000. “|Θ|” denotes the number of trainable
parameters in adapter layers. AdapterL and AdapterH are two variants of adapter tuning, which we
describe in Section 5.1. The inference latency introduced by adapter layers can be significant in an
online, short-sequence-length scenario. See the full study in Appendix B.
4
OUR METHOD
We describe the simple design of LoRA and its practical benefits. The principles outlined here apply
to any dense layers in deep learning models, though we only focus on certain weights in Transformer
language models in our experiments as the motivating use case.
4.1
LOW-RANK-PARAMETRIZED UPDATE MATRICES
A neural network contains many dense layers which perform matrix multiplication. The weight
matrices in these layers typically have full-rank. When adapting to a specific task, Aghajanyan et al.
(2020) shows that the pre-trained language models have a low “instrisic dimension” and can still
learn efficiently despite a random projection to a smaller subspace. Inspired by this, we hypothe-
size the updates to the weights also have a low “intrinsic rank” during adaptation. For a pre-trained
weight matrix W0 ∈Rd×k, we constrain its update by representing the latter with a low-rank de-
composition W0 + ∆W = W0 + BA, where B ∈Rd×r, A ∈Rr×k, and the rank r ≪min(d, k).
During training, W0 is frozen and does not receive gradient updates, while A and B contain trainable
parameters. Note both W0 and ∆W = BA are multiplied with the same input, and their respective
output vectors are summed coordinate-wise. For h = W0x, our modified forward pass yields:
h = W0x + ∆Wx = W0x + BAx
(3)
We illustrate our reparametrization in Figure 1. We use a random Gaussian initialization for A and
zero for B, so ∆W = BA is zero at the beginning of training. We then scale ∆Wx by α
r , where α
is a constant in r. When optimizing with Adam, tuning α is roughly the same as tuning the learning
rate if we scale the initialization appropriately. As a result, we simply set α to the first r we try
and do not tune it. This scaling helps to reduce the need to retune hyperparameters when we vary
r (Yang & Hu, 2021).
A Generalization of Full Fine-tuning.
A more general form of fine-tuning allows the training of
a subset of the pre-trained parameters. LoRA takes a step further and does not require the accumu-
lated gradient update to weight matrices to have full-rank during adaptation. This means that when
applying LoRA to all weight matrices and training all biases2, we roughly recover the expressive-
ness of full fine-tuning by setting the LoRA rank r to the rank of the pre-trained weight matrices. In
other words, as we increase the number of trainable parameters 3, training LoRA roughly converges
to training the original model, while adapter-based methods converges to an MLP and prefix-based
methods to a model that cannot take long input sequences.
No Additional Inference Latency.
When deployed in production, we can explicitly compute and
store W = W0 + BA and perform inference as usual. Note that both W0 and BA are in Rd×k.
When we need to switch to another downstream task, we can recover W0 by subtracting BA and
then adding a different B′A′, a quick operation with very little memory overhead. Critically, this
2They represent a negligible number of parameters compared to weights.
3An inevitability when adapting to hard tasks.
4


=== PDF PAGE 5 ===
guarantees that we do not introduce any additional latency during inference compared to a fine-tuned
model by construction.
4.2
APPLYING LORA TO TRANSFORMER
In principle, we can apply LoRA to any subset of weight matrices in a neural network to reduce the
number of trainable parameters. In the Transformer architecture, there are four weight matrices in
the self-attention module (Wq, Wk, Wv, Wo) and two in the MLP module. We treat Wq (or Wk, Wv)
as a single matrix of dimension dmodel ×dmodel, even though the output dimension is usually sliced
into attention heads. We limit our study to only adapting the attention weights for downstream
tasks and freeze the MLP modules (so they are not trained in downstream tasks) both for simplicity
and parameter-efficiency.We further study the effect on adapting different types of attention weight
matrices in a Transformer in Section 7.1. We leave the empirical investigation of adapting the MLP
layers, LayerNorm layers, and biases to a future work.
Practical Benefits and Limitations.
The most significant benefit comes from the reduction in
memory and storage usage. For a large Transformer trained with Adam, we reduce that VRAM
usage by up to 2/3 if r ≪dmodel as we do not need to store the optimizer states for the frozen
parameters. On GPT-3 175B, we reduce the VRAM consumption during training from 1.2TB to
350GB. With r = 4 and only the query and value projection matrices being adapted, the checkpoint
size is reduced by roughly 10,000× (from 350GB to 35MB)4. This allows us to train with signifi-
cantly fewer GPUs and avoid I/O bottlenecks. Another benefit is that we can switch between tasks
while deployed at a much lower cost by only swapping the LoRA weights as opposed to all the
parameters. This allows for the creation of many customized models that can be swapped in and out
on the fly on machines that store the pre-trained weights in VRAM. We also observe a 25% speedup
during training on GPT-3 175B compared to full fine-tuning5 as we do not need to calculate the
gradient for the vast majority of the parameters.
LoRA also has its limitations. For example, it is not straightforward to batch inputs to different tasks
with different A and B in a single forward pass, if one chooses to absorb A and B into W to eliminate
additional inference latency. Though it is possible to not merge the weights and dynamically choose
the LoRA modules to use for samples in a batch for scenarios where latency is not critical.
5
EMPIRICAL EXPERIMENTS
We evaluate the downstream task performance of LoRA on RoBERTa (Liu et al., 2019), De-
BERTa (He et al., 2021), and GPT-2 (Radford et al., b), before scaling up to GPT-3 175B (Brown
et al., 2020). Our experiments cover a wide range of tasks, from natural language understanding
(NLU) to generation (NLG). Specifically, we evaluate on the GLUE (Wang et al., 2019) benchmark
for RoBERTa and DeBERTa. We follow the setup of Li & Liang (2021) on GPT-2 for a direct com-
parison and add WikiSQL (Zhong et al., 2017) (NL to SQL queries) and SAMSum (Gliwa et al.,
2019) (conversation summarization) for large-scale experiments on GPT-3. See Appendix C for
more details on the datasets we use. We use NVIDIA Tesla V100 for all experiments.
5.1
BASELINES
To compare with other baselines broadly, we replicate the setups used by prior work and reuse their
reported numbers whenever possible. This, however, means that some baselines might only appear
in certain experiments.
Fine-Tuning (FT) is a common approach for adaptation. During fine-tuning, the model is initialized
to the pre-trained weights and biases, and all model parameters undergo gradient updates.A simple
variant is to update only some layers while freezing others. We include one such baseline reported
in prior work (Li & Liang, 2021) on GPT-2, which adapts just the last two layers (FTTop2).
4We still need the 350GB model during deployment; however, storing 100 adapted models only requires
350GB + 35MB * 100 ≈354GB as opposed to 100 * 350GB ≈35TB.
5For GPT-3 175B, the training throughput for full fine-tuning is 32.5 tokens/s per V100 GPU; with the same
number of weight shards for model parallelism, the throughput is 43.1 tokens/s per V100 GPU for LoRA.
5


=== PDF PAGE 6 ===
Model & Method # Trainable
Parameters MNLI
SST-2
MRPC
CoLA
QNLI
QQP
RTE
STS-B Avg.
RoBbase (FT)*
125.0M
87.6
94.8
90.2
63.6
92.8
91.9
78.7
91.2
86.4
RoBbase (BitFit)*
0.1M
84.7
93.7
92.7
62.0
91.8
84.0
81.5
90.8
85.2
RoBbase (AdptD)*
0.3M 87.1±.0 94.2±.1 88.5±1.1 60.8±.4 93.1±.1 90.2±.0 71.5±2.7 89.7±.3 84.4
RoBbase (AdptD)*
0.9M 87.3±.1 94.7±.3 88.4±.1
62.6±.9 93.0±.2 90.6±.0 75.9±2.2 90.3±.1 85.4
RoBbase (LoRA)
0.3M 87.5±.3 95.1±.2 89.7±.7 63.4±1.2 93.3±.3 90.8±.1 86.6±.7
91.5±.2 87.2
RoBlarge (FT)*
355.0M
90.2
96.4
90.9
68.0
94.7
92.2
86.6
92.4
88.9
RoBlarge (LoRA)
0.8M 90.6±.2 96.2±.5 90.9±1.2 68.2±1.9 94.9±.3 91.6±.1 87.4±2.5 92.6±.2 89.0
RoBlarge (AdptP)†
3.0M 90.2±.3 96.1±.3 90.2±.7 68.3±1.0 94.8±.2 91.9±.1 83.8±2.9 92.1±.7 88.4
RoBlarge (AdptP)†
0.8M 90.5±.3 96.6±.2 89.7±1.2 67.8±2.5 94.8±.3 91.7±.2 80.1±2.9 91.9±.4 87.9
RoBlarge (AdptH)†
6.0M 89.9±.5 96.2±.3 88.7±2.9 66.5±4.4 94.7±.2 92.1±.1 83.4±1.1 91.0±1.7 87.8
RoBlarge (AdptH)†
0.8M 90.3±.3 96.3±.5 87.7±1.7 66.3±2.0 94.7±.2 91.5±.1 72.9±2.9 91.5±.5 86.4
RoBlarge (LoRA)†
0.8M 90.6±.2 96.2±.5 90.2±1.0 68.2±1.9 94.8±.3 91.6±.2 85.2±1.1 92.3±.5 88.6
DeBXXL (FT)*
1500.0M
91.8
97.2
92.0
72.0
96.0
92.7
93.9
92.9
91.1
DeBXXL (LoRA)
4.7M 91.9±.2 96.9±.2 92.6±.6 72.4±1.1 96.0±.1 92.9±.1 94.9±.4
93.0±.2 91.3
Table 2: RoBERTabase, RoBERTalarge, and DeBERTaXXL with different adaptation methods on the
GLUE benchmark. We report the overall (matched and mismatched) accuracy for MNLI, Matthew’s
correlation for CoLA, Pearson correlation for STS-B, and accuracy for other tasks. Higher is better
for all metrics. * indicates numbers published in prior works. † indicates runs configured in a setup
similar to Houlsby et al. (2019) for a fair comparison.
Bias-only or BitFit is a baseline where we only train the bias vectors while freezing everything else.
Contemporarily, this baseline has also been studied by BitFit (Zaken et al., 2021).
Prefix-embedding tuning (PreEmbed) inserts special tokens among the input tokens. These spe-
cial tokens have trainable word embeddings and are generally not in the model’s vocabulary. Where
to place such tokens can have an impact on performance. We focus on “prefixing”, which prepends
such tokens to the prompt, and “infixing”, which appends to the prompt; both are discussed in Li &
Liang (2021). We use lp (resp. li) denote the number of prefix (resp. infix) tokens. The number of
trainable parameters is |Θ| = dmodel × (lp + li).
Prefix-layer tuning (PreLayer) is an extension to prefix-embedding tuning. Instead of just learning
the word embeddings (or equivalently, the activations after the embedding layer) for some special
tokens, we learn the activations after every Transformer layer. The activations computed from pre-
vious layers are simply replaced by trainable ones. The resulting number of trainable parameters is
|Θ| = L × dmodel × (lp + li), where L is the number of Transformer layers.
Adapter tuning as proposed in Houlsby et al. (2019) inserts adapter layers between the self-
attention module (and the MLP module) and the subsequent residual connection. There are two
fully connected layers with biases in an adapter layer with a nonlinearity in between. We call this
original design AdapterH. Recently, Lin et al. (2020) proposed a more efficient design with the
adapter layer applied only after the MLP module and after a LayerNorm. We call it AdapterL. This
is very similar to another deign proposed in Pfeiffer et al. (2021), which we call AdapterP. We also
include another baseline call AdapterDrop (R¨uckl´e et al., 2020) which drops some adapter layers for
greater efficiency (AdapterD). We cite numbers from prior works whenever possible to maximize
the number of baselines we compare with; they are in rows with an asterisk (*) in the first column.
In all cases, we have |Θ| = ˆLAdpt ×(2×dmodel ×r+r+dmodel)+2× ˆLLN ×dmodel where ˆLAdpt
is the number of adapter layers and ˆLLN the number of trainable LayerNorms (e.g., in AdapterL).
LoRA adds trainable pairs of rank decomposition matrices in parallel to existing weight matrices.
As mentioned in Section 4.2, we only apply LoRA to Wq and Wv in most experiments for simplicity.
The number of trainable parameters is determined by the rank r and the shape of the original weights:
|Θ| = 2 × ˆLLoRA × dmodel × r, where ˆLLoRA is the number of weight matrices we apply LoRA to.
6


=== PDF PAGE 7 ===
Model & Method
# Trainable
E2E NLG Challenge
Parameters
BLEU
NIST
MET
ROUGE-L
CIDEr
GPT-2 M (FT)*
354.92M
68.2
8.62
46.2
71.0
2.47
GPT-2 M (AdapterL)*
0.37M
66.3
8.41
45.0
69.8
2.40
GPT-2 M (AdapterL)*
11.09M
68.9
8.71
46.1
71.3
2.47
GPT-2 M (AdapterH)
11.09M
67.3±.6
8.50±.07
46.0±.2
70.7±.2
2.44±.01
GPT-2 M (FTTop2)*
25.19M
68.1
8.59
46.0
70.8
2.41
GPT-2 M (PreLayer)*
0.35M
69.7
8.81
46.1
71.4
2.49
GPT-2 M (LoRA)
0.35M
70.4±.1
8.85±.02
46.8±.2
71.8±.1
2.53±.02
GPT-2 L (FT)*
774.03M
68.5
8.78
46.0
69.9
2.45
GPT-2 L (AdapterL)
0.88M
69.1±.1
8.68±.03
46.3±.0
71.4±.2
2.49±.0
GPT-2 L (AdapterL)
23.00M
68.9±.3
8.70±.04
46.1±.1
71.3±.2
2.45±.02
GPT-2 L (PreLayer)*
0.77M
70.3
8.85
46.2
71.7
2.47
GPT-2 L (LoRA)
0.77M
70.4±.1
8.89±.02
46.8±.2
72.0±.2
2.47±.02
Table 3: GPT-2 medium (M) and large (L) with different adaptation methods on the E2E NLG
Challenge. For all metrics, higher is better. LoRA outperforms several baselines with comparable
or fewer trainable parameters. Confidence intervals are shown for experiments we ran. * indicates
numbers published in prior works.
5.2
ROBERTA BASE/LARGE
RoBERTa (Liu et al., 2019) optimized the pre-training recipe originally proposed in BERT (Devlin
et al., 2019a) and boosted the latter’s task performance without introducing many more trainable
parameters. While RoBERTa has been overtaken by much larger models on NLP leaderboards
such as the GLUE benchmark (Wang et al., 2019) in recent years, it remains a competitive and
popular pre-trained model for its size among practitioners. We take the pre-trained RoBERTa base
(125M) and RoBERTa large (355M) from the HuggingFace Transformers library (Wolf et al., 2020)
and evaluate the performance of different efficient adaptation approaches on tasks from the GLUE
benchmark. We also replicate Houlsby et al. (2019) and Pfeiffer et al. (2021) according to their
setup. To ensure a fair comparison, we make two crucial changes to how we evaluate LoRA when
comparing with adapters. First, we use the same batch size for all tasks and use a sequence length
of 128 to match the adapter baselines. Second, we initialize the model to the pre-trained model for
MRPC, RTE, and STS-B, not a model already adapted to MNLI like the fine-tuning baseline. Runs
following this more restricted setup from Houlsby et al. (2019) are labeled with †. The result is
presented in Table 2 (Top Three Sections). See Section D.1 for details on the hyperparameters used.
5.3
DEBERTA XXL
DeBERTa (He et al., 2021) is a more recent variant of BERT that is trained on a much larger
scale and performs very competitively on benchmarks such as GLUE (Wang et al., 2019) and Su-
perGLUE (Wang et al., 2020). We evaluate if LoRA can still match the performance of a fully
fine-tuned DeBERTa XXL (1.5B) on GLUE. The result is presented in Table 2 (Bottom Section).
See Section D.2 for details on the hyperparameters used.
5.4
GPT-2 MEDIUM/LARGE
Having shown that LoRA can be a competitive alternative to full fine-tuning on NLU, we hope to
answer if LoRA still prevails on NLG models, such as GPT-2 medium and large (Radford et al.,
b). We keep our setup as close as possible to Li & Liang (2021) for a direct comparison. Due
to space constraint, we only present our result on E2E NLG Challenge (Table 3) in this section.
See Section F.1 for results on WebNLG (Gardent et al., 2017) and DART (Nan et al., 2020). We
include a list of the hyperparameters used in Section D.3.
7


=== PDF PAGE 8 ===
Model&Method
# Trainable
WikiSQL
MNLI-m
SAMSum
Parameters
Acc. (%)
Acc. (%)
R1/R2/RL
GPT-3 (FT)
175,255.8M
73.8
89.5
52.0/28.0/44.5
GPT-3 (BitFit)
14.2M
71.3
91.0
51.3/27.4/43.5
GPT-3 (PreEmbed)
3.2M
63.1
88.6
48.3/24.2/40.5
GPT-3 (PreLayer)
20.2M
70.1
89.5
50.8/27.3/43.5
GPT-3 (AdapterH)
7.1M
71.9
89.8
53.0/28.9/44.8
GPT-3 (AdapterH)
40.1M
73.2
91.5
53.2/29.0/45.1
GPT-3 (LoRA)
4.7M
73.4
91.7
53.8/29.8/45.9
GPT-3 (LoRA)
37.7M
74.0
91.6
53.4/29.2/45.1
Table 4: Performance of different adaptation methods on GPT-3 175B. We report the logical form
validation accuracy on WikiSQL, validation accuracy on MultiNLI-matched, and Rouge-1/2/L on
SAMSum. LoRA performs better than prior approaches, including full fine-tuning. The results
on WikiSQL have a fluctuation around ±0.5%, MNLI-m around ±0.1%, and SAMSum around
±0.2/±0.2/±0.1 for the three metrics.
5.5
SCALING UP TO GPT-3 175B
As a final stress test for LoRA, we scale up to GPT-3 with 175 billion parameters. Due to the high
training cost, we only report the typical standard deviation for a given task over random seeds, as
opposed to providing one for every entry. See Section D.4 for details on the hyperparameters used.
As shown in Table 4, LoRA matches or exceeds the fine-tuning baseline on all three datasets. Note
that not all methods benefit monotonically from having more trainable parameters, as shown in Fig-
ure 2. We observe a significant performance drop when we use more than 256 special tokens for
prefix-embedding tuning or more than 32 special tokens for prefix-layer tuning. This corroborates
similar observations in Li & Liang (2021). While a thorough investigation into this phenomenon
is out-of-scope for this work, we suspect that having more special tokens causes the input distri-
bution to shift further away from the pre-training data distribution. Separately, we investigate the
performance of different adaptation approaches in the low-data regime in Section F.3.
6
7
8
9
10
11
log10 # Trainable Parameters
0.55
0.60
0.65
0.70
0.75
Validation Accuracy
WikiSQL
Method
Fine-Tune
PrefixEmbed
PrefixLayer
Adapter(H)
LoRA
6
7
8
9
10
11
log10 # Trainable Parameters
0.84
0.86
0.88
0.90
0.92
MultiNLI-matched
Figure 2: GPT-3 175B validation accuracy vs. number of trainable parameters of several adaptation
methods on WikiSQL and MNLI-matched. LoRA exhibits better scalability and task performance.
See Section F.2 for more details on the plotted data points.
6
RELATED WORKS
Transformer Language Models.
Transformer (Vaswani et al., 2017) is a sequence-to-sequence
architecture that makes heavy use of self-attention. Radford et al. (a) applied it to autoregressive lan-
guage modeling by using a stack of Transformer decoders. Since then, Transformer-based language
models have dominated NLP, achieving the state-of-the-art in many tasks. A new paradigm emerged
with BERT (Devlin et al., 2019b) and GPT-2 (Radford et al., b) – both are large Transformer lan-
8


=== PDF PAGE 9 ===
guage models trained on a large amount of text – where fine-tuning on task-specific data after pre-
training on general domain data provides a significant performance gain compared to training on
task-specific data directly. Training larger Transformers generally results in better performance and
remains an active research direction. GPT-3 (Brown et al., 2020) is the largest single Transformer
language model trained to-date with 175B parameters.
Prompt Engineering and Fine-Tuning.
While GPT-3 175B can adapt its behavior with just a
few additional training examples, the result depends heavily on the input prompt (Brown et al.,
2020). This necessitates an empirical art of composing and formatting the prompt to maximize a
model’s performance on a desired task, which is known as prompt engineering or prompt hacking.
Fine-tuning retrains a model pre-trained on general domains to a specific task Devlin et al. (2019b);
Radford et al. (a). Variants of it include learning just a subset of the parameters Devlin et al. (2019b);
Collobert & Weston (2008), yet practitioners often retrain all of them to maximize the downstream
performance. However, the enormity of GPT-3 175B makes it challenging to perform fine-tuning in
the usual way due to the large checkpoint it produces and the high hardware barrier to entry since it
has the same memory footprint as pre-training.
Parameter-Efficient Adaptation.
Many have proposed inserting adapter layers between existing
layers in a neural network (Houlsby et al., 2019; Rebuffiet al., 2017; Lin et al., 2020). Our method
uses a similar bottleneck structure to impose a low-rank constraint on the weight updates. The
key functional difference is that our learned weights can be merged with the main weights during
inference, thus not introducing any latency, which is not the case for the adapter layers (Section 3).
A comtenporary extension of adapter is COMPACTER (Mahabadi et al., 2021), which essentially
parametrizes the adapter layers using Kronecker products with some predetermined weight sharing
scheme. Similarly, combining LoRA with other tensor product-based methods could potentially
improve its parameter efficiency, which we leave to future work. More recently, many proposed
optimizing the input word embeddings in lieu of fine-tuning, akin to a continuous and differentiable
generalization of prompt engineering (Li & Liang, 2021; Lester et al., 2021; Hambardzumyan et al.,
2020; Liu et al., 2021). We include comparisons with Li & Liang (2021) in our experiment section.
However, this line of works can only scale up by using more special tokens in the prompt, which
take up available sequence length for task tokens when positional embeddings are learned.
Low-Rank Structures in Deep Learning.
Low-rank structure is very common in machine learn-
ing. A lot of machine learning problems have certain intrinsic low-rank structure (Li et al., 2016;
Cai et al., 2010; Li et al., 2018b; Grasedyck et al., 2013). Moreover, it is known that for many
deep learning tasks, especially those with a heavily over-parametrized neural network, the learned
neural network will enjoy low-rank properties after training (Oymak et al., 2019). Some prior works
even explicitly impose the low-rank constraint when training the original neural network (Sainath
et al., 2013; Povey et al., 2018; Zhang et al., 2014; Jaderberg et al., 2014; Zhao et al., 2016; Kho-
dak et al., 2021; Denil et al., 2014); however, to the best of our knowledge, none of these works
considers low-rank update to a frozen model for adaptation to downstream tasks. In theory liter-
ature, it is known that neural networks outperform other classical learning methods, including the
corresponding (finite-width) neural tangent kernels (Allen-Zhu et al., 2019; Li & Liang, 2018) when
the underlying concept class has certain low-rank structure (Ghorbani et al., 2020; Allen-Zhu & Li,
2019; Allen-Zhu & Li, 2020a). Another theoretical result in Allen-Zhu & Li (2020b) suggests that
low-rank adaptations can be useful for adversarial training. In sum, we believe that our proposed
low-rank adaptation update is well-motivated by the literature.
7
UNDERSTANDING THE LOW-RANK UPDATES
Given the empirical advantage of LoRA, we hope to further explain the properties of the low-rank
adaptation learned from downstream tasks. Note that the low-rank structure not only lowers the
hardware barrier to entry which allows us to run multiple experiments in parallel, but also gives
better interpretability of how the update weights are correlated with the pre-trained weights. We
focus our study on GPT-3 175B, where we achieved the largest reduction of trainable parameters
(up to 10,000×) without adversely affecting task performances.
We perform a sequence of empirical studies to answer the following questions: 1) Given a parameter
budget constraint, which subset of weight matrices in a pre-trained Transformer should we adapt
9


=== PDF PAGE 10 ===
to maximize downstream performance? 2) Is the “optimal” adaptation matrix ∆W really rank-
deficient? If so, what is a good rank to use in practice? 3) What is the connection between ∆W and
W? Does ∆W highly correlate with W? How large is ∆W comparing to W?
We believe that our answers to question (2) and (3) shed light on the fundamental principles of using
pre-trained language models for downstream tasks, which is a critical topic in NLP.
7.1
WHICH WEIGHT MATRICES IN TRANSFORMER SHOULD WE APPLY LORA TO?
Given a limited parameter budget, which types of weights should we adapt with LoRA to obtain
the best performance on downstream tasks? As mentioned in Section 4.2, we only consider weight
matrices in the self-attention module. We set a parameter budget of 18M (roughly 35MB if stored
in FP16) on GPT-3 175B, which corresponds to r = 8 if we adapt one type of attention weights or
r = 4 if we adapt two types, for all 96 layers. The result is presented in Table 5.
# of Trainable Parameters = 18M
Weight Type
Wq
Wk
Wv
Wo
Wq, Wk
Wq, Wv
Wq, Wk, Wv, Wo
Rank r
8
8
8
8
4
4
2
WikiSQL (±0.5%)
70.4
70.0
73.0
73.2
71.4
73.7
73.7
MultiNLI (±0.1%)
91.0
90.8
91.0
91.3
91.3
91.3
91.7
Table 5: Validation accuracy on WikiSQL and MultiNLI after applying LoRA to different types of
attention weights in GPT-3, given the same number of trainable parameters. Adapting both Wq and
Wv gives the best performance overall. We find the standard deviation across random seeds to be
consistent for a given dataset, which we report in the first column.
Note that putting all the parameters in ∆Wq or ∆Wk results in significantly lower performance,
while adapting both Wq and Wv yields the best result. This suggests that even a rank of four
captures enough information in ∆W such that it is preferable to adapt more weight matrices than
adapting a single type of weights with a larger rank.
7.2
WHAT IS THE OPTIMAL RANK r FOR LORA?
We turn our attention to the effect of rank r on model performance.
We adapt {Wq, Wv},
{Wq, Wk, Wv, Wc}, and just Wq for a comparison.
Weight Type
r = 1
r = 2
r = 4
r = 8
r = 64
WikiSQL(±0.5%)
Wq
68.8
69.6
70.5
70.4
70.0
Wq, Wv
73.4
73.3
73.7
73.8
73.5
Wq, Wk, Wv, Wo
74.1
73.7
74.0
74.0
73.9
MultiNLI (±0.1%)
Wq
90.7
90.9
91.1
90.7
90.7
Wq, Wv
91.3
91.4
91.3
91.6
91.4
Wq, Wk, Wv, Wo
91.2
91.7
91.7
91.5
91.4
Table 6: Validation accuracy on WikiSQL and MultiNLI with different rank r. To our surprise, a
rank as small as one suffices for adapting both Wq and Wv on these datasets while training Wq alone
needs a larger r. We conduct a similar experiment on GPT-2 in Section H.2.
Table 6 shows that, surprisingly, LoRA already performs competitively with a very small r (more
so for {Wq, Wv} than just Wq). This suggests the update matrix ∆W could have a very small
“intrinsic rank”.6 To further support this finding, we check the overlap of the subspaces learned by
different choices of r and by different random seeds. We argue that increasing r does not cover a
more meaningful subspace, which suggests that a low-rank adaptation matrix is sufficient.
6However, we do not expect a small r to work for every task or dataset. Consider the following thought
experiment: if the downstream task were in a different language than the one used for pre-training, retraining
the entire model (similar to LoRA with r = dmodel) could certainly outperform LoRA with a small r.
10


=== PDF PAGE 11 ===
Subspace similarity between different r.
Given Ar=8 and Ar=64 which are the learned adapta-
tion matrices with rank r = 8 and 64 using the same pre-trained model, we perform singular value
decomposition and obtain the right-singular unitary matrices UAr=8 and UAr=64.7 We hope to an-
swer: how much of the subspace spanned by the top i singular vectors in UAr=8 (for 1 ≤i ≤8) is
contained in the subspace spanned by top j singular vectors of UAr=64 (for 1 ≤j ≤64)? We mea-
sure this quantity with a normalized subspace similarity based on the Grassmann distance (See Ap-
pendix G for a more formal discussion)
φ(Ar=8, Ar=64, i, j) = ||U i⊤
Ar=8U j
Ar=64||2
F
min(i, j)
∈[0, 1]
(4)
where U i
Ar=8 represents the columns of UAr=8 corresponding to the top-i singular vectors.
φ(·) has a range of [0, 1], where 1 represents a complete overlap of subspaces and 0 a complete
separation. See Figure 3 for how φ changes as we vary i and j. We only look at the 48th layer
(out of 96) due to space constraint, but the conclusion holds for other layers as well, as shown
in Section H.1.
0.0
0.2
0.4
0.6
0.8
1.0
1
6
12
18
23
29
35
40
46
52
58
j
1
2
3
4
5
6
7
8
i
Wq
1
6
12
18
23
29
35
40
46
52
58
j
Wv
1
2
3
4
5
6
7
8
j
Wq
1
2
3
4
5
6
7
8
j
Wv
(Ar = 64, Ar = 8, i, j)
Figure 3: Subspace similarity between column vectors of Ar=8 and Ar=64 for both ∆Wq and ∆Wv.
The third and the fourth figures zoom in on the lower-left triangle in the first two figures. The top
directions in r = 8 are included in r = 64, and vice versa.
We make an important observation from Figure 3.
Directions corresponding to the top singular vector overlap significantly between
Ar=8 and Ar=64, while others do not. Specifically, ∆Wv (resp. ∆Wq) of Ar=8
and ∆Wv (resp. ∆Wq) of Ar=64 share a subspace of dimension 1 with normalized
similarity > 0.5, providing an explanation of why r = 1 performs quite well in our
downstream tasks for GPT-3.
Since both Ar=8 and Ar=64 are learned using the same pre-trained model, Figure 3 indicates that
the top singular-vector directions of Ar=8 and Ar=64 are the most useful, while other directions
potentially contain mostly random noises accumulated during training. Hence, the adaptation matrix
can indeed have a very low rank.
Subspace similarity between different random seeds.
We further confirm this by plotting the
normalized subspace similarity between two randomly seeded runs with r = 64, shown in Figure 4.
∆Wq appears to have a higher “intrinsic rank” than ∆Wv, since more common singular value direc-
tions are learned by both runs for ∆Wq, which is in line with our empirical observation in Table 6.
As a comparison, we also plot two random Gaussian matrices, which do not share any common
singular value directions with each other.
7.3
HOW DOES THE ADAPTATION MATRIX ∆W COMPARE TO W ?
We further investigate the relationship between ∆W and W. In particular, does ∆W highly correlate
with W? (Or mathematically, is ∆W mostly contained in the top singular directions of W?) Also,
7Note that a similar analysis can be carried out with B and the left-singular unitary matrices – we stick with
A for our experiments.
11


=== PDF PAGE 12 ===
0.0
0.1
0.2
0.3
0.4
0.5
1
5
10
15
20
25
30
34
39
44
49
54
59
j
1
8
16
24
32
40
48
56
i
Wq
1
5
10
15
20
25
30
34
39
44
49
54
59
j
(Ar = 64, A′r = 64, i, j)
Wv
1
5
10
15
20
25
30
34
39
44
49
54
59
j
Random Gaussian
Figure 4: Left and Middle: Normalized subspace similarity between the column vectors of Ar=64
from two random seeds, for both ∆Wq and ∆Wv in the 48-th layer. Right: the same heat-map
between the column vectors of two random Gaussian matrices. See Section H.1 for other layers.
how “large” is ∆W comparing to its corresponding directions in W? This can shed light on the
underlying mechanism for adapting pre-trained language models.
To answer these questions, we project W onto the r-dimensional subspace of ∆W by comput-
ing U ⊤WV ⊤, with U/V being the left/right singular-vector matrix of ∆W.
Then, we com-
pare the Frobenius norm between ∥U ⊤WV ⊤∥F and ∥W∥F . As a comparison, we also compute
∥U ⊤WV ⊤∥F by replacing U, V with the top r singular vectors of W or a random matrix.
r = 4
r = 64
∆Wq
Wq
Random
∆Wq
Wq
Random
||U ⊤WqV ⊤||F =
0.32
21.67
0.02
1.90
37.71
0.33
||Wq||F = 61.95
||∆Wq||F = 6.91
||∆Wq||F = 3.57
Table 7: The Frobenius norm of U ⊤WqV ⊤where U and V are the left/right top r singular vector
directions of either (1) ∆Wq, (2) Wq, or (3) a random matrix. The weight matrices are taken from
the 48th layer of GPT-3.
We draw several conclusions from Table 7. First, ∆W has a stronger correlation with W compared
to a random matrix, indicating that ∆W amplifies some features that are already in W. Second,
instead of repeating the top singular directions of W, ∆W only amplifies directions that are not
emphasized in W. Third, the amplification factor is rather huge: 21.5 ≈6.91/0.32 for r = 4.
See Section H.4 for why r = 64 has a smaller amplification factor. We also provide a visualization
in Section H.3 for how the correlation changes as we include more top singular directions from Wq.
This suggests that the low-rank adaptation matrix potentially amplifies the important features for
specific downstream tasks that were learned but not emphasized in the general pre-training model.
8
CONCLUSION AND FUTURE WORK
Fine-tuning enormous language models is prohibitively expensive in terms of the hardware required
and the storage/switching cost for hosting independent instances for different tasks. We propose
LoRA, an efficient adaptation strategy that neither introduces inference latency nor reduces input
sequence length while retaining high model quality. Importantly, it allows for quick task-switching
when deployed as a service by sharing the vast majority of the model parameters. While we focused
on Transformer language models, the proposed principles are generally applicable to any neural
networks with dense layers.
There are many directions for future works. 1) LoRA can be combined with other efficient adapta-
tion methods, potentially providing orthogonal improvement. 2) The mechanism behind fine-tuning
or LoRA is far from clear – how are features learned during pre-training transformed to do well
on downstream tasks? We believe that LoRA makes it more tractable to answer this than full fine-
12


=== PDF PAGE 13 ===
tuning. 3) We mostly depend on heuristics to select the weight matrices to apply LoRA to. Are
there more principled ways to do it? 4) Finally, the rank-deficiency of ∆W suggests that W could
be rank-deficient as well, which can also be a source of inspiration for future works.
REFERENCES
Armen Aghajanyan, Luke Zettlemoyer, and Sonal Gupta. Intrinsic Dimensionality Explains the
Effectiveness of Language Model Fine-Tuning. arXiv:2012.13255 [cs], December 2020. URL
http://arxiv.org/abs/2012.13255.
Zeyuan Allen-Zhu and Yuanzhi Li. What Can ResNet Learn Efficiently, Going Beyond Kernels? In
NeurIPS, 2019. Full version available at http://arxiv.org/abs/1905.10337.
Zeyuan Allen-Zhu and Yuanzhi Li. Backward feature correction: How deep learning performs deep
learning. arXiv preprint arXiv:2001.04413, 2020a.
Zeyuan Allen-Zhu and Yuanzhi Li. Feature purification: How adversarial training performs robust
deep learning. arXiv preprint arXiv:2005.10190, 2020b.
Zeyuan Allen-Zhu, Yuanzhi Li, and Zhao Song. A convergence theory for deep learning via over-
parameterization. In ICML, 2019. Full version available at http://arxiv.org/abs/1811.
03962.
Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E. Hinton. Layer normalization, 2016.
Tom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhari-
wal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, Sandhini Agarwal,
Ariel Herbert-Voss, Gretchen Krueger, Tom Henighan, Rewon Child, Aditya Ramesh, Daniel M.
Ziegler, Jeffrey Wu, Clemens Winter, Christopher Hesse, Mark Chen, Eric Sigler, Mateusz Litwin,
Scott Gray, Benjamin Chess, Jack Clark, Christopher Berner, Sam McCandlish, Alec Radford,
Ilya Sutskever, and Dario Amodei. Language Models are Few-Shot Learners. arXiv:2005.14165
[cs], July 2020. URL http://arxiv.org/abs/2005.14165.
Jian-Feng Cai, Emmanuel J Cand`es, and Zuowei Shen. A singular value thresholding algorithm for
matrix completion. SIAM Journal on optimization, 20(4):1956–1982, 2010.
Daniel Cer, Mona Diab, Eneko Agirre, Inigo Lopez-Gazpio, and Lucia Specia. Semeval-2017 task
1: Semantic textual similarity multilingual and crosslingual focused evaluation. Proceedings of
the 11th International Workshop on Semantic Evaluation (SemEval-2017), 2017. doi: 10.18653/
v1/s17-2001. URL http://dx.doi.org/10.18653/v1/S17-2001.
Ronan Collobert and Jason Weston. A unified architecture for natural language processing: deep
neural networks with multitask learning. In Proceedings of the 25th international conference
on Machine learning, ICML ’08, pp. 160–167, New York, NY, USA, July 2008. Association
for Computing Machinery. ISBN 978-1-60558-205-4. doi: 10.1145/1390156.1390177. URL
https://doi.org/10.1145/1390156.1390177.
Misha Denil, Babak Shakibi, Laurent Dinh, Marc’Aurelio Ranzato, and Nando de Freitas. Predicting
parameters in deep learning, 2014.
Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. Bert: Pre-training of deep
bidirectional transformers for language understanding, 2019a.
Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. BERT: Pre-training of Deep
Bidirectional Transformers for Language Understanding. arXiv:1810.04805 [cs], May 2019b.
URL http://arxiv.org/abs/1810.04805. arXiv: 1810.04805.
William B. Dolan and Chris Brockett. Automatically constructing a corpus of sentential paraphrases.
In Proceedings of the Third International Workshop on Paraphrasing (IWP2005), 2005. URL
https://aclanthology.org/I05-5002.
Claire Gardent, Anastasia Shimorina, Shashi Narayan, and Laura Perez-Beltrachini. The webnlg
challenge: Generating text from rdf data. In Proceedings of the 10th International Conference on
Natural Language Generation, pp. 124–133, 2017.
13


=== PDF PAGE 14 ===
Behrooz Ghorbani, Song Mei, Theodor Misiakiewicz, and Andrea Montanari. When do neural
networks outperform kernel methods? arXiv preprint arXiv:2006.13409, 2020.
Bogdan Gliwa, Iwona Mochol, Maciej Biesek, and Aleksander Wawer. Samsum corpus: A human-
annotated dialogue dataset for abstractive summarization. CoRR, abs/1911.12237, 2019. URL
http://arxiv.org/abs/1911.12237.
Lars Grasedyck, Daniel Kressner, and Christine Tobler.
A literature survey of low-rank tensor
approximation techniques. GAMM-Mitteilungen, 36(1):53–78, 2013.
Jihun Ham and Daniel D. Lee. Grassmann discriminant analysis: a unifying view on subspace-based
learning. In ICML, pp. 376–383, 2008. URL https://doi.org/10.1145/1390156.
1390204.
Karen Hambardzumyan, Hrant Khachatrian, and Jonathan May. WARP: Word-level Adversarial
ReProgramming. arXiv:2101.00121 [cs], December 2020. URL http://arxiv.org/abs/
2101.00121. arXiv: 2101.00121.
Pengcheng He, Xiaodong Liu, Jianfeng Gao, and Weizhu Chen. Deberta: Decoding-enhanced bert
with disentangled attention, 2021.
Neil Houlsby, Andrei Giurgiu, Stanislaw Jastrzebski, Bruna Morrone, Quentin de Laroussilhe,
Andrea Gesmundo, Mona Attariyan, and Sylvain Gelly. Parameter-Efficient Transfer Learning
for NLP. arXiv:1902.00751 [cs, stat], June 2019. URL http://arxiv.org/abs/1902.
00751.
Max Jaderberg, Andrea Vedaldi, and Andrew Zisserman. Speeding up convolutional neural networks
with low rank expansions. arXiv preprint arXiv:1405.3866, 2014.
Mikhail Khodak, Neil Tenenholtz, Lester Mackey, and Nicol`o Fusi. Initialization and regularization
of factorized neural layers, 2021.
Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization, 2017.
Dmitry Lepikhin, HyoukJoong Lee, Yuanzhong Xu, Dehao Chen, Orhan Firat, Yanping Huang,
Maxim Krikun, Noam Shazeer, and Zhifeng Chen. Gshard: Scaling giant models with conditional
computation and automatic sharding, 2020.
Brian Lester, Rami Al-Rfou, and Noah Constant. The Power of Scale for Parameter-Efficient Prompt
Tuning. arXiv:2104.08691 [cs], April 2021. URL http://arxiv.org/abs/2104.08691.
arXiv: 2104.08691.
Chunyuan Li, Heerad Farkhoor, Rosanne Liu, and Jason Yosinski. Measuring the Intrinsic Di-
mension of Objective Landscapes.
arXiv:1804.08838 [cs, stat], April 2018a.
URL http:
//arxiv.org/abs/1804.08838. arXiv: 1804.08838.
Xiang Lisa Li and Percy Liang. Prefix-Tuning: Optimizing Continuous Prompts for Generation.
arXiv:2101.00190 [cs], January 2021. URL http://arxiv.org/abs/2101.00190.
Yuanzhi Li and Yingyu Liang. Learning overparameterized neural networks via stochastic gradient
descent on structured data. In Advances in Neural Information Processing Systems, 2018.
Yuanzhi Li, Yingyu Liang, and Andrej Risteski. Recovery guarantee of weighted low-rank ap-
proximation via alternating minimization. In International Conference on Machine Learning, pp.
2358–2367. PMLR, 2016.
Yuanzhi Li, Tengyu Ma, and Hongyang Zhang. Algorithmic regularization in over-parameterized
matrix sensing and neural networks with quadratic activations. In Conference On Learning The-
ory, pp. 2–47. PMLR, 2018b.
Zhaojiang Lin, Andrea Madotto, and Pascale Fung. Exploring versatile generative language model
via parameter-efficient transfer learning. In Findings of the Association for Computational Lin-
guistics: EMNLP 2020, pp. 441–459, Online, November 2020. Association for Computational
Linguistics.
doi: 10.18653/v1/2020.findings-emnlp.41.
URL https://aclanthology.
org/2020.findings-emnlp.41.
14


=== PDF PAGE 15 ===
Xiao Liu, Yanan Zheng, Zhengxiao Du, Ming Ding, Yujie Qian, Zhilin Yang, and Jie Tang. GPT
Understands, Too. arXiv:2103.10385 [cs], March 2021. URL http://arxiv.org/abs/
2103.10385. arXiv: 2103.10385.
Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike
Lewis, Luke Zettlemoyer, and Veselin Stoyanov. Roberta: A robustly optimized bert pretraining
approach, 2019.
Ilya Loshchilov and Frank Hutter.
Decoupled weight decay regularization.
arXiv preprint
arXiv:1711.05101, 2017.
Ilya Loshchilov and Frank Hutter. Decoupled weight decay regularization, 2019.
Rabeeh Karimi Mahabadi, James Henderson, and Sebastian Ruder. Compacter: Efficient low-rank
hypercomplex adapter layers, 2021.
Linyong Nan, Dragomir Radev, Rui Zhang, Amrit Rau, Abhinand Sivaprasad, Chiachun Hsieh,
Xiangru Tang, Aadit Vyas, Neha Verma, Pranav Krishna, et al. Dart: Open-domain structured
data record to text generation. arXiv preprint arXiv:2007.02871, 2020.
Jekaterina Novikova, Ondˇrej Duˇsek, and Verena Rieser. The e2e dataset: New challenges for end-
to-end generation. arXiv preprint arXiv:1706.09254, 2017.
Samet Oymak, Zalan Fabian, Mingchen Li, and Mahdi Soltanolkotabi.
Generalization guaran-
tees for neural networks via harnessing the low-rank structure of the jacobian. arXiv preprint
arXiv:1906.05392, 2019.
Jonas Pfeiffer, Aishwarya Kamath, Andreas R¨uckl´e, Kyunghyun Cho, and Iryna Gurevych. Adapter-
fusion: Non-destructive task composition for transfer learning, 2021.
Daniel Povey, Gaofeng Cheng, Yiming Wang, Ke Li, Hainan Xu, Mahsa Yarmohammadi, and San-
jeev Khudanpur. Semi-orthogonal low-rank matrix factorization for deep neural networks. In
Interspeech, pp. 3743–3747, 2018.
Alec Radford, Karthik Narasimhan, Tim Salimans, and Ilya Sutskever. Improving Language Under-
standing by Generative Pre-Training. pp. 12, a.
Alec Radford, Jeffrey Wu, Rewon Child, David Luan, Dario Amodei, and Ilya Sutskever. Language
Models are Unsupervised Multitask Learners. pp. 24, b.
Pranav Rajpurkar, Robin Jia, and Percy Liang. Know what you don’t know: Unanswerable questions
for squad. CoRR, abs/1806.03822, 2018. URL http://arxiv.org/abs/1806.03822.
Sylvestre-Alvise Rebuffi, Hakan Bilen, and Andrea Vedaldi. Learning multiple visual domains with
residual adapters. arXiv:1705.08045 [cs, stat], November 2017. URL http://arxiv.org/
abs/1705.08045. arXiv: 1705.08045.
Andreas R¨uckl´e, Gregor Geigle, Max Glockner, Tilman Beck, Jonas Pfeiffer, Nils Reimers, and
Iryna Gurevych. Adapterdrop: On the efficiency of adapters in transformers, 2020.
Tara N Sainath, Brian Kingsbury, Vikas Sindhwani, Ebru Arisoy, and Bhuvana Ramabhadran. Low-
rank matrix factorization for deep neural network training with high-dimensional output targets.
In 2013 IEEE international conference on acoustics, speech and signal processing, pp. 6655–
6659. IEEE, 2013.
Mohammad Shoeybi, Mostofa Patwary, Raul Puri, Patrick LeGresley, Jared Casper, and Bryan
Catanzaro. Megatron-lm: Training multi-billion parameter language models using model par-
allelism, 2020.
Richard Socher, Alex Perelygin, Jean Wu, Jason Chuang, Christopher D. Manning, Andrew Ng,
and Christopher Potts. Recursive deep models for semantic compositionality over a sentiment
treebank. In Proceedings of the 2013 Conference on Empirical Methods in Natural Language
Processing, pp. 1631–1642, Seattle, Washington, USA, October 2013. Association for Computa-
tional Linguistics. URL https://aclanthology.org/D13-1170.
15


=== PDF PAGE 16 ===
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez,
Łukasz Kaiser, and Illia Polosukhin. Attention is all you need. In Proceedings of the 31st In-
ternational Conference on Neural Information Processing Systems, pp. 6000–6010, 2017.
Alex Wang, Amanpreet Singh, Julian Michael, Felix Hill, Omer Levy, and Samuel R. Bowman.
Glue: A multi-task benchmark and analysis platform for natural language understanding, 2019.
Alex Wang, Yada Pruksachatkun, Nikita Nangia, Amanpreet Singh, Julian Michael, Felix Hill, Omer
Levy, and Samuel R. Bowman. Superglue: A stickier benchmark for general-purpose language
understanding systems, 2020.
Alex Warstadt, Amanpreet Singh, and Samuel R Bowman. Neural network acceptability judgments.
arXiv preprint arXiv:1805.12471, 2018.
Adina Williams, Nikita Nangia, and Samuel Bowman. A broad-coverage challenge corpus for sen-
tence understanding through inference.
In Proceedings of the 2018 Conference of the North
American Chapter of the Association for Computational Linguistics: Human Language Technolo-
gies, Volume 1 (Long Papers), pp. 1112–1122, New Orleans, Louisiana, June 2018. Association
for Computational Linguistics. doi: 10.18653/v1/N18-1101. URL https://www.aclweb.
org/anthology/N18-1101.
Thomas Wolf, Lysandre Debut, Victor Sanh, Julien Chaumond, Clement Delangue, Anthony Moi,
Pierric Cistac, Tim Rault, R´emi Louf, Morgan Funtowicz, Joe Davison, Sam Shleifer, Patrick
von Platen, Clara Ma, Yacine Jernite, Julien Plu, Canwen Xu, Teven Le Scao, Sylvain Gug-
ger, Mariama Drame, Quentin Lhoest, and Alexander M. Rush. Transformers: State-of-the-art
natural language processing. In Proceedings of the 2020 Conference on Empirical Methods in
Natural Language Processing: System Demonstrations, pp. 38–45, Online, October 2020. As-
sociation for Computational Linguistics. URL https://www.aclweb.org/anthology/
2020.emnlp-demos.6.
Greg Yang and Edward J. Hu.
Feature Learning in Infinite-Width Neural Networks.
arXiv:2011.14522 [cond-mat], May 2021. URL http://arxiv.org/abs/2011.14522.
arXiv: 2011.14522.
Elad Ben Zaken, Shauli Ravfogel, and Yoav Goldberg. Bitfit: Simple parameter-efficient fine-tuning
for transformer-based masked language-models, 2021.
Yu Zhang, Ekapol Chuangsuwanich, and James Glass. Extracting deep neural network bottleneck
features using low-rank matrix factorization. In 2014 IEEE international conference on acoustics,
speech and signal processing (ICASSP), pp. 185–189. IEEE, 2014.
Yong Zhao, Jinyu Li, and Yifan Gong. Low-rank plus diagonal adaptation for deep neural networks.
In 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP),
pp. 5005–5009. IEEE, 2016.
Victor Zhong, Caiming Xiong, and Richard Socher. Seq2sql: Generating structured queries from
natural language using reinforcement learning. CoRR, abs/1709.00103, 2017. URL http://
arxiv.org/abs/1709.00103.
A
LARGE LANGUAGE MODELS STILL NEED PARAMETER UPDATES
Few-shot learning, or prompt engineering, is very advantageous when we only have a handful of
training samples. However, in practice, we can often afford to curate a few thousand or more training
examples for performance-sensitive applications. As shown in Table 8, fine-tuning improves the
model performance drastically compared to few-shot learning on datasets large and small. We take
the GPT-3 few-shot result on RTE from the GPT-3 paper (Brown et al., 2020). For MNLI-matched,
we use two demonstrations per class and six in-context examples in total.
16


=== PDF PAGE 17 ===
Method
MNLI-m (Val. Acc./%)
RTE (Val. Acc./%)
GPT-3 Few-Shot
40.6
69.0
GPT-3 Fine-Tuned
89.5
85.4
Table 8: Fine-tuning significantly outperforms few-shot learning on GPT-3 (Brown et al., 2020).
B
INFERENCE LATENCY INTRODUCED BY ADAPTER LAYERS
Adapter layers are external modules added to a pre-trained model in a sequential manner, whereas
our proposal, LoRA, can be seen as external modules added in a parallel manner. Consequently,
adapter layers must be computed in addition to the base model, inevitably introducing additional
latency. While as pointed out in R¨uckl´e et al. (2020), the latency introduced by adapter layers can
be mitigated when the model batch size and/or sequence length is large enough to full utilize the
hardware parallelism. We confirm their observation with a similar latency study on GPT-2 medium
and point out that there are scenarios, notably online inference where the batch size is small, where
the added latency can be significant.
We measure the latency of a single forward pass on an NVIDIA Quadro RTX8000 by averaging
over 100 trials. We vary the input batch size, sequence length, and the adapter bottleneck dimension
r. We test two adapter designs: the original one by Houlsby et al. (2019), which we call AdapterH,
and a recent, more efficient variant by Lin et al. (2020), which we call AdapterL. See Section 5.1
for more details on the designs. We plot the slow-down in percentage compared to the no-adapter
baseline in Figure 5.
0
5
10
15
20
25
30
35
0
10
100
250
AdapterH r
Seq Len = 128
Seq Len = 256
Seq Len = 512
1
2
4
8
16
32
Batch Size
0
10
100
250
AdapterL r
1
2
4
8
16
32
Batch Size
1
2
4
8
16
32
Batch Size
Figure 5: Percentage slow-down of inference latency compared to the no-adapter (r = 0) baseline.
The top row shows the result for AdapterH and the bottom row AdapterL. Larger batch size and
sequence length help to mitigate the latency, but the slow-down can be as high as over 30% in an
online, short-sequence-length scenario. We tweak the colormap for better visibility.
C
DATASET DETAILS
GLUE Benchmark is a wide-ranging collection of natural language understanding tasks. It includes
MNLI (inference, Williams et al. (2018)), SST-2 (sentiment analysis, Socher et al. (2013)), MRPC
(paraphrase detection, Dolan & Brockett (2005)), CoLA (linguistic acceptability, Warstadt et al.
(2018)), QNLI (inference, Rajpurkar et al. (2018)), QQP8 (question-answering), RTE (inference),
8https://quoradata.quora.com/First-Quora-Dataset-Release-Question-Pairs
17


=== PDF PAGE 18 ===
and STS-B (textual similarity, Cer et al. (2017)). The broad coverage makes GLUE benchmark a
standard metric to evaluate NLU models such as RoBERTa and DeBERTa. The individual datasets
are released under different permissive licenses.
WikiSQL is introduced in Zhong et al. (2017) and contains 56, 355/8, 421 training/validation ex-
amples. The task is to generate SQL queries from natural language questions and table schemata.
We encode context as x = {table schema, query} and target as y = {SQL}. The dataset is release
under the BSD 3-Clause License.
SAMSum is introduced in Gliwa et al. (2019) and contains 14, 732/819 training/test examples. It
consists of staged chat conversations between two people and corresponding abstractive summaries
written by linguists. We encode context as ”\n” concatenated utterances followed by a ”\n\n”,
and target as y = {summary}. The dataset is released under the non-commercial licence: Creative
Commons BY-NC-ND 4.0.
E2E NLG Challenge was first introduced in Novikova et al. (2017) as a dataset for training end-to-
end, data-driven natural language generation systems and is commonly used for data-to-text evalua-
tion. The E2E dataset consists of roughly 42, 000 training, 4, 600 validation, and 4, 600 test exam-
ples from the restaurant domain. Each source table used as input can have multiple references. Each
sample input (x, y) consists of a sequence of slot-value pairs, along with a corresponding natural
language reference text. The dataset is released under Creative Commons BY-NC-SA 4.0.
DART is an open-domain data-to-text dataset described in Nan et al. (2020). DART inputs are
structured as sequences of ENTITY — RELATION — ENTITY triples. With 82K examples in
total, DART is a significantly larger and more complex data-to-text task compared to E2E. The
dataset is released under the MIT license.
WebNLG is another commonly used dataset for data-to-text evaluation (Gardent et al., 2017). With
22K examples in total WebNLG comprises 14 distinct categories, nine of which are seen during
training. Since five of the 14 total categories are not seen during training, but are represented in
the test set, evaluation is typically broken out by “seen” categories (S), “unseen” categories (U)
and “all” (A). Each input example is represented by a sequence of SUBJECT — PROPERTY —
OBJECT triples. The dataset is released under Creative Commons BY-NC-SA 4.0.
D
HYPERPARAMETERS USED IN EXPERIMENTS
D.1
ROBERTA
We train using AdamW with a linear learning rate decay schedule. We sweep learning rate, number
of training epochs, and batch size for LoRA. Following Liu et al. (2019), we initialize the LoRA
modules to our best MNLI checkpoint when adapting to MRPC, RTE, and STS-B, instead of the
usual initialization; the pre-trained model stays frozen for all tasks. We report the median over 5
random seeds; the result for each run is taken from the best epoch. For a fair comparison with the
setup in Houlsby et al. (2019) and Pfeiffer et al. (2021), we restrict the model sequence length to 128
and used a fixed batch size for all tasks. Importantly, we start with the pre-trained RoBERTa large
model when adapting to MRPC, RTE, and STS-B, instead of a model already adapted to MNLI.
The runs with this restricted setup are marked with †. See the hyperparameters used in our runs
in Table 9.
D.2
DEBERTA
We again train using AdamW with a linear learning rate decay schedule. Following He et al. (2021),
we tune learning rate, dropout probability, warm-up steps, and batch size. We use the same model
sequence length used by (He et al., 2021) to keep our comparison fair. Following He et al. (2021),
we initialize the LoRA modules to our best MNLI checkpoint when adapting to MRPC, RTE, and
STS-B, instead of the usual initialization; the pre-trained model stays frozen for all tasks. We report
the median over 5 random seeds; the result for each run is taken from the best epoch. See the
hyperparameters used in our runs in Table 10.
18


=== PDF PAGE 19 ===
Method
Dataset
MNLI
SST-2
MRPC
CoLA
QNLI
QQP
RTE
STS-B
Optimizer
AdamW
Warmup Ratio
0.06
LR Schedule
Linear
RoBERTa base
LoRA
Batch Size
16
16
16
32
32
16
32
16
# Epochs
30
60
30
80
25
25
80
40
Learning Rate
5E-04
5E-04
4E-04
4E-04
4E-04
5E-04
5E-04
4E-04
LoRA Config.
rq = rv = 8
LoRA α
8
Max Seq. Len.
512
RoBERTa large
LoRA
Batch Size
4
4
4
4
4
4
8
8
# Epochs
10
10
20
20
10
20
20
30
Learning Rate
3E-04
4E-04
3E-04
2E-04
2E-04
3E-04
4E-04
2E-04
LoRA Config.
rq = rv = 8
LoRA α
16
Max Seq. Len.
128
128
512
128
512
512
512
512
RoBERTa large
LoRA†
Batch Size
4
# Epochs
10
10
20
20
10
20
20
10
Learning Rate
3E-04
4E-04
3E-04
2E-04
2E-04
3E-04
4E-04
2E-04
LoRA Config.
rq = rv = 8
LoRA α
16
Max Seq. Len.
128
RoBERTa large
AdptP (3M)†
Batch Size
32
# Epochs
10
20
20
20
10
20
20
20
Learning Rate
3E-05
3E-05
3E-04
3E-04
3E-04
3E-04
3E-04
3E-04
Bottleneck r
64
Max Seq. Len.
128
RoBERTa large
AdptP (0.8M)†
Batch Size
32
# Epochs
5
20
20
20
10
20
20
20
Learning Rate
3E-04
3E-04
3E-04
3E-04
3E-04
3E-04
3E-04
3E-04
Bottleneck r
16
Max Seq. Len.
128
RoBERTa large
AdptH (6M)†
Batch Size
32
# Epochs
10
5
10
10
5
20
20
10
Learning Rate
3E-05
3E-04
3E-04
3E-04
3E-04
3E-04
3E-04
3E-04
Bottleneck r
64
Max Seq. Len.
128
RoBERTa large
AdptH (0.8M)†
Batch Size
32
# Epochs
10
5
10
10
5
20
20
10
Learning Rate
3E-04
3E-04
3E-04
3E-04
3E-04
3E-04
3E-04
3E-04
Bottleneck r
8
Max Seq. Len.
128
Table 9: The hyperparameters we used for RoBERTa on the GLUE benchmark.
D.3
GPT-2
We train all of our GPT-2 models using AdamW (Loshchilov & Hutter, 2017) with a linear learning
rate schedule for 5 epochs. We use the batch size, learning rate, and beam search beam size described
in Li & Liang (2021). Accordingly, we also tune the above hyperparameters for LoRA. We report the
mean over 3 random seeds; the result for each run is taken from the best epoch. The hyperparameters
used for LoRA in GPT-2 are listed in Table 11. For those used for other baselines, see Li & Liang
(2021).
D.4
GPT-3
For all GPT-3 experiments, we train using AdamW (Loshchilov & Hutter, 2017) for 2 epochs with
a batch size of 128 samples and a weight decay factor of 0.1. We use a sequence length of 384 for
19


=== PDF PAGE 20 ===
Method
Dataset
MNLI
SST-2
MRPC
CoLA
QNLI
QQP
RTE
STS-B
Optimizer
AdamW
Warmup Ratio
0.1
LR Schedule
Linear
DeBERTa XXL
LoRA
Batch Size
8
8
32
4
6
8
4
4
# Epochs
5
16
30
10
8
11
11
10
Learning Rate
1E-04
6E-05
2E-04
1E-04
1E-04
1E-04
2E-04
2E-04
Weight Decay
0
0.01
0.01
0
0.01
0.01
0.01
0.1
CLS Dropout
0.15
0
0
0.1
0.1
0.2
0.2
0.2
LoRA Config.
rq = rv = 8
LoRA α
8
Max Seq. Len.
256
128
128
64
512
320
320
128
Table 10: The hyperparameters for DeBERTa XXL on tasks included in the GLUE benchmark.
Dataset
E2E
WebNLG
DART
Training
Optimizer
AdamW
Weight Decay
0.01
0.01
0.0
Dropout Prob
0.1
0.1
0.0
Batch Size
8
# Epoch
5
Warmup Steps
500
Learning Rate Schedule
Linear
Label Smooth
0.1
0.1
0.0
Learning Rate
0.0002
Adaptation
rq = rv = 4
LoRA α
32
Inference
Beam Size
10
Length Penalty
0.9
0.8
0.8
no repeat ngram size
4
Table 11: The hyperparameters for GPT-2 LoRA on E2E, WebNLG and DART.
WikiSQL (Zhong et al., 2017), 768 for MNLI (Williams et al., 2018), and 2048 for SAMSum (Gliwa
et al., 2019). We tune learning rate for all method-dataset combinations. See Section D.4 for more
details on the hyperparameters used. For prefix-embedding tuning, we find the optimal lp and li
to be 256 and 8, respectively, totalling 3.2M trainable parameters. We use lp = 8 and li = 8 for
prefix-layer tuning with 20.2M trainable parameters to obtain the overall best performance. We
present two parameter budgets for LoRA: 4.7M (rq = rv = 1 or rv = 2) and 37.7M (rq = rv = 8
or rq = rk = rv = ro = 2). We report the best validation performance from each run. The training
hyperparameters used in our GPT-3 experiments are listed in Table 12.
E
COMBINING LORA WITH PREFIX TUNING
LoRA can be naturally combined with existing prefix-based approaches. In this section, we evaluate
two combinations of LoRA and variants of prefix-tuning on WikiSQL and MNLI.
LoRA+PrefixEmbed (LoRA+PE) combines LoRA with prefix-embedding tuning, where we insert
lp + li special tokens whose embeddings are treated as trainable parameters. For more on prefix-
embedding tuning, see Section 5.1.
LoRA+PrefixLayer (LoRA+PL) combines LoRA with prefix-layer tuning. We also insert lp + li
special tokens; however, instead of letting the hidden representations of these tokens evolve natu-
20


=== PDF PAGE 21 ===
Hyperparameters
Fine-Tune
PreEmbed
PreLayer
BitFit
AdapterH
LoRA
Optimizer
AdamW
Batch Size
128
# Epoch
2
Warmup Tokens
250,000
LR Schedule
Linear
Learning Rate
5.00E-06
5.00E-04
1.00E-04
1.6E-03
1.00E-04
2.00E-04
Table 12: The training hyperparameters used for different GPT-3 adaption methods. We use the
same hyperparameters for all datasets after tuning learning rate.
rally, we replace them after every Transformer block with an input agnostic vector. Thus, both the
embeddings and subsequent Transformer block activations are treated as trainable parameters. For
more on prefix-layer tuning, see Section 5.1.
In Table 15, we show the evaluation results of LoRA+PE and LoRA+PL on WikiSQL and MultiNLI.
First of all, LoRA+PE significantly outperforms both LoRA and prefix-embedding tuning on
WikiSQL, which indicates that LoRA is somewhat orthogonal to prefix-embedding tuning. On
MultiNLI, the combination of LoRA+PE doesn’t perform better than LoRA, possibly because LoRA
on its own already achieves performance comparable to the human baseline. Secondly, we notice
that LoRA+PL performs slightly worse than LoRA even with more trainable parameters. We at-
tribute this to the fact that prefix-layer tuning is very sensitive to the choice of learning rate and thus
makes the optimization of LoRA weights more difficult in LoRA+PL.
F
ADDITIONAL EMPIRICAL EXPERIMENTS
F.1
ADDITIONAL EXPERIMENTS ON GPT-2
We also repeat our experiment on DART (Nan et al., 2020) and WebNLG (Gardent et al., 2017)
following the setup of Li & Liang (2021). The result is shown in Table 13. Similar to our result
on E2E NLG Challenge, reported in Section 5, LoRA performs better than or at least on-par with
prefix-based approaches given the same number of trainable parameters.
Method
# Trainable
DART
Parameters
BLEU↑
MET↑
TER↓
GPT-2 Medium
Fine-Tune
354M
46.2
0.39
0.46
AdapterL
0.37M
42.4
0.36
0.48
AdapterL
11M
45.2
0.38
0.46
FTTop2
24M
41.0
0.34
0.56
PrefLayer
0.35M
46.4
0.38
0.46
LoRA
0.35M
47.1±.2
0.39
0.46
GPT-2 Large
Fine-Tune
774M
47.0
0.39
0.46
AdapterL
0.88M
45.7±.1
0.38
0.46
AdapterL
23M
47.1±.1
0.39
0.45
PrefLayer
0.77M
46.7
0.38
0.45
LoRA
0.77M
47.5±.1
0.39
0.45
Table 13: GPT-2 with different adaptation methods on DART. The variances of MET and TER are
less than 0.01 for all adaption approaches.
21


=== PDF PAGE 22 ===
Method
WebNLG
BLEU↑
MET↑
TER↓
U
S
A
U
S
A
U
S
A
GPT-2 Medium
Fine-Tune (354M)
27.7
64.2
46.5
.30
.45
.38
.76
.33
.53
AdapterL (0.37M)
45.1
54.5
50.2
.36
.39
.38
.46
.40
.43
AdapterL (11M)
48.3
60.4
54.9
.38
.43
.41
.45
.35
.39
FTTop2 (24M)
18.9
53.6
36.0
.23
.38
.31
.99
.49
.72
Prefix (0.35M)
45.6
62.9
55.1
.38
.44
.41
.49
.35
.40
LoRA (0.35M)
46.7±.4
62.1±.2
55.3±.2
.38
.44
.41
.46
.33
.39
GPT-2 Large
Fine-Tune (774M)
43.1
65.3
55.5
.38
.46
.42
.53
.33
.42
AdapterL (0.88M)
49.8±.0
61.1±.0
56.0±.0
.38
.43
.41
.44
.35
.39
AdapterL (23M)
49.2±.1
64.7±.2
57.7±.1
.39
.46
.43
.46
.33
.39
Prefix (0.77M)
47.7
63.4
56.3
.39
.45
.42
.48
.34
.40
LoRA (0.77M)
48.4±.3
64.0±.3
57.0±.1
.39
.45
.42
.45
.32
.38
Table 14: GPT-2 with different adaptation methods on WebNLG. The variances of MET and TER
are less than 0.01 for all the experiments we ran. “U” indicates unseen categories, “S” indicates seen
categories, and “A” indicates all categories in the test set of WebNLG.
F.2
ADDITIONAL EXPERIMENTS ON GPT-3
We present additional runs on GPT-3 with different adaptation methods in Table 15. The focus is on
identifying the trade-off between performance and the number of trainable parameters.
F.3
LOW-DATA REGIME
To evaluate the performance of different adaptation approaches in the low-data regime. we randomly
sample 100, 1k and 10k training examples from the full training set of MNLI to form the low-data
MNLI-n tasks. In Table 16, we show the performance of different adaptation approaches on MNLI-
n. To our surprise, PrefixEmbed and PrefixLayer performs very poorly on MNLI-100 dataset, with
PrefixEmbed performing only slightly better than random chance (37.6% vs. 33.3%). PrefixLayer
performs better than PrefixEmbed but is still significantly worse than Fine-Tune or LoRA on MNLI-
100. The gap between prefix-based approaches and LoRA/Fine-tuning becomes smaller as we in-
crease the number of training examples, which might suggest that prefix-based approaches are not
suitable for low-data tasks in GPT-3. LoRA achieves better performance than fine-tuning on both
MNLI-100 and MNLI-Full, and comparable results on MNLI-1k and MNLI-10K considering the
(±0.3) variance due to random seeds.
The training hyperparameters of different adaptation approaches on MNLI-n are reported in Ta-
ble 17. We use a smaller learning rate for PrefixLayer on the MNLI-100 set, as the training loss does
not decrease with a larger learning rate.
G
MEASURING SIMILARITY BETWEEN SUBSPACES
In this paper we use the measure φ(A, B, i, j) = ψ(U i
A, U j
B) = ∥U i⊤
A UB∥2
F
min{i,j}
to measure the subspace
similarity between two column orthonormal matrices U i
A ∈Rd×i and U j
B ∈Rd×j, obtained by
taking columns of the left singular matrices of A and B. We point out that this similarity is simply
a reverse of the standard Projection Metric that measures distance between subspaces Ham & Lee
(2008).
22


=== PDF PAGE 23 ===
Method
Hyperparameters
# Trainable Parameters
WikiSQL
MNLI-m
Fine-Tune
-
175B
73.8
89.5
PrefixEmbed
lp = 32, li = 8
0.4 M
55.9
84.9
lp = 64, li = 8
0.9 M
58.7
88.1
lp = 128, li = 8
1.7 M
60.6
88.0
lp = 256, li = 8
3.2 M
63.1
88.6
lp = 512, li = 8
6.4 M
55.9
85.8
PrefixLayer
lp = 2, li = 2
5.1 M
68.5
89.2
lp = 8, li = 0
10.1 M
69.8
88.2
lp = 8, li = 8
20.2 M
70.1
89.5
lp = 32, li = 4
44.1 M
66.4
89.6
lp = 64, li = 0
76.1 M
64.9
87.9
AdapterH
r = 1
7.1 M
71.9
89.8
r = 4
21.2 M
73.2
91.0
r = 8
40.1 M
73.2
91.5
r = 16
77.9 M
73.2
91.5
r = 64
304.4 M
72.6
91.5
LoRA
rv = 2
4.7 M
73.4
91.7
rq = rv = 1
4.7 M
73.4
91.3
rq = rv = 2
9.4 M
73.3
91.4
rq = rk = rv = ro = 1
9.4 M
74.1
91.2
rq = rv = 4
18.8 M
73.7
91.3
rq = rk = rv = ro = 2
18.8 M
73.7
91.7
rq = rv = 8
37.7 M
73.8
91.6
rq = rk = rv = ro = 4
37.7 M
74.0
91.7
rq = rv = 64
301.9 M
73.6
91.4
rq = rk = rv = ro = 64
603.8 M
73.9
91.4
LoRA+PE
rq = rv = 8, lp = 8, li = 4
37.8 M
75.0
91.4
rq = rv = 32, lp = 8, li = 4
151.1 M
75.9
91.1
rq = rv = 64, lp = 8, li = 4
302.1 M
76.2
91.3
LoRA+PL
rq = rv = 8, lp = 8, li = 4
52.8 M
72.9
90.2
Table 15: Hyperparameter analysis of different adaptation approaches on WikiSQL and MNLI. Both
prefix-embedding tuning (PrefixEmbed) and prefix-layer tuning (PrefixLayer) perform worse as we
increase the number of trainable parameters, while LoRA’s performance stabilizes. Performance is
measured in validation accuracy.
Method
MNLI(m)-100
MNLI(m)-1k
MNLI(m)-10k
MNLI(m)-392K
GPT-3 (Fine-Tune)
60.2
85.8
88.9
89.5
GPT-3 (PrefixEmbed)
37.6
75.2
79.5
88.6
GPT-3 (PrefixLayer)
48.3
82.5
85.9
89.6
GPT-3 (LoRA)
63.8
85.6
89.2
91.7
Table 16: Validation accuracy of different methods on subsets of MNLI using GPT-3 175B. MNLI-
n describes a subset with n training examples. We evaluate with the full validation set. LoRA
performs exhibits favorable sample-efficiency compared to other methods, including fine-tuning.
To be concrete, let the singular values of U i⊤
A U j
B to be σ1, σ2, · · · , σp where p = min{i, j}. We
know that the Projection Metric Ham & Lee (2008) is defined as:
d(U i
A, U j
B) =
v
u
u
tp −
p
X
i=1
σ2
i ∈[0, √p]
23


=== PDF PAGE 24 ===
Hyperparameters
Adaptation
MNLI-100
MNLI-1k
MNLI-10K
MNLI-392K
Optimizer
-
AdamW
Warmup Tokens
-
250,000
LR Schedule
-
Linear
Batch Size
-
20
20
100
128
# Epoch
-
40
40
4
2
Learning Rate
FineTune
5.00E-6
PrefixEmbed
2.00E-04
2.00E-04
4.00E-04
5.00E-04
PrefixLayer
5.00E-05
5.00E-05
5.00E-05
1.00E-04
LoRA
2.00E-4
PrefixEmbed lp
16
32
64
256
Adaptation-
PrefixEmbed li
8
Specific
PrefixTune
lp = li = 8
LoRA
rq = rv = 8
Table 17: The hyperparameters used for different GPT-3 adaptation methods on MNLI(m)-n.
where our similarity is defined as:
φ(A, B, i, j) = ψ(U i
A, U j
B) =
Pp
i=1 σ2
i
p
= 1
p

1 −d(U i
A, U j
B)2
This similarity satisfies that if U i
A and U j
B share the same column span, then φ(A, B, i, j) = 1. If
they are completely orthogonal, then φ(A, B, i, j) = 0. Otherwise, φ(A, B, i, j) ∈(0, 1).
H
ADDITIONAL EXPERIMENTS ON LOW-RANK MATRICES
We present additional results from our investigation into the low-rank update matrices.
H.1
CORRELATION BETWEEN LORA MODULES
See Figure 6 and Figure 7 for how the results presented in Figure 3 and Figure 4 generalize to other
layers.
H.2
EFFECT OF r ON GPT-2
We repeat our experiment on the effect of r (Section 7.2) in GPT-2. Using the E2E NLG Challenge
dataset as an example, we report the validation loss and test metrics achieved by different choices
of r after training for 26,000 steps. We present our result in Table 18. The optimal rank for GPT-2
Medium is between 4 and 16 depending on the metric used, which is similar to that for GPT-3 175B.
Note that the relationship between model size and the optimal rank for adaptation is still an open
question.
H.3
CORRELATION BETWEEN W AND ∆W
See Figure 8 for the normalized subspace similarity between W and ∆W with varying r.
Note again that ∆W does not contain the top singular directions of W, since the similarity between
the top 4 directions in ∆W and the top-10% of those in W barely exceeds 0.2. This gives evidence
that ∆W contains those “task-specific” directions that are otherwise not emphasized in W.
An interesting next question to answer, is how “strong” do we need to amplify those task-specific
directions, in order for the model adaptation to work well?
24


=== PDF PAGE 25 ===
0.0
0.2
0.4
0.6
0.8
1.0
1
2
3
4
5
6
7
8
Layer 1
i
Wq
Wv
Wq
Wv
1
2
3
4
5
6
7
8
Layer 32
i
1
2
3
4
5
6
7
8
Layer 64
i
1
6
12
18
23
29
35
40
46
52
58
j
1
2
3
4
5
6
7
8
Layer 96
i
1
6
12
18
23
29
35
40
46
52
58
j
1
2
3
4
5
6
7
8
j
1
2
3
4
5
6
7
8
j
(Ar = 8, Ar = 64, i, j)
Figure 6: Normalized subspace similarity between the column vectors of Ar=8 and Ar=64 for both
∆Wq and ∆Wv from the 1st, 32nd, 64th, and 96th layers in a 96-layer Transformer.
H.4
AMPLIFICATION FACTOR
One can naturally consider a feature amplification factor as the ratio
∥∆W ∥F
∥U ⊤W V ⊤∥F , where U and V
are the left- and right-singular matrices of the SVD decomposition of ∆W. (Recall UU ⊤WV ⊤V
gives the “projection” of W onto the subspace spanned by ∆W.)
Intuitively, when ∆W mostly contains task-specific directions, this quantity measures how much of
them are amplified by ∆W. As shown in Section 7.3, for r = 4, this amplification factor is as large
as 20. In other words, there are (generally speaking) four feature directions in each layer (out of the
entire feature space from the pre-trained model W), that need to be amplified by a very large factor
20, in order to achieve our reported accuracy for the downstream specific task. And, one should
expect a very different set of feature directions to be amplified for each different downstream task.
One may notice, however, for r = 64, this amplification factor is only around 2, meaning that
most directions learned in ∆W with r = 64 are not being amplified by much. This should not
be surprising, and in fact gives evidence (once again) that the intrinsic rank needed to represent
the “task-specific directions” (thus for model adaptation) is low. In contrast, those directions in the
rank-4 version of ∆W (corresponding to r = 4) are amplified by a much larger factor 20.
25


=== PDF PAGE 26 ===
0.0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
1
7
13
19
25
31
37
43
49
55
61
Layer 1
i
Wq
Wv
Layer 32
Wq
Wv
1
6
11
16
21
26
31
36
41
46
51
56
61
j
1
7
13
19
25
31
37
43
49
55
61
Layer 64
i
1
6
11
16
21
26
31
36
41
46
51
56
61
j
1
6
11
16
21
26
31
36
41
46
51
56
61
j
Layer 96
1
6
11
16
21
26
31
36
41
46
51
56
61
j
(Ar = 64, A′r = 64, i, j)
Figure 7: Normalized subspace similarity between the column vectors of Ar=64 from two randomly
seeded runs, for both ∆Wq and ∆Wv from the 1st, 32nd, 64th, and 96th layers in a 96-layer Trans-
former.
Rank r
val loss
BLEU
NIST
METEOR
ROUGE L
CIDEr
1
1.23
68.72
8.7215
0.4565
0.7052
2.4329
2
1.21
69.17
8.7413
0.4590
0.7052
2.4639
4
1.18
70.38
8.8439
0.4689
0.7186
2.5349
8
1.17
69.57
8.7457
0.4636
0.7196
2.5196
16
1.16
69.61
8.7483
0.4629
0.7177
2.4985
32
1.16
69.33
8.7736
0.4642
0.7105
2.5255
64
1.16
69.24
8.7174
0.4651
0.7180
2.5070
128
1.16
68.73
8.6718
0.4628
0.7127
2.5030
256
1.16
68.92
8.6982
0.4629
0.7128
2.5012
512
1.16
68.78
8.6857
0.4637
0.7128
2.5025
1024
1.17
69.37
8.7495
0.4659
0.7149
2.5090
Table 18: Validation loss and test set metrics on E2E NLG Challenge achieved by LoRA with
different rank r using GPT-2 Medium. Unlike on GPT-3 where r = 1 suffices for many tasks, here
the performance peaks at r = 16 for validation loss and r = 4 for BLEU, suggesting the GPT-2
Medium has a similar intrinsic rank for adaptation compared to GPT-3 175B. Note that some of our
hyperparameters are tuned on r = 4, which matches the parameter count of another baseline, and
thus might not be optimal for other choices of r.
0.100
0.125
0.150
0.175
0.200
j
451
555
658
762
865
969
1072
1176
i
(Wq, Ar = 4, i, j)
j
Wq
(Wq, Ar = 8, i, j)
j
(Wq, Ar = 64, i, j)
j
Random
(Wq, Arand, i, j)
Figure 8: Normalized subspace similarity between the singular directions of Wq and those of ∆Wq
with varying r and a random baseline. ∆Wq amplifies directions that are important but not empha-
sized in W. ∆W with a larger r tends to pick up more directions that are already emphasized in
W.
26