peft-sparta 0.0.1__tar.gz
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- peft_sparta-0.0.1/LICENSE +203 -0
- peft_sparta-0.0.1/PKG-INFO +375 -0
- peft_sparta-0.0.1/README.md +359 -0
- peft_sparta-0.0.1/pyproject.toml +26 -0
- peft_sparta-0.0.1/setup.cfg +4 -0
- peft_sparta-0.0.1/src/peft_sparta/__init__.py +4 -0
- peft_sparta-0.0.1/src/peft_sparta/loader.py +239 -0
- peft_sparta-0.0.1/src/peft_sparta/metrics.py +24 -0
- peft_sparta-0.0.1/src/peft_sparta/sparta.py +335 -0
- peft_sparta-0.0.1/src/peft_sparta.egg-info/PKG-INFO +375 -0
- peft_sparta-0.0.1/src/peft_sparta.egg-info/SOURCES.txt +12 -0
- peft_sparta-0.0.1/src/peft_sparta.egg-info/dependency_links.txt +1 -0
- peft_sparta-0.0.1/src/peft_sparta.egg-info/requires.txt +3 -0
- peft_sparta-0.0.1/src/peft_sparta.egg-info/top_level.txt +1 -0
|
@@ -0,0 +1,203 @@
|
|
|
1
|
+
|
|
2
|
+
Apache License
|
|
3
|
+
Version 2.0, January 2004
|
|
4
|
+
http://www.apache.org/licenses/
|
|
5
|
+
|
|
6
|
+
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
|
7
|
+
|
|
8
|
+
1. Definitions.
|
|
9
|
+
|
|
10
|
+
"License" shall mean the terms and conditions for use, reproduction,
|
|
11
|
+
and distribution as defined by Sections 1 through 9 of this document.
|
|
12
|
+
|
|
13
|
+
"Licensor" shall mean the copyright owner or entity authorized by
|
|
14
|
+
the copyright owner that is granting the License.
|
|
15
|
+
|
|
16
|
+
"Legal Entity" shall mean the union of the acting entity and all
|
|
17
|
+
other entities that control, are controlled by, or are under common
|
|
18
|
+
control with that entity. For the purposes of this definition,
|
|
19
|
+
"control" means (i) the power, direct or indirect, to cause the
|
|
20
|
+
direction or management of such entity, whether by contract or
|
|
21
|
+
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
|
22
|
+
outstanding shares, or (iii) beneficial ownership of such entity.
|
|
23
|
+
|
|
24
|
+
"You" (or "Your") shall mean an individual or Legal Entity
|
|
25
|
+
exercising permissions granted by this License.
|
|
26
|
+
|
|
27
|
+
"Source" form shall mean the preferred form for making modifications,
|
|
28
|
+
including but not limited to software source code, documentation
|
|
29
|
+
source, and configuration files.
|
|
30
|
+
|
|
31
|
+
"Object" form shall mean any form resulting from mechanical
|
|
32
|
+
transformation or translation of a Source form, including but
|
|
33
|
+
not limited to compiled object code, generated documentation,
|
|
34
|
+
and conversions to other media types.
|
|
35
|
+
|
|
36
|
+
"Work" shall mean the work of authorship, whether in Source or
|
|
37
|
+
Object form, made available under the License, as indicated by a
|
|
38
|
+
copyright notice that is included in or attached to the work
|
|
39
|
+
(an example is provided in the Appendix below).
|
|
40
|
+
|
|
41
|
+
"Derivative Works" shall mean any work, whether in Source or Object
|
|
42
|
+
form, that is based on (or derived from) the Work and for which the
|
|
43
|
+
editorial revisions, annotations, elaborations, or other modifications
|
|
44
|
+
represent, as a whole, an original work of authorship. For the purposes
|
|
45
|
+
of this License, Derivative Works shall not include works that remain
|
|
46
|
+
separable from, or merely link (or bind by name) to the interfaces of,
|
|
47
|
+
the Work and Derivative Works thereof.
|
|
48
|
+
|
|
49
|
+
"Contribution" shall mean any work of authorship, including
|
|
50
|
+
the original version of the Work and any modifications or additions
|
|
51
|
+
to that Work or Derivative Works thereof, that is intentionally
|
|
52
|
+
submitted to Licensor for inclusion in the Work by the copyright owner
|
|
53
|
+
or by an individual or Legal Entity authorized to submit on behalf of
|
|
54
|
+
the copyright owner. For the purposes of this definition, "submitted"
|
|
55
|
+
means any form of electronic, verbal, or written communication sent
|
|
56
|
+
to the Licensor or its representatives, including but not limited to
|
|
57
|
+
communication on electronic mailing lists, source code control systems,
|
|
58
|
+
and issue tracking systems that are managed by, or on behalf of, the
|
|
59
|
+
Licensor for the purpose of discussing and improving the Work, but
|
|
60
|
+
excluding communication that is conspicuously marked or otherwise
|
|
61
|
+
designated in writing by the copyright owner as "Not a Contribution."
|
|
62
|
+
|
|
63
|
+
"Contributor" shall mean Licensor and any individual or Legal Entity
|
|
64
|
+
on behalf of whom a Contribution has been received by Licensor and
|
|
65
|
+
subsequently incorporated within the Work.
|
|
66
|
+
|
|
67
|
+
2. Grant of Copyright License. Subject to the terms and conditions of
|
|
68
|
+
this License, each Contributor hereby grants to You a perpetual,
|
|
69
|
+
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
|
70
|
+
copyright license to reproduce, prepare Derivative Works of,
|
|
71
|
+
publicly display, publicly perform, sublicense, and distribute the
|
|
72
|
+
Work and such Derivative Works in Source or Object form.
|
|
73
|
+
|
|
74
|
+
3. Grant of Patent License. Subject to the terms and conditions of
|
|
75
|
+
this License, each Contributor hereby grants to You a perpetual,
|
|
76
|
+
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
|
77
|
+
(except as stated in this section) patent license to make, have made,
|
|
78
|
+
use, offer to sell, sell, import, and otherwise transfer the Work,
|
|
79
|
+
where such license applies only to those patent claims licensable
|
|
80
|
+
by such Contributor that are necessarily infringed by their
|
|
81
|
+
Contribution(s) alone or by combination of their Contribution(s)
|
|
82
|
+
with the Work to which such Contribution(s) was submitted. If You
|
|
83
|
+
institute patent litigation against any entity (including a
|
|
84
|
+
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
|
85
|
+
or a Contribution incorporated within the Work constitutes direct
|
|
86
|
+
or contributory patent infringement, then any patent licenses
|
|
87
|
+
granted to You under this License for that Work shall terminate
|
|
88
|
+
as of the date such litigation is filed.
|
|
89
|
+
|
|
90
|
+
4. Redistribution. You may reproduce and distribute copies of the
|
|
91
|
+
Work or Derivative Works thereof in any medium, with or without
|
|
92
|
+
modifications, and in Source or Object form, provided that You
|
|
93
|
+
meet the following conditions:
|
|
94
|
+
|
|
95
|
+
(a) You must give any other recipients of the Work or
|
|
96
|
+
Derivative Works a copy of this License; and
|
|
97
|
+
|
|
98
|
+
(b) You must cause any modified files to carry prominent notices
|
|
99
|
+
stating that You changed the files; and
|
|
100
|
+
|
|
101
|
+
(c) You must retain, in the Source form of any Derivative Works
|
|
102
|
+
that You distribute, all copyright, patent, trademark, and
|
|
103
|
+
attribution notices from the Source form of the Work,
|
|
104
|
+
excluding those notices that do not pertain to any part of
|
|
105
|
+
the Derivative Works; and
|
|
106
|
+
|
|
107
|
+
(d) If the Work includes a "NOTICE" text file as part of its
|
|
108
|
+
distribution, then any Derivative Works that You distribute must
|
|
109
|
+
include a readable copy of the attribution notices contained
|
|
110
|
+
within such NOTICE file, excluding those notices that do not
|
|
111
|
+
pertain to any part of the Derivative Works, in at least one
|
|
112
|
+
of the following places: within a NOTICE text file distributed
|
|
113
|
+
as part of the Derivative Works; within the Source form or
|
|
114
|
+
documentation, if provided along with the Derivative Works; or,
|
|
115
|
+
within a display generated by the Derivative Works, if and
|
|
116
|
+
wherever such third-party notices normally appear. The contents
|
|
117
|
+
of the NOTICE file are for informational purposes only and
|
|
118
|
+
do not modify the License. You may add Your own attribution
|
|
119
|
+
notices within Derivative Works that You distribute, alongside
|
|
120
|
+
or as an addendum to the NOTICE text from the Work, provided
|
|
121
|
+
that such additional attribution notices cannot be construed
|
|
122
|
+
as modifying the License.
|
|
123
|
+
|
|
124
|
+
You may add Your own copyright statement to Your modifications and
|
|
125
|
+
may provide additional or different license terms and conditions
|
|
126
|
+
for use, reproduction, or distribution of Your modifications, or
|
|
127
|
+
for any such Derivative Works as a whole, provided Your use,
|
|
128
|
+
reproduction, and distribution of the Work otherwise complies with
|
|
129
|
+
the conditions stated in this License.
|
|
130
|
+
|
|
131
|
+
5. Submission of Contributions. Unless You explicitly state otherwise,
|
|
132
|
+
any Contribution intentionally submitted for inclusion in the Work
|
|
133
|
+
by You to the Licensor shall be under the terms and conditions of
|
|
134
|
+
this License, without any additional terms or conditions.
|
|
135
|
+
Notwithstanding the above, nothing herein shall supersede or modify
|
|
136
|
+
the terms of any separate license agreement you may have executed
|
|
137
|
+
with Licensor regarding such Contributions.
|
|
138
|
+
|
|
139
|
+
6. Trademarks. This License does not grant permission to use the trade
|
|
140
|
+
names, trademarks, service marks, or product names of the Licensor,
|
|
141
|
+
except as required for reasonable and customary use in describing the
|
|
142
|
+
origin of the Work and reproducing the content of the NOTICE file.
|
|
143
|
+
|
|
144
|
+
7. Disclaimer of Warranty. Unless required by applicable law or
|
|
145
|
+
agreed to in writing, Licensor provides the Work (and each
|
|
146
|
+
Contributor provides its Contributions) on an "AS IS" BASIS,
|
|
147
|
+
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
|
148
|
+
implied, including, without limitation, any warranties or conditions
|
|
149
|
+
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
|
150
|
+
PARTICULAR PURPOSE. You are solely responsible for determining the
|
|
151
|
+
appropriateness of using or redistributing the Work and assume any
|
|
152
|
+
risks associated with Your exercise of permissions under this License.
|
|
153
|
+
|
|
154
|
+
8. Limitation of Liability. In no event and under no legal theory,
|
|
155
|
+
whether in tort (including negligence), contract, or otherwise,
|
|
156
|
+
unless required by applicable law (such as deliberate and grossly
|
|
157
|
+
negligent acts) or agreed to in writing, shall any Contributor be
|
|
158
|
+
liable to You for damages, including any direct, indirect, special,
|
|
159
|
+
incidental, or consequential damages of any character arising as a
|
|
160
|
+
result of this License or out of the use or inability to use the
|
|
161
|
+
Work (including but not limited to damages for loss of goodwill,
|
|
162
|
+
work stoppage, computer failure or malfunction, or any and all
|
|
163
|
+
other commercial damages or losses), even if such Contributor
|
|
164
|
+
has been advised of the possibility of such damages.
|
|
165
|
+
|
|
166
|
+
9. Accepting Warranty or Additional Liability. While redistributing
|
|
167
|
+
the Work or Derivative Works thereof, You may choose to offer,
|
|
168
|
+
and charge a fee for, acceptance of support, warranty, indemnity,
|
|
169
|
+
or other liability obligations and/or rights consistent with this
|
|
170
|
+
License. However, in accepting such obligations, You may act only
|
|
171
|
+
on Your own behalf and on Your sole responsibility, not on behalf
|
|
172
|
+
of any other Contributor, and only if You agree to indemnify,
|
|
173
|
+
defend, and hold each Contributor harmless for any liability
|
|
174
|
+
incurred by, or claims asserted against, such Contributor by reason
|
|
175
|
+
of your accepting any such warranty or additional liability.
|
|
176
|
+
|
|
177
|
+
END OF TERMS AND CONDITIONS
|
|
178
|
+
|
|
179
|
+
APPENDIX: How to apply the Apache License to your work.
|
|
180
|
+
|
|
181
|
+
To apply the Apache License to your work, attach the following
|
|
182
|
+
boilerplate notice, with the fields enclosed by brackets "[]"
|
|
183
|
+
replaced with your own identifying information. (Don't include
|
|
184
|
+
the brackets!) The text should be enclosed in the appropriate
|
|
185
|
+
comment syntax for the file format. We also recommend that a
|
|
186
|
+
file or class name and description of purpose be included on the
|
|
187
|
+
same "printed page" as the copyright notice for easier
|
|
188
|
+
identification within third-party archives.
|
|
189
|
+
|
|
190
|
+
Copyright [yyyy] [name of copyright owner]
|
|
191
|
+
|
|
192
|
+
Licensed under the Apache License, Version 2.0 (the "License");
|
|
193
|
+
you may not use this file except in compliance with the License.
|
|
194
|
+
You may obtain a copy of the License at
|
|
195
|
+
|
|
196
|
+
http://www.apache.org/licenses/LICENSE-2.0
|
|
197
|
+
|
|
198
|
+
Unless required by applicable law or agreed to in writing, software
|
|
199
|
+
distributed under the License is distributed on an "AS IS" BASIS,
|
|
200
|
+
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
201
|
+
See the License for the specific language governing permissions and
|
|
202
|
+
limitations under the License.
|
|
203
|
+
|
|
@@ -0,0 +1,375 @@
|
|
|
1
|
+
Metadata-Version: 2.4
|
|
2
|
+
Name: peft-sparta
|
|
3
|
+
Version: 0.0.1
|
|
4
|
+
Summary: SpaRTA adaptation wrapper. Invocation code to load and run SpaRTA adapters for inference
|
|
5
|
+
Author-email: Jesus Rios <jriosal@us.ibm.com>
|
|
6
|
+
Maintainer-email: Jesus Rios <jriosal@us.ibm.com>
|
|
7
|
+
License-Expression: Apache-2.0
|
|
8
|
+
Project-URL: Repository, https://github.com/jmriosal/peft-sparta
|
|
9
|
+
Requires-Python: >=3.9
|
|
10
|
+
Description-Content-Type: text/markdown
|
|
11
|
+
License-File: LICENSE
|
|
12
|
+
Requires-Dist: torch
|
|
13
|
+
Requires-Dist: transformers
|
|
14
|
+
Requires-Dist: safetensors
|
|
15
|
+
Dynamic: license-file
|
|
16
|
+
|
|
17
|
+
# PEFT-SpaRTA
|
|
18
|
+
|
|
19
|
+
SpaRTA (**Spa**rse **R**andom parame**T**er **A**daptation) is a Parameter-Efficient Fine-Tuning (PEFT) alternative to traditional LoRA that reduces the number of trainable parameters by randomly selecting a very small proportion of the model parameters to train on.
|
|
20
|
+
|
|
21
|
+
|
|
22
|
+
This Python package provides the invocation code necessary to load and run SpaRTA-adapted models for inference. In particular, it includes the classes
|
|
23
|
+
|
|
24
|
+
* `SpaRTAforSequenceClassification`
|
|
25
|
+
* `SpaRTAforCausalLM`
|
|
26
|
+
|
|
27
|
+
to load a SpaRTA adapter along its pre-trained base (transformer) model architectured, respectively, for sequence classification tasks and autoregressive text generation tasks.
|
|
28
|
+
|
|
29
|
+
|
|
30
|
+
We also include the class
|
|
31
|
+
|
|
32
|
+
* `SpaRTA`
|
|
33
|
+
|
|
34
|
+
to facilitate sparse random parameter adaptation of a model and train your own SpaRTA adapters. This implementation is compatible with some of the most popular trainers, as shown in [here](#how-to-train-a-sparta-adapter).
|
|
35
|
+
|
|
36
|
+
|
|
37
|
+
For more details on how SpaRTA works see our [paper](https://arxiv.org/pdf/2502.15975). The original implementation of SpaRTA can be found in https://github.com/IBM/sparta.
|
|
38
|
+
|
|
39
|
+
|
|
40
|
+
## Installation
|
|
41
|
+
|
|
42
|
+
```bash
|
|
43
|
+
pip install peft-sparta
|
|
44
|
+
```
|
|
45
|
+
|
|
46
|
+
## How to use it for inference
|
|
47
|
+
|
|
48
|
+
### Download a SpaRTA adapter from a Hugging Face repository
|
|
49
|
+
|
|
50
|
+
Let's download a [SpaRTA adapter](https://huggingface.co/jesusriosal/sparta-gemma_2b-sst2) that spacializes the *google/gemma-2b* model to do *sentiment classification* of English sentences.
|
|
51
|
+
|
|
52
|
+
```bash
|
|
53
|
+
|
|
54
|
+
ADAPTER_DIR='/my_sparta_adapters/sparta-gemma_2b/'
|
|
55
|
+
|
|
56
|
+
mkdir -p $ADAPTER_DIR
|
|
57
|
+
|
|
58
|
+
hf download jesusriosal/sparta-gemma_2b-sst2 --local-dir $ADAPTER_DIR
|
|
59
|
+
|
|
60
|
+
```
|
|
61
|
+
|
|
62
|
+
|
|
63
|
+
### Load the SpaRTA adapter and create the adapted model
|
|
64
|
+
|
|
65
|
+
```python
|
|
66
|
+
from peft_sparta import SpaRTAforSequenceClassification
|
|
67
|
+
|
|
68
|
+
adapter_dir = '/my_sparta_adapters/sparta-gemma_2b/'
|
|
69
|
+
|
|
70
|
+
model = SpaRTAforSequenceClassification(
|
|
71
|
+
adapter = adapter_dir,
|
|
72
|
+
device = 'cuda')
|
|
73
|
+
|
|
74
|
+
print(model)
|
|
75
|
+
```
|
|
76
|
+
|
|
77
|
+
```none
|
|
78
|
+
(SpaRTA)ModelForSeqClassification(
|
|
79
|
+
adapter = '/my_sparta_adapters/sparta-gemma_2b/'
|
|
80
|
+
model = 'google/gemma-2b'
|
|
81
|
+
id2label = {0: 'negative', 1: 'positive'}
|
|
82
|
+
)
|
|
83
|
+
```
|
|
84
|
+
|
|
85
|
+
### Inputs
|
|
86
|
+
Let's use our adapted model to classify a few sentences. For this adapter, the model consumes the sentences directly. No formating is needed
|
|
87
|
+
|
|
88
|
+
```python
|
|
89
|
+
|
|
90
|
+
sentences = ["I enjoyed very much the movie.",
|
|
91
|
+
"It was painful to watch.",
|
|
92
|
+
"I couldn't enjoy more the movie.",
|
|
93
|
+
"It was a bad movie."]
|
|
94
|
+
```
|
|
95
|
+
### Inference
|
|
96
|
+
|
|
97
|
+
#### Probabilistic classification
|
|
98
|
+
|
|
99
|
+
The adapted model can give us its estimated probabilities that each sentence (row) has negative (first column) or positive (second column) sentiment.
|
|
100
|
+
|
|
101
|
+
```python
|
|
102
|
+
|
|
103
|
+
class_probs = model.classify(sentences)
|
|
104
|
+
|
|
105
|
+
print(class_probs)
|
|
106
|
+
```
|
|
107
|
+
|
|
108
|
+
```none
|
|
109
|
+
tensor([[0.1152, 0.8848],
|
|
110
|
+
[0.9497, 0.0503],
|
|
111
|
+
[0.1689, 0.8311],
|
|
112
|
+
[0.9720, 0.0280]], device='cuda:0')
|
|
113
|
+
```
|
|
114
|
+
|
|
115
|
+
To identify which column correspond to each class, use:
|
|
116
|
+
|
|
117
|
+
```python
|
|
118
|
+
print(model.id2label)
|
|
119
|
+
```
|
|
120
|
+
```none
|
|
121
|
+
{'0': 'negative', '1': 'positive'}
|
|
122
|
+
```
|
|
123
|
+
|
|
124
|
+
Here are the model's estimated probabilities of positive sentiment for each sentence
|
|
125
|
+
|
|
126
|
+
```python
|
|
127
|
+
for sentence, pos_prob in zip(sentences, class_probs[:,1]):
|
|
128
|
+
print(f"{pos_prob.item()*100:>4.0f}%\t{sentence}")
|
|
129
|
+
```
|
|
130
|
+
|
|
131
|
+
```none
|
|
132
|
+
Prob Sentence
|
|
133
|
+
---- -----------------------------
|
|
134
|
+
88% I enjoyed very much the movie.
|
|
135
|
+
5% It was painful to watch.
|
|
136
|
+
83% I couldn't enjoy more the movie.
|
|
137
|
+
3% It was a bad movie.
|
|
138
|
+
```
|
|
139
|
+
|
|
140
|
+
|
|
141
|
+
|
|
142
|
+
#### Deciding the sentiment class of each sentence (deterministic classification)
|
|
143
|
+
|
|
144
|
+
We have seen how the model makes probabilistic assessments of the sentiment of each sentence. If we want the model to make a definitive decison on whether the sentence has positive or negative sentiment, we can use:
|
|
145
|
+
|
|
146
|
+
```python
|
|
147
|
+
classes = model.decide_class(sentences)
|
|
148
|
+
```
|
|
149
|
+
|
|
150
|
+
to obtain the model's predicted class of each sentence. Basically, the model takes the most likely class as its sentiment prediction of a sentence
|
|
151
|
+
```python
|
|
152
|
+
for sentence, sentence_class in zip(sentences, classes):
|
|
153
|
+
print(f"'{sentence_class}': {sentence}")
|
|
154
|
+
```
|
|
155
|
+
|
|
156
|
+
```none
|
|
157
|
+
Sentiment Sentence
|
|
158
|
+
----------- -------------------------------
|
|
159
|
+
'positive': I enjoyed very much the movie.
|
|
160
|
+
'negative': It was painful to watch.
|
|
161
|
+
'positive': I couldn't enjoy more the movie.
|
|
162
|
+
'negative': It was a bad movie.
|
|
163
|
+
```
|
|
164
|
+
|
|
165
|
+
### Input templates
|
|
166
|
+
|
|
167
|
+
Sometimes the input to the model may need to be formatted before our adapted model can processs it.
|
|
168
|
+
This is typicaly the case when using instruction-following models, for which wrapping the input within an instruction, formatted with the model's chat template, can be advantageous. In these cases, we can use the following `input_template` argument to specify the formatting over raw inputs used during training, and needed during inference.
|
|
169
|
+
|
|
170
|
+
To see this, let's use [another SpaRTA adapter](https://huggingface.co/jesusriosal/sparta-gemma_2b_it-sst2) for *sentiment classification* based on the [google/gemma-2b-it](https://huggingface.co/google/gemma-2b-it) model.
|
|
171
|
+
|
|
172
|
+
|
|
173
|
+
```bash
|
|
174
|
+
hf download jesusriosal/sparta-gemma_2b-sst2 --local-dir '/my_sparta_adapters/sparta-gemma_2b_it/'
|
|
175
|
+
```
|
|
176
|
+
|
|
177
|
+
```python
|
|
178
|
+
|
|
179
|
+
from peft_sparta import SpaRTAforSequenceClassification
|
|
180
|
+
|
|
181
|
+
adapter_dir = '/my_sparta_adapters/sparta-gemma_2b_it/'
|
|
182
|
+
|
|
183
|
+
model = SpaRTAforSequenceClassification(
|
|
184
|
+
adapter=adapter_dir,
|
|
185
|
+
device='cuda',
|
|
186
|
+
input_template = ("<start_of_turn>user\n"
|
|
187
|
+
"Determine the sentiment of the following sentence about a movie. "
|
|
188
|
+
"The sentiment can only be classified as positive or negative.\n"
|
|
189
|
+
"Sentence: {sentence}"
|
|
190
|
+
"<end_of_turn>\n<start_of_turn>model\n"
|
|
191
|
+
"The sentiment of the sentence is")
|
|
192
|
+
)
|
|
193
|
+
|
|
194
|
+
print(model)
|
|
195
|
+
```
|
|
196
|
+
|
|
197
|
+
```none
|
|
198
|
+
(SpaRTA)ModelForSeqClassification(
|
|
199
|
+
adapter = '/my_sparta_adapters/sparta-gemma_2b_it/'
|
|
200
|
+
model = 'google/gemma-2b-it'
|
|
201
|
+
id2label = {0: 'negative', 1: 'positive'}
|
|
202
|
+
)
|
|
203
|
+
```
|
|
204
|
+
|
|
205
|
+
This SpaRTA adapter was trained formating the input sentences to be classified with the `input_template` (see `model.template` printout below), which included a task instruction. This ensures that during inference the same formatting is used on the inputs to be classified.
|
|
206
|
+
|
|
207
|
+
|
|
208
|
+
```python
|
|
209
|
+
print(model.template)
|
|
210
|
+
```
|
|
211
|
+
|
|
212
|
+
```none
|
|
213
|
+
<start_of_turn>user
|
|
214
|
+
Determine the sentiment of the following sentence about a movie. The sentiment can only be classified as positive or negative.
|
|
215
|
+
Sentence: {sentence}<end_of_turn>
|
|
216
|
+
<start_of_turn>model
|
|
217
|
+
The sentiment of the sentence is
|
|
218
|
+
```
|
|
219
|
+
|
|
220
|
+
|
|
221
|
+
For example, the sentence
|
|
222
|
+
|
|
223
|
+
```none
|
|
224
|
+
I enjoyed very much the movie.
|
|
225
|
+
```
|
|
226
|
+
|
|
227
|
+
is converted to
|
|
228
|
+
|
|
229
|
+
```none
|
|
230
|
+
<start_of_turn>user
|
|
231
|
+
Determine the sentiment of the following sentence about a movie. The sentiment can only be classified as positive or negative.
|
|
232
|
+
Sentence: I enjoyed very much the movie.<end_of_turn>
|
|
233
|
+
<start_of_turn>model
|
|
234
|
+
The sentiment of the sentence is
|
|
235
|
+
```
|
|
236
|
+
before passing it to the model for classification
|
|
237
|
+
|
|
238
|
+
|
|
239
|
+
Thus, to classify the (raw, non-formatted) sentences [above](#inputs) we proceed as follows
|
|
240
|
+
|
|
241
|
+
```python
|
|
242
|
+
sentences = [{'sentence': sent} for sent in sentences]
|
|
243
|
+
|
|
244
|
+
class_probs = model.classify(sentences)
|
|
245
|
+
|
|
246
|
+
# prob of positive sentiment for each sentence
|
|
247
|
+
for sentence, pos_prob in zip(sentences, class_probs[:,1]):
|
|
248
|
+
print(f"{pos_prob.item()*100:>4.0f}%\t{sentence['sentence']}")
|
|
249
|
+
```
|
|
250
|
+
|
|
251
|
+
```none
|
|
252
|
+
100% I enjoyed very much the movie.
|
|
253
|
+
0% It was painful to watch.
|
|
254
|
+
100% I couldn't enjoy more the movie.
|
|
255
|
+
0% It was a bad movie.
|
|
256
|
+
```
|
|
257
|
+
|
|
258
|
+
```python
|
|
259
|
+
classes = model.decide_class(sentences)
|
|
260
|
+
|
|
261
|
+
for sentence, sentence_class in zip(sentences, classes):
|
|
262
|
+
print(f"'{sentence_class}': {sentence['sentence']}")
|
|
263
|
+
|
|
264
|
+
```
|
|
265
|
+
|
|
266
|
+
```none
|
|
267
|
+
Sentiment Sentence
|
|
268
|
+
----------- -------------------------------
|
|
269
|
+
'positive': I enjoyed very much the movie.
|
|
270
|
+
'negative': It was painful to watch.
|
|
271
|
+
'positive': I couldn't enjoy more the movie.
|
|
272
|
+
'negative': It was a bad movie.
|
|
273
|
+
```
|
|
274
|
+
|
|
275
|
+
|
|
276
|
+
|
|
277
|
+
### Out-of-Distribution performance evaluations
|
|
278
|
+
|
|
279
|
+
If you have a labeled dataset with English sentences and their sentiment labels, like the one below, you can evaluate the performace of these models on that dataset as follows.
|
|
280
|
+
|
|
281
|
+
Given the following dataset of new, unseen sentences and their sentiment labels:
|
|
282
|
+
|
|
283
|
+
```python
|
|
284
|
+
test_sentences = ["it's a charming journey. ",
|
|
285
|
+
"bleak and desperate",
|
|
286
|
+
"nolan is poised to embark a major career as a commercial yet inventive filmmaker.",
|
|
287
|
+
"the acting, costumes, music, cinematography and sound are all astounding. ",
|
|
288
|
+
"it's slow -- very, very slow. ",
|
|
289
|
+
"the film is a refreshingly serious look at young women.",
|
|
290
|
+
"a sometimes tedious film.",
|
|
291
|
+
"like doing last year's taxes with your ex-wife.",
|
|
292
|
+
"you don't have to know about music to appreciate the film. ",
|
|
293
|
+
"in exactly 89 minutes, most of which passed as slowly as if i'd been sitting naked on an igloo, the movie sank from quirky to jerky to utter turkey."]
|
|
294
|
+
|
|
295
|
+
test_labels = [1, 0, 1, 1, 0, 1, 0, 0, 1, 0]
|
|
296
|
+
|
|
297
|
+
```
|
|
298
|
+
where a label of 0 represents *negative* sentiment and a label of 1 *positive*.
|
|
299
|
+
|
|
300
|
+
We evaluate the performance of the model on this labeled dataset as follows. We will need to first put each sentence within a dictionary with a key named `'sentence'` for the model with the `input_template`, so the sentences can be consumed by it accordingly.
|
|
301
|
+
|
|
302
|
+
```pyhton
|
|
303
|
+
test_sentences = [{'sentence': sent} for sent in test_sentences] # for the model with input_template
|
|
304
|
+
|
|
305
|
+
model.evaluate(test_sentences, test_labels, batch_size=64)
|
|
306
|
+
```
|
|
307
|
+
|
|
308
|
+
```none
|
|
309
|
+
loss: 0.002
|
|
310
|
+
accuracy: 100%
|
|
311
|
+
confusion matrix: [5, 0
|
|
312
|
+
0, 5]
|
|
313
|
+
balanced accuracy: 100%
|
|
314
|
+
MCC: 1.0
|
|
315
|
+
F1-score: 1.0
|
|
316
|
+
```
|
|
317
|
+
|
|
318
|
+
## How to train a SpaRTA adapter
|
|
319
|
+
|
|
320
|
+
Given a pre-trained model, we prepare it for fine-tuning with SpaRTA by
|
|
321
|
+
|
|
322
|
+
```python
|
|
323
|
+
from peft_sparta import SpaRTA
|
|
324
|
+
|
|
325
|
+
model = SpaRTA(model, sparsity=0.99)
|
|
326
|
+
```
|
|
327
|
+
|
|
328
|
+
This adds the adapter to the pre-trained model. The adapter consists of non-trainable randomly sampled *indices* and trainable *deltas*, representing the changes to the original model parameters for those indices. Note that in this case we have chosen a *sparsity* level of 99%, meaning that we target to keep only 1% of the model parameters to be trainable.
|
|
329
|
+
|
|
330
|
+
|
|
331
|
+
Our `SpaRTA` wrapper class supports the following arguments:
|
|
332
|
+
|
|
333
|
+
* `model (nn.Module)` Pre-trained model to be adapted.
|
|
334
|
+
|
|
335
|
+
* `sparsity (float)` Target fraction of the total number of model parameters to make non-trainable. Must be *0 < sparsity < 1*.
|
|
336
|
+
|
|
337
|
+
* `frozen_modules (list[str], optional)` List of layers name substrings to make entirely frozen (non-trainable). Classification heads ("*score*") will always be fully-trainable by default. Defaults to [*"embed_tokens", "self_attn.q", "self_attn.k", "mlp", "norm"*].
|
|
338
|
+
|
|
339
|
+
* `trainable_tokens (list[int], optional)` List of (unique) token ids whose embeddings should be fully-trainable. Useful for newly added (special) tokens to the vocabulary. Defaults to *None*.
|
|
340
|
+
|
|
341
|
+
* `dropout (float, optional)` Dropout probability applied to the trainable parameters during training. Must be *0 <= dropout < 1*. Defaults to *0*.
|
|
342
|
+
|
|
343
|
+
|
|
344
|
+
The following notebooks illustrate examples of how to train a SpaRTA adapter with several popular trainers.
|
|
345
|
+
|
|
346
|
+
1. [Linear regression](training_examples/linear_regression.ipynb)
|
|
347
|
+
2. [Sequence classification](training_examples/classification.ipynb)
|
|
348
|
+
3. [Text generation](training_examples/text_generation.ipynb)
|
|
349
|
+
|
|
350
|
+
|
|
351
|
+
|
|
352
|
+
## Citation
|
|
353
|
+
|
|
354
|
+
```bibtex
|
|
355
|
+
@article{rios2025sparsity,
|
|
356
|
+
title={Sparsity may be all you need: Sparse random parameter adaptation},
|
|
357
|
+
author={Rios, Jesus and Dognin, Pierre and Luss, Ronny and Ramamurthy, Karthikeyan N},
|
|
358
|
+
journal={arXiv preprint arXiv:2502.15975},
|
|
359
|
+
year={2025}
|
|
360
|
+
}
|
|
361
|
+
```
|
|
362
|
+
|
|
363
|
+
```bibtex
|
|
364
|
+
@software{rios2025sparta,
|
|
365
|
+
title = {{PEFT-SpaRTA}},
|
|
366
|
+
author = {Rios, Jesus},
|
|
367
|
+
url = {https://github.com/jmriosal/peft-sparta}
|
|
368
|
+
}
|
|
369
|
+
|
|
370
|
+
|
|
371
|
+
```
|
|
372
|
+
|
|
373
|
+
|
|
374
|
+
|
|
375
|
+
|