Pith. sign in

REVIEW 3 major objections 6 minor 21 references

Domain Expansion: Parameter-Efficient Modules as Building Blocks for Composite Domains

T0 review · 3 major / 6 minor · reviewed 2026-08-10 · deepseek-v4-flash

Pith's one-line read The paper claims that composing four fine-tuned trait adapters by weighted addition, with no extra fine-tuning, yields a PEM aligned with the intended MBTI type on 13 of 16 personalities.

desk verdict The trait-level results are mildly interesting, but the composite-domain claim collapses because the composition weights are tuned on the same quiz used for evaluation. read the letter →

arxiv 2501.14321 v1 pith:VJWAEYEK submitted 2025-01-24 cs.LG

classification cs.LG
keywords parameter-efficientfine-tuningLoRAIA3modelmergingadaptercompositionMBTIpersonalityzero-shotclassification
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that domain expertise in PEFT adapter modules can be composed by weighted parameter addition alone, with no extra fine-tuning, to produce a model for a composite domain. The test bed is the MBTI framework: eight trait adapters are trained, one for each pole of the four dichotomies, and each of the 16 personality types is formed by summing the four corresponding adapters with weights that add to 1. On the online 16personalities quiz, most of the 16 composed models score above 50% on all four relevant trait scales, which the authors read as evidence that the arithmetic composition generalizes from individual traits to composite personalities. If correct, this makes the construction of a composite-domain expert as cheap as adding a few existing adapter weights.

What carries the argument

The engine is the parameter-space composition rule $\Theta_P = \sum_{i=1}^4 \lambda_i \theta_{T_i}$: the adapter parameters of the composite PEM are a weighted sum of the four trait PEMs' adapter parameters, with $\lambda_i \in (0,1)$ and $\sum_i \lambda_i = 1$, and the composite has the same architecture as an individual PEM. The $\lambda$ weights are chosen by sweeping a grid with granularity 0.1 and keeping the set that maximizes the personality quiz score. The underlying adapters are LoRA's low-rank update ($\{B,A\}$ added to query and value weights) and IA3's learned scaling vectors applied to keys, values, and feed-forward activations.

What would settle it

Split the quiz's 60 questions into a tuning half and a held-out half before choosing $\lambda$. If scores on the held-out half fall to chance while the tuning half stays above 50%, the claimed composition generalization is an artifact of test-set selection. A sharper version: fix all $\lambda_i = 1/4$ and check whether composites still align above chance on the full quiz.

Watch

Extended reading notes

Core claim

The central claim is that a weighted sum of adapter parameters, selected over a grid and not followed by any training, reproduces the MBTI personality defined by the constituent traits. For both LoRA and IA3 adapters trained on 154 synthetic examples per trait, the composite is formed as $\Theta_P = \sum_{i=1}^4 \lambda_i \theta_{T_i}$ with $\sum_i \lambda_i = 1$; on the 60-question 16personalities quiz, 13 of the 16 LoRA composites and 13 of the 16 IA3 composites align with the intended type, with each failure traceable to a single flipped dichotomy. The authors conclude that adapters fine-tuned from the same pre-trained checkpoint occupy compatible error regions, so weight-space arithmetic transfers from trait domains to their composite.

Load-bearing premise

The load-bearing premise is that the same online 16personalities quiz can serve both as the selection signal for the composition weights and as the unbiased test of the composed models; if that quiz is not a neutral held-out measure, the reported alignment scores are selection artifacts rather than evidence of generalization.

Editorial extensions

If this is right

  • A composite-domain PEM can be produced from per-trait PEMs by weighted addition alone, without post-composition fine-tuning or new data.
  • The same recipe applies to any domain that can be factored into a small number of independent trait dimensions: train one adapter per dimension, then sum adapters for the combination.
  • Per-trait accuracy does not guarantee a correct composite: some personalities with strong individual trait scores still flip one dichotomy after composition.
  • Both LoRA and IA3 adapters support the rule, although individual dichotomy scores occasionally fall below 50% (for example, IA3's P scale for ENTP).

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The reported 13/16 pass rate is measured on the same quiz used to select the $\lambda$ weights, so the numbers likely overstate generalization; a held-out split of quiz questions would separate fitting from transfer.
  • If the additivity survives a held-out test, the natural next experiment is to check whether the same $\lambda$ values transfer to a different backbone or to a different composite domain, which would indicate that adapter spaces are broadly additive rather than MBTI-specific.
  • Because the trait datasets are generated by prompting a language model with trait stereotypes, the results are entangled with the generator's notion of each MBTI pole; a natural-corpus or human-authored dataset would test whether the composition effect is a property of the adapters or of the synthetic training signal.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper proposes to represent each of the 16 MBTI personality types as a composition of eight trait-level parameter-efficient modules (PEMs) trained with LoRA and IA3 on synthetic ChatGPT-generated data. The composition rule is a weighted sum of adapter parameters (Eq. 7), and the composed personality PEMs are evaluated by feeding the 16personalities.com quiz to the model and recording the resulting trait percentages and overall type (Tables 1 and 2). The central claim is that weight-space composition of trait PEMs yields distribution generalization over the composite domain without additional fine-tuning.

Significance. If established, the claim would be a useful demonstration that simple arithmetic on PEFT adapter weights can construct composite-domain models, extending prior work on model merging. The paper has several strengths: it targets a clear compositional task, uses two PEFT architectures, and provides a code link and a demo. However, the main evidence for the composite-domain claim is invalidated by the evaluation protocol: the composition weights are selected on the same quiz that is used to report the accuracy numbers. The trait-level results avoid this particular circularity, but they are not sufficient to establish the paper's central contribution. As it stands, the paper demonstrates at most that trait PEMs can be fine-tuned to align with individual trait labels on a quiz, and that a set of fitted mixture weights can be found that scores well on that same quiz.

major comments (3)
  1. [Section 5, Eq. (7), Table 2] The set {λ_i} is obtained by sweeping over values with granularity 0.1 and selecting the λ_i that maximize the personality evaluation score, which is the same 16personalities.com quiz whose trait percentages and overall type are reported in Table 2. Consequently, the reported accuracies are the objective values of the tuning process, not independent test results. The abstract's claim that composition works 'without requiring any additional fine-tuning' is true at the parameter level, but the composition rule itself has been fitted to the test distribution. This invalidates the central generalization claim. A valid test would require a held-out portion of the quiz, a different questionnaire, or a fixed untuned composition rule (e.g., all λ_i = 0.25); none is reported.
  2. [Section 4.2 versus Section 5, Eq. (6) versus Eq. (7)] The method described as the contribution in Eq. (6) is a plain sum of adapter parameters, but the experiments use Eq. (7), a weighted sum with λ_i optimized by sweeping. No results are reported for Eq. (6), so the paper does not actually evaluate the 'simple sum' composition that the abstract and Section 4.2 emphasize. The relationship between Eq. (6) and Eq. (7) needs to be clarified, and results with a fixed, untuned weighting are needed to support the stated claim.
  3. [Tables 1 and 2, evaluation protocol] No error bars, repeated seeds, or confidence intervals are reported, and each trait PEM is trained on only 154 synthetic samples with no mention of multiple runs. A 60-question quiz yields noisy trait percentages and a single overall type; without repeated evaluations or multiple model seeds, the >50% scores in Table 1 and the ✓/✗ counts in Table 2 cannot be distinguished from chance or prompt variability. This is especially important for the trait-level claims, which are the only non-circular quantitative evidence in the paper.
minor comments (6)
  1. [Section 5] The sweeping procedure for λ_i is underspecified: the set of candidate values, the number of candidate vectors, and the exact selection criterion (per-trait score, total score, or overall type match) are not stated.
  2. [Table 2] The ✓/✗ criterion is not defined: a personality could be marked correct if all four trait percentages exceed 50, or only if the online quiz returns exactly the target type; the paper should state which criterion is used.
  3. [Section 5, Synthetic Dataset Generation] There is no discussion of potential overlap between the synthetic questions generated by ChatGPT-4 and the questions in the online quiz, nor of whether the evaluation questions were used in any way during training or λ selection.
  4. [Table 1] The baseline is described as 'BERT not fine-tuned via PEFT,' but the paper does not specify how the baseline's quiz responses were obtained or whether it was evaluated with the same automated Selenium pipeline.
  5. [Section 4.2, Eq. (6)] There are notation issues around Eq. (6): the parenthetical 'P →' appears garbled, and 'composing function f → P' is unclear.
  6. [Related Work] The paper cites Zhang et al. (2023) for the composition method but provides no comparison or ablation against that method or against simple averaging, making it difficult to assess the contribution relative to existing work.

Circularity Check

1 steps flagged · score 7.0 of 10

Reported composite MBTI accuracy is a tuned quantity: the composition weights λi are selected to maximize the same quiz scores reported in Table 2, so the central generalization claim is unsupported.

  1. fitted input called prediction [Section 5, 'PEM Composition' (Eq. 7) and 'Evaluation' (Table 2)]
    "Instead of using eq. 6 directly to compose trait PEMs, we use the below, ΘP = 4X i=1 λiθTi (7) In eq. 7, the hyper-parameter set {λi} is selected such that each λi ∈ (0, 1) and P i λi = 1. An optimal set of {λ∗ i } is obtained by sweeping over a set of possible values (following the constraints, with a granularity of 0.1) and selecting the { λi} maximizing the (personality) evaluation score."

    The reported composite accuracy is obtained by choosing the composition weights λi to maximize the score on the same 16personalities.com quiz that is later reported as the evaluation result. Table 2 is therefore not a test of the composition rule; it is the objective function of the grid search. The central claim that weight-space composition generalizes without further tuning is untested, because the only free parameters of the composition were fitted to the evaluation instrument. A valid test would use a fixed composition rule (e.g., Eq. 6 with λi = 1) or a held-out quiz.

full rationale

The trait-level PEM results in Table 1 are not circular: they are direct measurements after PEFT on synthetic trait datasets. The circularity enters at the composition stage, which is the paper's main contribution. Equation 6 defines the proposed composition rule with fixed unit weights, but Eq. 7 replaces it with a weighted sum whose weights are explicitly selected by sweeping a grid to maximize the personality evaluation score, i.e., the 16personalities.com quiz. Table 2 then reports the resulting quiz scores as evidence that the composed PEMs generalize to composite personalities. Because the same quiz both selects λi and is reported as the evaluation, the composite results are fitted objective values rather than predictions. This is not a self-citation or uniqueness-theorem issue; it is a fitted-input-called-prediction problem at the core of the paper's claim. A fixed composition rule, such as all λi equal, evaluated on the same quiz would have been meaningful evidence, but that evidence is not reported.

Assumptions & free parameters 1 free parameters · 3 assumptions · 0 invented entities

The paper contributes no new formal derivation. Its central result rests on three domain assumptions: additivity of adapter weights, validity of MBTI as a compositional ground truth, and quality of synthetic ChatGPT-4 data. Additionally, the per-personality weights lambda_i are free parameters fitted to the evaluation quiz.

free parameters (1)
  • lambda_i per composed personality = Not reported; swept over a grid of 0.1 in (0,1) with sum=1, selected to maximize the personality evaluation score
    The combining weights in eq. 7 are chosen by maximizing the personality evaluation score on the 16personalities.com quiz, so they are fitted to the evaluation data.
assumptions (3)
  • domain assumption Adapter parameters from the same base checkpoint compose additively in weight space, so that adding trait adapters yields a semantic combination of traits.
    Invoked in Section 4.2, eq. 6-7, relying on prior work (Matena and Raffel 2022; Wortsman et al. 2022; Jin et al. 2023; Zhang et al. 2023) that averaging weights of models fine-tuned from the same checkpoint improves generalization. This is an assumption imported from the literature, not derived here.
  • domain assumption The Myers-Briggs Type Indicator framework validly decomposes personalities into four independent dichotomies, and the quiz's per-dichotomy percentages measure the behaviors induced in a language model.
    The whole task setup in Sections 1 and 5 treats MBTI as a compositional ground truth, despite citing Boyle (1995) on MBTI psychometric limitations.
  • domain assumption Synthetic data generated by ChatGPT-4 accurately reflects each trait's behavioral signature.
    Section 5: synthetic dataset generation, 154 samples per trait; no human validation or evidence that the generated questions and answers are trait-specific.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Domain Expansion: Parameter-Efficient Modules as Building Blocks for Composite Domains." pith.science (2026). https://pith.science/paper/VJWAEYEK

@misc{pith2026250114321,
  author       = {Pith},
  title        = {Pith review of: Domain Expansion: Parameter-Efficient Modules as Building Blocks for Composite Domains},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/VJWAEYEK}},
  note         = {Machine review of arXiv:2501.14321}
}
read the original abstract

Parameter-Efficient Fine-Tuning (PEFT) is an efficient alternative to full scale fine-tuning, gaining popularity recently. With pre-trained model sizes growing exponentially, PEFT can be effectively utilized to fine-tune compact modules, Parameter-Efficient Modules (PEMs), trained to be domain experts over diverse domains. In this project, we explore composing such individually fine-tuned PEMs for distribution generalization over the composite domain. To compose PEMs, simple composing functions are used that operate purely on the weight space of the individually fine-tuned PEMs, without requiring any additional fine-tuning. The proposed method is applied to the task of representing the 16 Myers-Briggs Type Indicator (MBTI) composite personalities via 4 building block dichotomies, comprising of 8 individual traits which can be merged (composed) to yield a unique personality. We evaluate the individual trait PEMs and the composed personality PEMs via an online MBTI personality quiz questionnaire, validating the efficacy of PEFT to fine-tune PEMs and merging PEMs without further fine-tuning for domain composition.

Figures

Figures reproduced from arXiv: 2501.14321 by the authors.

Figure 1
Figure 1. MBTI Dichotomies, Traits and Personalities [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Method Overview Additionally, the fine-tuning (PEFT) performed for each Di is initiated from an identical PLM model checkpoint, across all the domains over which com￾position for distribution generalization is to be per￾formed. 4 Proposed Method In our project, the individual domains Di (section 3) correspond to the individual traits E, I, S, N, T, F, J, P defined in section 1 (2 opposing traits for each of the 4 di… view at source ↗
Figure 3
Figure 3. PEFT Training transformation as below, h ← h + BAx (3) θLoRA = {B, A} (4) In eq. 3, B ∈ R d×r and A ∈ R r×k are the LoRA adapter parameters θLoRA with r ≪ min(d, k). While the modification in eq. 3 can be done for any x → h transformation within a transformer, it is conventionally applied for the query and value vector generation in each transformer layer. In our project, we follow this convention. IA3 IA3 (Liu et a… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

21 extracted references · 5 canonical work pages

  1. [1]

    online" 'onlinestring :=

    ENTRY address archivePrefix author booktitle chapter edition editor eid eprint eprinttype howpublished institution journal key month note number organization pages publisher school series title type volume year doi pubmed url lastchecked label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block STRING...

  2. [2]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize " " * FUNCT...

  3. [3]

    Gregory J. Boyle. 1995. https://doi.org/10.1111/j.1742-9544.1995.tb01750.x Myers-briggs type indicator (mbti): Some psychometric limitations . Australian Psychologist, 30(1):71--74

  4. [4]

    Vitor dos Santos and Ivandre Paraboni. 2022. https://doi.org/10.3897/jucs.70941 Myers-briggs personality classification from social media text using pre-trained language models . JUCS - Journal of Universal Computer Science, 28(4):378–395

  5. [5]

    Daniel Fernau, Stefan Hillmann, Nils Feldhus, and Tim Polzehl. 2022. https://doi.org/10.21437/Interspeech.2022-376 Towards Automated Dialog Personalization using MBTI Personality Indicators . In Proc. Interspeech 2022, pages 1968--1972

  6. [6]

    Neil Houlsby, Andrei Giurgiu, Stanislaw Jastrzebski, Bruna Morrone, Quentin de Laroussilhe, Andrea Gesmundo, Mona Attariyan, and Sylvain Gelly. 2019. https://arxiv.org/abs/1902.00751 Parameter-efficient transfer learning for nlp . Preprint, arXiv:1902.00751

  7. [7]

    Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen

    Edward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen. 2021. https://arxiv.org/abs/2106.09685 Lora: Low-rank adaptation of large language models . Preprint, arXiv:2106.09685

  8. [8]

    Gabriel Ilharco, Marco Tulio Ribeiro, Mitchell Wortsman, Suchin Gururangan, Ludwig Schmidt, Hannaneh Hajishirzi, and Ali Farhadi. 2023. https://arxiv.org/abs/2212.04089 Editing models with task arithmetic . Preprint, arXiv:2212.04089

Show all 21 references
  1. [9]

    Xisen Jin, Xiang Ren, Daniel Preotiuc-Pietro, and Pengxiang Cheng. 2023. https://arxiv.org/abs/2212.09849 Dataless knowledge fusion by merging weights of language models . Preprint, arXiv:2212.09849

  2. [10]

    Sedrick Scott Keh and I-Tsun Cheng. 2019. https://arxiv.org/abs/1907.06333 Myers-briggs personality classification and personality-specific language generation using pre-trained language models . Preprint, arXiv:1907.06333

  3. [11]

    Haokun Liu, Derek Tam, Mohammed Muqeeth, Jay Mohta, Tenghao Huang, Mohit Bansal, and Colin Raffel. 2022. https://arxiv.org/abs/2205.05638 Few-shot parameter-efficient fine-tuning is better and cheaper than in-context learning . Preprint, arXiv:2205.05638

  4. [12]

    Michael Matena and Colin Raffel. 2022. https://arxiv.org/abs/2111.09832 Merging models with fisher-weighted averaging . Preprint, arXiv:2111.09832

  5. [13]

    Yash Mehta, Samin Fatehi, Amirmohammad Kazameini, Clemens Stachl, Erik Cambria, and Sauleh Eetemadi. 2020. https://doi.org/10.1109/ICDM50108.2020.00146 Bottom-up and top-down: Predicting personality with psycholinguistic and language model features . In 2020 IEEE International...

  6. [14]

    Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. https://arxiv.org/abs/1301.3781 Efficient estimation of word representations in vector space . Preprint, arXiv:1301.3781

  7. [15]

    Jonas Pfeiffer, Aishwarya Kamath, Andreas Rücklé, Kyunghyun Cho, and Iryna Gurevych. 2021. https://arxiv.org/abs/2005.00247 Adapterfusion: Non-destructive task composition for transfer learning . Preprint, arXiv:2005.00247

  8. [16]

    Ricardo Lazo Vásquez and José Ochoa-Luna. 2021. https://doi.org/10.1109/CLEI53233.2021.9640012 Transformer-based approaches for personality detection using the mbti model . In 2021 XLVII Latin American Computing Conference (CLEI), pages 1--7

  9. [17]

    Yaqing Wang, Sahaj Agarwal, Subhabrata Mukherjee, Xiaodong Liu, Jing Gao, Ahmed Hassan Awadallah, and Jianfeng Gao. 2022. https://arxiv.org/abs/2205.12410 Adamix: Mixture-of-adaptations for parameter-efficient model tuning . Preprint, arXiv:2205.12410

  10. [18]

    Morcos, Hongseok Namkoong, Ali Farhadi, Yair Carmon, Simon Kornblith, and Ludwig Schmidt

    Mitchell Wortsman, Gabriel Ilharco, Samir Yitzhak Gadre, Rebecca Roelofs, Raphael Gontijo-Lopes, Ari S. Morcos, Hongseok Namkoong, Ali Farhadi, Yair Carmon, Simon Kornblith, and Ludwig Schmidt. 2022. https://arxiv.org/abs/2203.05482 Model soups: averaging weights of multiple f...

  11. [19]

    Lingling Xu, Haoran Xie, Si-Zhao Joe Qin, Xiaohui Tao, and Fu Lee Wang. 2023. https://arxiv.org/abs/2312.12148 Parameter-efficient fine-tuning methods for pretrained language models: A critical review and assessment . Preprint, arXiv:2312.12148

  12. [20]

    Jinghan Zhang, Shiqi Chen, Junteng Liu, and Junxian He. 2023. https://arxiv.org/abs/2306.14870 Composing parameter-efficient modules with arithmetic operations . Preprint, arXiv:2306.14870

  13. [21]

    Wayne Xin Zhao, Kun Zhou, Junyi Li, Tianyi Tang, Xiaolei Wang, Yupeng Hou, Yingqian Min, Beichen Zhang, Junjie Zhang, Zican Dong, Yifan Du, Chen Yang, Yushuo Chen, Zhipeng Chen, Jinhao Jiang, Ruiyang Ren, Yifan Li, Xinyu Tang, Zikang Liu, Peiyu Liu, Jian-Yun Nie, and Ji-Rong W...

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.