Paper deep dive
Few-Shot Learning for Personalised Automated Pain Assessment
Heinke Hihn, Ibrahim Eisawy, Patrick Thiam, Hans A. Kestler, Friedhelm Schwenker
Intelligence
Status: succeeded | Model: Gemma-4-26B-A4B | Prompt: intel-v1 | Confidence: 97%
Last extracted: 10/11/2026, 3:03:47 AM
Summary
This paper evaluates Few-Shot Learning (a sub-area of Meta-Learning) for personalized automated pain assessment to address inter-subject variability. The authors propose a Subject-As-A-Task prototype-based approach using a Cross Alignment Network to adapt models using few labeled samples from a target subject. The method is evaluated on BioVid, SenseEmotion, and PainMonit datasets, showing improved accuracy in binary and multi-class settings compared to population-level classifiers.
Entities (16)
Relation Signals (23)
Heinke Hihn → isauthorof → Few-Shot Learning for Personalised Automated Pain Assessment
confidence 99% · Heinke Hihn1,*, Ibrahim Eisawy1... Few-Shot Learning for Personalised Automated Pain Assessment
Friedhelm Schwenker → isauthorof → Few-Shot Learning for Personalised Automated Pain Assessment
confidence 99% · Friedhelm Schwenker2... Few-Shot Learning for Personalised Automated Pain Assessment
Hans A. Kestler → isauthorof → Few-Shot Learning for Personalised Automated Pain Assessment
confidence 99% · Hans A. Kestler3... Few-Shot Learning for Personalised Automated Pain Assessment
Patrick Thiam → isauthorof → Few-Shot Learning for Personalised Automated Pain Assessment
confidence 99% · Patrick Thiam2,3... Few-Shot Learning for Personalised Automated Pain Assessment
Ibrahim Eisawy → isauthorof → Few-Shot Learning for Personalised Automated Pain Assessment
confidence 99% · Heinke Hihn1,*, Ibrahim Eisawy1... Few-Shot Learning for Personalised Automated Pain Assessment
Few-Shot Learning → isevaluatedon → BioVid Pain Database
confidence 99% · We evaluate our method on the BioVid Pain Database
Few-Shot Learning → isevaluatedon → SenseEmotion Database
confidence 99% · We evaluate our method on... the SenseEmotion Database
→ →
Cypher Suggestions (0)
No Cypher suggestions yet.
Abstract
Abstract:Pain perception varies substantially across individuals, making it difficult for population-based classifiers to generalise across all subjects in a dataset. One way to account for subject variability is to train personalised classifiers. In this work, we evaluate Few-Shot Learning, a sub-area of Meta-Learning, as an approach to personalisation in automated pain assessment. We re-interpret the shift from population-level to subject-level evaluation as a task-domain shift, where the observed classes remain fixed but the target subject changes. We evaluate our method on the BioVid Pain Database, the SenseEmotion Database, and the PainMonit Experimental Dataset (PMED), reaching 85.75% and 35.49% accuracy on BioVid and 82.37% and 41.88% on SenseEmotion in the binary and multi-class settings under a Leave-One-Subject-Out CV protocol respectively, and 90.47% on PMED, for which only a binary benchmark exists. Using samples to implement k-shot conditioning, the accuracies can be improved to 86.25%, 40.06%, 83.43%, 44.08%, and 91.25%, respectively. To further evaluate the effects and robustness of our method, we provide additional ablation experiments and investigate the personalisation effects. Our results suggest that support-conditioned few-shot adaptation can improve average performance under inter-subject variability.
Tags
Links
- Source: https://arxiv.org/abs/2610.09692v1
- Canonical: https://arxiv.org/abs/2610.09692v1
Trouble viewing inline? Open PDF directly →
Full Text
83,688 characters extracted from source content.
Expand or collapse full text
Few-Shot Learning for Personalised Automated Pain Assessment Heinke Hihn1,*, Ibrahim Eisawy1, Patrick Thiam2,3, Hans A. Kestler3, Friedhelm Schwenker2, 1 IU International University of Applied Sciences, Berlin, Germany 2 Institute of Neural Information Processing, Ulm University, Ulm, Germany 3 Institute of Medical Systems Biology, Ulm University, Ulm, Germany * heinke.hihn@iu.org Abstract Pain perception varies substantially across individuals, making it difficult for population-based classifiers to generalise across all subjects in a dataset. One way to account for subject variability is to train personalised classifiers. In this work, we evaluate Few-Shot Learning, a sub-area of Meta-Learning, as an approach to personalisation in automated pain assessment. We re-interpret the shift from population-level to subject-level evaluation as a task-domain shift, where the observed classes remain fixed but the target subject changes. We evaluate our method on the BioVid Pain Database, the SenseEmotion Database, and the PainMonit Experimental Dataset (PMED), reaching 85.75% and 35.49% accuracy on BioVid and 82.37% and 41.88% on SenseEmotion in the binary and multi-class settings under a Leave-One-Subject-Out CV protocol respectively, and 90.47% on PMED, for which only a binary benchmark exists. Using samples to implement k-shot conditioning, the accuracies can be improved to 86.25%, 40.06%, 83.43%, 44.08%, and 91.25%, respectively. To further evaluate the effects and robustness of our method, we provide additional ablation experiments and investigate the personalisation effects. Our results suggest that support-conditioned few-shot adaptation can improve average performance under inter-subject variability. Author summary This study investigates how Meta-Learning can be used to personalise population-level classifiers for Automated Pain Assessment to reduce inter-subject variance. This is still a major issue in subject-based data analysis. To this end, this study proposes a Few-Shot Learning mechanism that calibrates a model using a few labelled samples. The method is evaluated using three multimodal datasets and investigates personalisation benefits on a class level and on the subject level. The analysis revealed that not all classes and not all subjects benefit equally from personalisation: the intermediate classes, i.e., not the extreme no pain and highest pain, benefit the most from personalisation. The results of the study suggest that the Few-Shot Learning based approach offers an efficient way to build personalised classifiers. 1 Introduction Pain is a highly personal, private, and subjective emotion [64] that is characterised by severity, location, duration, and intensity. In addition, the pain experience is modulated by several personal factors, including cognition, past experiences, and the current situation [64]. As a result, the same pain stimulus can cause different reactions, or no reaction at all. These factors make it difficult to reliably assess pain leading to self-reporting tools such as the Visual Analogue Scale (VAS) [20] being the most common method. In cases where the patient is not able to articulate their pain, caregivers rely on visible reactions of the body and bio-physical signals, if available. In such cases, automated systems could provide decision support to assist physicians in determining the pain level a patient is in, which can help improve patient well-being and recovery. To advance towards such systems, researchers have collected data in controlled experiments, where healthy subjects were exposed to varying levels of pain stimuli and their bodily responses were recorded [57, 56, 15]. Such recordings range from bio-physical signals such as Electrodermal Activity (EDA), Electrocardiogram (ECG), and Electromyography (EMG) to video recordings of their facial expressions. These datasets have led to a set of automated pain assessment methods, ranging from hand-made features [31] to deep learning [50, 48, 14]. The highly subjective nature of pain leads to high inter-subject variability of classifiers trained on such generic population data, which is a widely documented challenge in automated pain systems [34, 64]. To overcome this challenge, automated pain assessment requires models that generalise across individuals, because pain expressions and physiological responses vary strongly between subjects. We group the approaches to this problem into four overlapping conceptual categories: (i) Preprocessing-level personalisation: Inter-subject variability is handled before or during modelling by making physiological responses more comparable across subjects. Strategies include subject-specific feature standardisation, individual pain-threshold calibration, and subject-aware normalisation [29, 42, 62]. (i) Model-level personalisation: The model is explicitly adapted to the individual rather than assuming one universal pain-response pattern. Ideas include subject-dependent models, personalised feature fusion, dynamic attention, and personal pain sensitivity representations [30, 42]. (i) Population-plus-individual modelling: Individual differences are not treated as noise but as meaningful structure that can be statistically or computationally modelled. Approaches include multi-task learning, person-specific outputs, subject profiles, clustering, and mixed-effects models [7, 37, 31, 18]. (iv) Generalisation-focused evaluation and adaptation: The central question is whether a model trained on source subjects generalises to a held-out subject. Strategies span transfer learning, uncertainty-guided personalisation, and Few-Shot-style adaptation [62, 18, 30, 29]. Several machine learning paradigms exist that aim to build adaptive classifiers, such as Meta-Learning [27, 21, 22], Continual Learning [59, 25, 23, 24], and Self-Supervised Learning [19]. While Self-Supervised Learning has seen recent applications to pain assessment [49] and processing of bio-physical signals [9], as well as Continual Learning in affective computing [55], only a few studies have evaluated Meta-Learning for automated pain assessment. To close this gap, we evaluate Meta-Learning as a candidate approach for devising personalised automated pain assessment systems to reduce inter-subject variability. In contrast to standard supervised learning, Meta-Learning aims to adapt the learning algorithm itself, so that instead of learning from scratch, it leverages previously acquired knowledge to adapt quickly to new problems. Specifically, we focus on Few-Shot Learning, which is designed for settings in which a model must adapt to a new task or individual from only a small number of labelled examples [22, 21, 61]. Considering that collecting data in pain assessment experiments is expensive and we typically have 8 [15] to 20 [57] samples per class and per subject, Few-Shot Learning matches the combination of subject variability and limited labelled data that characterises personalised automated pain assessment. To systematically investigate Few-Shot Learning in the context of personalised automated pain assessment, we aim to answer the following research questions: 1. To what extent can personalisation improve automated pain assessment under inter-individual variability? 2. Do the benefits of personalisation vary across individuals? 3. Do the benefits of personalisation vary across pain levels? To answer these research questions, this work makes the following contributions to automated pain assessment: 1. we propose an approach utilising Few-Shot Learning to build personalised classifiers, 2. we introduce a Cross Alignment Network allowing us to efficiently score samples against class-prototypes, and 3. we introduce a Zero-Shot extension of our method, allowing us to evaluate samples without requiring labelled support samples. This article is structured as follows: first, we discuss related work in Section 2. We introduce our core method in Section 3, evaluate it in Section 4, and conclude with a discussion in Section 5. 2 Related Work The method our work introduces is related to three sub-fields: methods that incorporate Few-Shot Learning into Leave-One-Subject-Out (LOSO) evaluation protocols, prototype-based methods for the automated assessment of pain, and personalisation in automated pain assessment. In the following, we discuss studies that fall into these categories. 2.1 Combining Few-Shot Learning with LOSO Evaluation Few-shot learning has been combined with Leave-One-Subject-Out evaluation protocols in several cross-subject EEG [2], physiological signal [58], and human activity recognition studies [6]. In such settings, the model is typically trained or meta-trained on all source subjects, while one subject is held out as the target subject. During evaluation, a small labelled support set from the held-out subject is used for adaptation or calibration when the evaluation protocol includes target-subject support samples, and the remaining samples from the same subject form the query/test set. This differs from strict LOSO evaluation, where no target-subject samples are available during training or adaptation. Few-shot learning has also been explored in automated pain assessment, with fewer published studies than in related areas such as EEG emotion recognition or human activity recognition. Existing work includes meta-learning approaches for facial-expression-based pain detection, such as Model Agnostic Meta-Learning-based adaptation on the UNBC-McMaster pain archive [43], as well as Few-Shot or prompt-based approaches for neonatal and infant pain assessment from visual or acoustic data [8, 41, 10]. These studies apply Few-Shot learning to pain-assessment settings with limited labelled data and inter-individual variability. Closest to our work is the approach of Rathee et al. [43], where the authors utilise a modified Model-Agnostic Meta-Learning approach, which can learn to detect pain intensity from facial expressions. They evaluated the proposed model on the UNBC-McMaster pain archive database and report higher accuracy for 1-shot and 5-shot learning than their baselines. In these studies, Few-Shot learning is used to address recurring challenges in pain assessment, especially limited labelled data, inter-individual variability, and the need for rapid adaptation to new subjects or patients. These studies motivate evaluating Few-Shot learning for automated pain assessment. 2.2 Prototype-Based Classification in Pain Assessment Prototype-based methods represent each class or cluster using one or more representative reference points, known as prototypes, and classify new samples based on their similarity or distance to these prototypes. This paradigm has been applied to pain assessment across multiple data modalities, including fMRI-based pain decoding [3], clustering of chronic pain patient records [33], and knowledge transfer between phasic and tonic pain stimuli [44]. These methods provide interpretable and flexible prototypes that are learned directly from the data. The prototypes naturally capture the heterogeneity of patient populations, and can serve as representative anchors for transferring knowledge across related pain conditions. Anter et al. [3] propose a model for decoding pain intensity from fMRI data. Their method uses both a reinforcement learning-enhanced whale optimisation algorithm (RLWOA) to identify discriminative pain-related fMRI features and a self-organizing fuzzy logic (SOFL) classifier to predict different pain intensities. The SOFL classifier automatically identifies data prototypes and constructs interpretable fuzzy rules without requiring predefined membership functions or assumptions about the underlying data distribution. The RLWOA-SOFL model also supports multi-class pain intensity classification, which is particularly relevant for clinical pain assessment, where pain is typically evaluated across up to 10 intensity levels. Khan et al. [33] apply k-prototypes clustering as an unsupervised learning technique to analyse chronic pain patient data and identify clinically meaningful clusters. They adopt k-prototypes because it is a partitioning-based method well suited to mixed-type or heterogeneous data. Unlike k-means or k-modes, which are restricted to numerical or categorical variables respectively, k-prototypes can handle both types simultaneously. The algorithm defines a set of virtual points, or prototypes, as the centre of the clusters. For numerical variables, these prototypes are represented by their mean values, and for categorical variables, these prototypes are represented by mode values. The algorithm then measures dissimilarity between two mixed-type objects A and B by combining a squared Euclidean distance over numerical features with a simple matching count over categorical ones. In their study, these prototype-based clusters are used to examine whether patient-reported chronic pain data align with established nociceptive, neuropathic, and nociplastic pain mechanisms. Ricken et al. [44] apply prototype-based knowledge transfer from short-term (phasic) to long-term (tonic) pain stimuli using physiological signals of the X-ITE Pain Database. A classification model is trained on the phasic domain, and class-specific prototypes (one for the no-pain and one for the pain class) are computed as feature-average samples of that domain. Each tonic sample is then partitioned into equally sized segments matching the length of the phasic samples, and the distance between every segment and each phasic prototype is measured. The segment with the smallest distance to the prototypes is selected and passed to the classifier to label the entire tonic sample. They evaluate a range of distance metrics for this segment selection, including Euclidean, City-Block, Chebyshev, Canberra, Bray–Curtis, and Wasserstein. The authors also compare this distance-based segment selection to a naive approach that feeds unmodified tonic stimuli to the phasic-trained model without adaptation. The distance-based selection of a single segment improves classification performance across most metrics; for example, on the trapezius signal (TRA) in the electric pain domain, it raised average accuracy from 66.0%\% to 68.0%\%, and on the electrodermal activity signal in the thermal domain, from 53.2%\% to 59.6%\%. 2.3 Personalisation in Automated Pain Assessment Sharafi et al. [45] introduce the Disentangled Source-Free Domain Adaptation (DSFDA) method, which addresses inter-subject variability and the challenge of adapting models with missing target expression data by leveraging neutral control videos for end-to-end generation and adaptation. Their setting is subject-based: a source model is pre-trained on all classes from the source subjects, then adapted to each target subject individually using only a short neutral control video, while testing covers both neutral and pain expressions. To compensate for the missing classes, DSFDA learns to disentangle expression-related from identity-related features and generates the absent non-neutral images for the target subject, combining data generation and adaptation in a single end-to-end stage. A self-supervision strategy further reconstructs target images preserving the same identity and source expression. The approach is evaluated on the BioVid and UNBC-McMaster pain assessment datasets, outperforming state-of-the-art source-free adaptation methods, which degrade sharply when only neutral target data is available for adaptation. Jiang et al. [30] propose a personalised neural network for time-continuous pain detection. The model addresses the inter-subject variability in the data by combining personalised feature fusion based on pain sensitivity with a dynamic feature attention mechanism. Pain sensitivity accounts for individual differences in pain perception, while the dynamic feature attention mechanism enables the model to focus on the most informative physiological features over time and better capture varying pain response patterns. The approach is evaluated on both the authors’ SpaExp and the BioVid Heat Pain dataset. It demonstrates improved cross-dataset generalisation across different pain protocols and shows competitive performance in pain intensity classification. Fang et al. [11] proposed the Adaptive Transfer Learning-based Pain Assessment System (ATLAS) to improve automatic pain assessment for new patients whose data are unlabelled and may differ from the data used to train the model. ATLAS applies Transfer Component Analysis (TCA) to reduce the distribution gap between the labelled source data and the new patient’s physiological signals, and adaptively combines the resulting personalised model with a general pretrained model. The framework was evaluated on the BioVid database using ECG, skin conductance, and electromyography signals. The results showed the approach outperformed three existing traditional machine learning-based approaches and achieved an average accuracy only 2%\% below that of supervised methods using labelled test data. Thiam et al. [52] propose a personalised, participant-independent pain recognition system based on the video channel to improve automatic pain assessment for an unseen participant whose facial responses may differ from those of the participants used to train the model. Several complementary facial descriptors, including landmark distances, head pose, LBP-TOP, LGBP-TOP, and PHOG, are each classified by a separate Random Forest and combined through a two-stage hierarchical fusion scheme. Rather than training on the entire annotated dataset, the system uses the Hausdorff distance and two variants based on the average and median of the distances between the points of two sets to measure the similarity between the unseen participant’s data and that of each training participant, and trains the model only on the most similar subset. The framework is evaluated on data collected within the SenseEmotion project of 40 participants undergoing thermal pain stimulation, for the task of distinguishing no stimulation from maximum pain. The results show that selecting around 30 participants outperformed the baseline that used all available data. However, the gains were small on the two datasets corresponding to the left and right forearm stimulation sites (65.7%\% to 66.8%\% and 67.6%\% to 67.8%\%, respectively), with the modest overall accuracy attributed to participants who displayed little visible facial reaction to the stimuli. 3 Method In the following, we will introduce the datasets we use for evaluation (Section 3.1) and the building blocks that comprise our method: (i)(i) how we re-frame automated pain assessment as subject-as-a-task prototype-based Few-Shot learning (Section 3.2), (ii)(i) how we apply cross-modal feature fusion to incorporate EDA and ECG signals (Section 3.3, (iii)(i) our proposed cross-attention scoring network used to compare support prototypes with query inputs (Section 3.4), and (iv)(iv) how we propose to turn our method into a Zero-Shot classifier that does not require any labelled samples from the held-out subject (Section 3.5). 3.1 Datasets Fig 1: The data in the experiments has been generated by subjecting subjects to various levels of pain (annotated as TiT_i) and a baseline of no pain and recording their bodily response by various bio-physical signals such as EDA, EMG, and ECG. This creates time series of signals annotated by the experienced pain level, thus enabling us to train models to predict the pain based on the signals. 3.1.1 The BioVid Pain Dataset We evaluate our method using the BioVid Heat Pain Database (Part A) [57]. It consists of 87 participants who were exposed to four levels of increasing thermal pain, indicated as T1T_1, T2T_2, T3T_3, and T4T_4. During the experiment, video streams, EDA, ECG, and EMG signals were recorded for each participant, enabling us to map their bodily reactions to the pain stimulus. Each pain level was elicited 20 times in random order, where each elicitation lasted 4s4s and was followed by a recovery phase (T0T_0 with 32°C) between 88 and 12s12s. Thus, in total the dataset consists of 20×5×87=8,70020× 5× 87=8,700 samples. We use the data augmentation described by Thiam et al. [50], which gives us 87,00087,000 samples in total. For our experiments, we rely only on the EDA and the ECG signals, following prior physiological pain-assessment work that emphasises EDA [39, 5, 35, 46, 12, 4, 54]. 3.1.2 The SenseEmotion Dataset Additionally, we assess our method on the SenseEmotion dataset [56]. The dataset consists of 45 healthy participants, each exposed to three increasing heat pain levels, indicated as T1, T2, T3. For this experiment, the signals (biopotentials: SCL/EDA, ECG, trapezius EMG, respiration), plus video (facial expressions, skeleton, head pose), were recorded. These signals enabled us to map body reactions to a certain pain level. Each pain level was applied 30 times for 4s4s in random order, with randomised pauses (T0T_0 with 32°C) of 8−13s8-13s between stimuli. This dataset consists of 3×30×45=40503× 30× 45=4050 pain-stimulus samples. For our experiments, we only use EDA and ECG signals for pain assessment, following prior physiological pain-assessment work [39, 5, 35, 46, 12, 4, 54]. T0T_0T1T_1T2T_2T3T_36.5 sec6.5 sec2 sec4 sec8–12 sec2 sec4 sec T0T_0T1T_1T2T_2T3T_3T4T_44.5 sec4.5 sec2 sec4 sec8–12 sec2 sec4 sec Fig 2: The left figure shows the signal segmentation in the SenseEmotion Database [56], where experiments have been carried out on 6.5s6.5s windows with a 4s4s shift from the onset of the elicitation in four pain levels T0,…,T3T_0,...,T_3. On the right, we show how in the BioVid Database [57] the windows are of 4.5s4.5s with an 4s4s shift on five pain levels T0,…,T4T_0,...,T_4. Thus, on sampling rate of 256 Hz we have an input dimensionality 1,6641,664 of and 1,1521,152, respectively. 3.1.3 The PainMonit Dataset Next, we assess our method on the PainMonit Database (PMED). It consists of 52 healthy participants who were exposed to 5 levels of increasing thermal pain, denoted as NP, P1P_1, P2P_2, P3P_3, and P4P_4. During the experiment, EDA, ECG, EMG, BVP, Resp, Temp, and Grip signals were recorded for each participant. These signals allow us to map the patient’s body reactions to the pain stimulus. Each pain level was elicited 8 times for 10s10s in random order, with a recovery phase (T0T_0 at 32°C) of between 2020 and 30s30s. Overall, the dataset consists of 6×∼8×52=24956× 8× 52=2495. In our experiments, we consider only the EDA and the ECG signals for pain assessment, following the prior physiological pain-assessment work [39, 5, 35, 46, 12, 4, 54]. 3.2 Few-Shot Task Construction Labelled support SUnlabelled query Q???? Task: support and query samplesEncoder per modality and CrossMod Fusion[fθEDA(x),fϕECG(x)]→F(x)[f^EDA_θ(x),f^ECG_φ(x)]→ F(x)Support feature mapsℱs=F(x):x∈F^s=\F(x):x \Query feature mapsℱq=F(x):x∈F^q=\F(x):x \Class prototype maps=c:c∈Cc=1|ℱc|∑Fis∈ℱcfθ(xi),ℱcs=(Fis,yi)∈ℱ:yi=c aligned \\ P&=\p_c:c∈ C\\\ p_c&= 1|F_c| _F^s_i _cf_θ(x_i),\\ F^s_c&=\(F^s_i,y_i) :y_i=c\ alignedCross Alignment Networksq,c=CANφ(c,ℱq) s_q,c=CAN_ (p_c,F^q)Predictiony^q∼softmaxsq,c y_q s_q,cClass 0Class 1 Fig 3: Our approach for Subject-As-A-Task Few-Shot Pain Assessment. First, we sample a task, which is then passed into an encoder for each modality. These streams are combined using a modified Cross Modality Transformer as introduced by Farmani et al. [12], as described in Section 3.3. The resulting support feature maps are used to compute a prototype per class against which we classify the query feature maps using the Cross Alignment Network described in Section 3.4. Few-shot learning [61] is an instance of meta-learning and describes a setting in which a model is expected to adapt to a new task, class, or domain using only a small number of labelled examples. Conceptually, the model first learns generalisable representations from a larger set of source data and then uses a limited support set to adjust its predictions for a new target case. Formally, Few-Shot learning considers a distribution over tasks ∼p()T p(T), where each task consists of a small labelled support set S and a query set Q. In an N-way K-shot classification setting with class set C and ||=N|C|=N, the support set contains K labelled examples for each class, i.e., we have =(xi,yi)i=1NK,=(xj,yj)j=1NQ.S=\(x_i,y_i)\_i=1^N_K, =\(x_j,y_j)\_j=1^N_Q. (1) The task is then to use the support samples to condition a model such that it can classify the query samples. In a special case where k=0k=0 known as Zero-Shot learning, the model must do so without any conditioning samples. Prototype-based Few-Shot learning solves this by representing each input x through a learned embedding function fθ(x)f_θ(x) with parameters θ and computes one prototype per class as an aggregated embedding of the corresponding support examples, as the mean of the support embeddings as c=1|c|∑(xi,yi)∈cfθ(xi),c=(xi,yi)∈:yi=c,p_c= 1|S_c| _(x_i,y_i) _cf_θ(x_i), _c=\(x_i,y_i) :y_i=c\, (2) where cp_c is the prototype for class c as defined by the labels yiy_i, cS_c is the support set for class c, and fθ(xi)f_θ(x_i) is an embedding model that takes an input signal xix_i and transforms it to a low dimensional embedding. A query example xjx_j is then classified using a k-nearest-neighbours scheme based on its distance to the class prototypes by using a softmax over a similarity measure between the embedding of xjx_j and the class prototypes cp_c as pθ(y=c∣xj,)=exp(d(fθ(xj),c))∑c′∈exp(d(fθ(xj),c′)),p_θ(y=c x_j,S)= (d(f_θ(x_j),p_c) ) _c (d(f_θ(x_j),p_c ) ), (3) where pθp_θ is the conditional class probability given the input x and a set of support samples S, and d is a function that computes the similarity between two embeddings. Here, we used the cosine similarity defined as d(fθ(x),)=fθ(x)⊤∥fθ(x)∥2∥2=∑i=1nfθ(x)ii∑i=1nfθ(x)i2∑i=1ni2.d(f_θ(x),p)= f_θ(x) p f_θ(x) _2\, _2= _i=1^nf_θ(x)_ip_i _i=1^nf_θ(x)_i^2 _i=1^np_i^2. (4) The embedding parameters θ are learned by minimising the query-set classification loss across tasks, where we use the support set to anchor the prediction as ℒ=∼p()[−∑(xj,yj)∈logpθ(yj∣xj,)],L=E_T p(T) [- _(x_j,y_j) p_θ(y_j x_j,S) ], (5) where T are task sets consisting of a query set Q and a support set S. Thus, learning is not optimised directly for a fixed set of classes, but for the ability to form discriminative class prototypes from only a few labelled support examples and generalise to unseen query examples. Figure 3 visualises the described approach. In the LOSO configuration, the held-out subject is not used to construct tasks during training and only serves as the task set during evaluation. We implement two evaluation schemes: Zero-Shot refers to using a prototype bank constructed from encoding all training subjects, while k-Shot refers to using a subset of the held-out subjects’ data to calibrate the model – see Subsection 3.5 for a more detailed explanation. 3.3 CrossMod Feature Fusion Our approach implements a multimodal learning scheme, where we leverage two bio-physical signal streams. To combine them, we implement a modified version of the CrossMod approach introduced by Farmani et al. [12] as a feature-map encoder for EDA and ECG signals. For each signal window of length T given as [xFEDA,xFECG]∈ℝT×2 [x_F^EDA,x_F^ECG ] ^T× 2 the two modalities are first processed by independent encoders, resulting in the modality-specific feature maps Fim=fΘm(xi)∈ℝT′×Df,F_i^m=f_ ^m(x_i) ^T × D_f, where m∈EDA,ECGm∈\EDA,ECG\ is the modality, and Θ∈θ,ϕ ∈\θ,φ\ are the separate parameters of the encoders, and T′,DfT ,D_f are the dimensions of the feature maps. The two branches use the same configuration and therefore preserve a common temporal length T′T . We process the resulting maps with separate pre-normalised Transformer encoder stacks, yielding ZEDAZ^EDA and ZECGZ^ECG. This allows temporal dependencies to be modelled within each modality before information is exchanged between the two processing paths. The fusion stage applies bidirectional multi-head cross-attention [36].Then the two directed feature maps are computed as CEDA→ECG C^EDA =MHA(Q=ZEDA,K=ZECG,V=ZECG), =MHA (Q=Z^EDA,K=Z^ECG,V=Z^ECG ), (6) CECG→EDA C^ECG =MHA(Q=ZECG,K=ZEDA,V=ZEDA), =MHA (Q=Z^ECG,K=Z^EDA,V=Z^EDA ), (7) where MHAMHA is a multi-head attention and Q, K, V are the query, key, and value inputs, respectively, producing the cross-attended map CEDA→ECGC^EDA between EDA and ECG, and CECG→EDAC^ECG between ECG and EDA. Finally, the two cross-attended maps are concatenated along the feature dimension to obtain the single temporal feature map F as F=[CEDA→ECG,CECG→EDA]∈ℝT′×2Df.F= [C^EDA ,C^ECG ] ^T × 2D_f. (8) Thus, in the subsequent notation, T=T′T=T and D=2DfD=2D_f. No separate classifier is attached to this representation. The same encoder produces the support maps, which are averaged class-wise into PcP_c, which are then passed to the Cross Alignment Network described in Section 3.4. 3.4 Cross-Attention Network Scoring To efficiently score the alignment of query feature maps with the prototypes and thus be able to classify them, we use the Cross Alignment Network (CAN), as originally proposed by Hou et al. [28] and recently applied to automated pain assessment by Gkikas et al. [14] and Li et al. [35]. To this end, we form a descriptor of a prototype-query pair. Let μ _p =1T∑id,cand = 1T_p _ip_d,c 10.00002ptand (9) μF _F =1TF∑jFj = 1T_F _jF_j (10) denote the un-normalised temporal means of the prototypes p of class c, and of the query feature maps F. Their concatenation as d,Fpair=[μ,μF,|μ−μF|,μ⊙μF],d^pair_p,F=[ _p, _F,| _p- _F|, _p _F], (11) amended with an absolute difference, and an element-wise product defines the pair descriptor. A meta-kernel network maps this descriptor to normalised kernels over the opposite temporal axes, as f,F f_p,F =ReLU(d,FpairWpair+bpair), =ReLU (d^pair_p,F\,W_pair+b_pair ), (12) k k_p =softmax(f,FW+b), =softmax (f_p,F\,W_p+b_p ), (13) kF k_F =softmax(f,FWF+bF), =softmax (f_p,F\,W_F+b_F ), (14) where f,Ff_p,F is the non-linear transformation of the pair-descriptor d,Fpaird^pair_p,F, k∈ℝTFk_p ^T_F weights query positions when computing prototype-side evidence, whereas kF∈ℝTk_F ^T_p weights prototype positions when computing query-side evidence, and W and b denote the respective weights and biases of these transformations. Next, we aggregate the attention maps and scale them as u u^p =∑iRi,jk,i, = _iR_i,j\,k_p,i, A A_p =softmax(u/τ), =softmax (u^p/τ ), (15) uF u^F =∑jRi,jkF,j, = _jR_i,j\,k_F,j, AF A_F =softmax(uF/τ), =softmax (u^F/τ ), (16) where τ>0τ>0 controls the concentration of both temporal attention distributions. The softmax in A_p operates over p, and the softmax in AFA_F operates over r. Ri,jR_i,j is the temporal correlation matrix, making u^p and uFu^F marginals over the correlation matrix in their respective dimension. In the following, we explain how we compute Ri,jR_i,j and how we interpret it in the context of CAN. First, we normalise every temporal feature vector in the prototype map p and in the query map F along the respective temportal positions i and j as ¯i=i∥i∥2,F¯j=Fj∥Fj∥2, p_i= p_i _i _2, F_j= F_j F_j _2, (17) and construct the temporal correlation matrix as Ri,j=⟨¯i,F¯j⟩∈ℝT×TF,R_i,j= p_i, F_j ^T_p× T_F, (18) where T_p and TFT_F are the temporal dimensions of the prototype map and the query map, respectively. Thus, each entry measures the cosine similarity between one prototype position d and one query position r. This is the temporal analogue of the local correlation layer in the original image-based CAN [28]. Next, we compute an attention-weighted temporal summary for each branch as z=∑iApi,zF=∑jAF,jFj.z_p= _iA_p\,p_i, z_F= _jA_F,j\,F_j. (19) To retain a stable global representation while allowing pair-conditioned attention to emphasise informative temporal positions, a learned scalar gate interpolates between each unweighted temporal mean and its attention-weighted summary. Specifically, with g=σ(γ)∈(0,1)g=σ(γ)∈(0,1), where γ is a trainable parameter shared by the prototype and query branches, the final descriptors are v=(1−g)μ+gz,vF=(1−g)μF+gzF.v_p=(1-g) _p+g\,z_p, v_F=(1-g) _F+g\,z_F. (20) The CAN score is then the cosine similarity between these descriptors for prototype p and feature map F, given as ρ,F=⟨v∥v∥2,vF∥vF∥2⟩. _p,F= v_p v_p _2, v_F v_F _2 . (21) Repeating this computation for all classes yields one similarity score per query–class pair, which can then be used to compute the class-level similarity score as s,F=log(1Mslot∑m=1Mslotexp(ρm,F)),s_p,F= ( 1M_slot _m=1^M_slot ( _p_m,F) ), (22) where mp_m are the M prototypes and F is the feature maps of the query samples computed as described earlier. 3.5 Zero-Shot Classification via a Prototype Bank Zero-ShotShared query pipelinekk-shotUnlabelled query Q???⋯·s??Encoder[fψEDA(x),fϕECG(x)]⟶F(x) [f^EDA_ψ(x),f^ECG_φ(x) ] F(x)Query feature mapsℱq=F(x):x∈F^q=\F(x):x \Cross Alignment Networkρq,c,m=CANφ(Pc,m,ℱq) _q,c,m=CAN_ \! (P_c,m,F^q )Slot aggregations,F=log(1Mslot∑m=1Mslotexp(ρq,c,m)) s_p,F= \! ( 1M_slot _m=1^M_slot \! ( _q,c,m ) )Predictiony^∼softmaxc(s,F) y _c (s_p,F )Prototype bankΠ∈ℝ||×Mslot×T×D ^|C|× M_slot× T_p× DClass c12⋯·sMMClass c′c 12⋯·sMM precomputed offline Labelled support (s,k)S^(s,k)Class c⋯·sClass c′c ⋯·skk samples / classSupport feature mapsℱ(s,k)=F(x):x∈(s,k)F^(s,k)=\F(x):x ^(s,k)\Subject-specific prototype slots per classΠc,m(s,k)=Initm(F(xc,i(s))i=1k) ^(s,k)_c,m=Init_m\! (\F(x^(s)_c,i)\_i=1^k )P1P_1P2P_2⋯·sPCP_C Fig 4: Our method supports two modes of inference: in the Zero-Shot setting (left), we use a global precomputed bank to initialize the prototypes. Thus, this mode does not require any labelled samples from the subject. In the k-Shot case (right), we use a portion of the held-out subjects samples to initialize the prototypes (the support set) and classify the remainder (the query set). Thus, the Zero-Shot setup is the aggregated population level classifier and the k-Shot setup is the personalised individual classifier. So far, our method is only able to classify samples for the held-out subject if we already have at least one labelled sample. To enable Zero-Shot classification [60], i.e., requiring no previous samples, we introduce a prototype bank that acts as a substitute for the support samples by using persistent temporal prototype slots. Figure 4 visualizes the Zero-Shot and k-Shot inference modes. The prototype bank Π contains MslotM_slot slots per class c, Π∈ℝ||×Mslot×T×D,Πc,m∈ℝT×D, ^|C|× M_slot× T_p× D, _c,m ^T_p× D, (23) where C is the task class set and m∈1,…,Mslotm∈\1,…,M_slot\ indexes multiple learned prototypes for the same class. Multiple slots allow the bank to represent within-class heterogeneity instead of forcing each class into a single temporal template. The memory slots are computed by randomly drawing 258 samples per class (three samples per training subject, i.e., OPEN3×86=258)3× 86=258) and per slot without replacement over all training subjects, encoding them, and then averaging their feature maps. Class-level similarity is obtained with the same log-mean-exp slot aggregation as in the Few-Shot setting, as given by Eq. (22). When we refer to Zero-Shot in our experiments, the evaluation is using the prototype memory as a substitute for the support-based prototypes as described earlier. 4 Results We evaluated our method on the BioVid Heat Pain Database benchmark [57], on the SenseEmotion Dataset [56], and on the PainMonit Experimental Dataset (PMED) [15]. All experiments were designed with our three research questions in mind, namely (i) To what extent can personalisation improve automated pain assessment under inter-individual variability?, (i) Do the benefits of personalisation vary across individuals?, and (i) Do the benefits of personalisation vary across pain levels? We report our results from a single Leave-one-Subject-out (LOSO) run averaged over the metrics computed on the held-out subject. Following Thiam et al. [50], we used the augmented data for training and the original, unaltered samples for evaluation – see Figure 2 for more details. Hyperparameters as reported in Table 7 were found by an Optuna [1] search on a reduced number of iterations. 4.1 Personalisation for Automated Pain Assessment Table 1: Overview of reported pain recognition performance by algorithm/model on the SenseEmotion dataset. All values are reported for Leave-One-Subject-Out (LOSO) cross-validation. Accuracy is reported with standard deviation in parentheses where available. Bold indicates best Zero-Shot method and underlined indicates that the personalised k-Shot classifiers beats previous methods. Method Binary Four Classes Thiam et al. [51] 83.39% 43.89% Thiam et al. [49] 81.05% 40.80% Thiam et al. [54] 81.50% n/a Thiam et al. [53] 64.35% n/a Kessler et al. [32] 71.85% n/a Ours (Zero-Shot) 82.37% (±10.9± 10.9) 41.88% (±6.6± 6.6) Ours (k-Shot) 83.43% (±11.2± 11.2) 44.08% (±9.1± 9.1) Table 2: Overview of reported pain recognition performance by algorithm/model on the BioVid dataset. All values are reported for Leave-One-Subject-Out (LOSO) cross-validation. Accuracy is reported with standard deviation in parentheses where available. Bold indicates best Zero-Shot method and underlined indicates that the personalised k-Shot classifiers beats previous methods. Method Binary Five Classes Farmani et al. [12] 87.52% (±11.0± 11.0) n/a Aslam et al. [4] 86.90% n/a Li et al. [35] 86.21% 38.03% Lu et al. [39] 85.56% 34.46% Thiam et al. [54] 85.32% (±13.7± 13.7) n/a Jiang et al. [30] 84.58% (±13.3± 13.3) 39.24% (±8.65± 8.65) Thiam et al. [48] 84.40% (±14.4± 14.4) 36.54% (±8.55± 8.55) Thiam et al. [50] 84.20% (±13.7± 13.7) 35.50% (±7.9± 7.9) Steuer & Schwenker [47] 84.22% (±13.2± 13.2) n/a Hihn & Schwenker [26] 84.00% (±15.8± 15.8) 36.20% (±9.7± 9.7) Ours (Zero-Shot) 85.75% (± 13.5) 35.49% (±7.00± 7.00) Ours (k-Shot) 86.25% (± 14.2) 40.06% (±12.1± 12.1) Table 3: Overview of reported pain recognition performance by algorithm/model on the PainMonit dataset. All values are reported for Leave-One-Subject-Out (LOSO) cross-validation. Accuracy is reported with standard deviation in parentheses where available. Bold indicates best Zero-Shot method and underlined indicates that the personalised k-Shot classifiers beats previous methods. Method Binary Luebke et al. [40] 93.62% Gouverneur et al. [17] 93.26% Gouverneur et al. [17] 89.79% (± 11.68) Gouverneur et al. [16] 87.41% (±11.99± 11.99) Gouverneur et al. [17] 91.09% (±9.70± 9.70) Ours (Zero-Shot) 90.47% (± 9.23) Ours (k-Shot) 91.25% (± 8.91) To answer the first research question (To what extent can personalisation improve automated pain assessment under inter-individual variability?), we provide results from the automated pain assessment benchmark in binary (no pain vs. high pain stimulus) and full multi-classification settings in Tables 1, 2, and 3. To avoid single dataset bias, we evaluate our method on three datasets and in several classification settings. This gives us an overview of our method’s performance compared to previously published models. On the BioVid dataset and in the Zero-Shot case, our method reaches 85.75%85.75\% binary accuracy and 35.49%35.49\% multi-class accuracy; in the k-Shot case, it reaches 86.25%86.25\% and 40.06%40.06\%, respectively. On the SenseEmotion dataset, our method reaches 82.37%82.37\% binary accuracy and 41.88%41.88\% multi-class accuracy in the Zero-Shot case; in the k-Shot case, it reaches 83.43%83.43\% and 44.08%44.08\%, respectively. On PMED, our method reaches 90.47%90.47\% binary accuracy in the Zero-Shot case and 91.25%91.25\% in the k-Shot case; no multi-class benchmark has been reported for this dataset, so we evaluate it in the binary setting only. In the k-Shot adaptive case, the method uses labels from the held-out subject, so this setting is not directly comparable to Zero-Shot methods, which is why we compare methods directly only in the Zero-Shot setting and report k-Shot results to demonstrate the potential benefits of personalisation as we have introduced it in our work. The Zero-Shot performance of our method is comparable to previous methods. Under the present episodic evaluation protocol, k-Shot classification produced higher mean multi-class performance than state-of-the-art methods on the BioVid dataset (40.06%40.06\% vs. 39.24%39.24\%) and on the SenseEmotion dataset (44.08%44.08\% vs. 43.89%43.89\%), suggesting the largest benefit of personalisation is in the complex full-class setting. In the binary setting, our method yields comparable performance. We investigate the personalisation benefits across classes furhter in Section 4.3 and in Figure 6. In Table 4 we investigate additional binary classification settings. Our method shows benefits in the k-Shot setting in all classification problems and yields higher performance in the Zero-Shot setting for T0T_0 vs. T1T_1, T0T_0 vs. T2T_2 on BioVid and T0T_0 vs. T2T_2 on SenseEmotion compared to other methods. The setting T0T_0 vs. T1T_1 poses the most difficult classification problem, as the corresponding pain stimuli are closest and thus the bodily reactions are similar. In that setting, our method yields higher accuracy than previous methods on the BioVid dataset and comparable accuracy on the SenseEmotion dataset. Additionally, all personalised k-Shot classifiers outperform previous methods, except for the binary cass in BioVid, where Farmani et al. [12] report 87.52%, above our k-Shot 86.25%. Overall, the benefits of personalisation as we have formalised it in our study vary between settings but are consistent in that it yields higher accuracy. In all settings and datasets, the increase in accuracy in the k-Shot setting indicates the benefit of personalisation, which we investigate further in the next sections. Table 4: Comparison of additional binary pain recognition results. Bold indicates best Zero-Shot method and underlined indicates that the personalised k-Shot classifiers beats previous methods. BioVid Method T0 vs. T1 T0 vs. T2 Thiam et al. [48] 61.15% (±12.20± 12.20) 66.81% (±15.92± 15.92) Gkikas et al. [13] 52.38% 52.78% Werner et al. [63] 48.70% 51.60% Gkikas et al. [13] 62.82% 63.68% Lopez & Picard [38] 56.44% 59.40% Ours (Zero-Shot) 61.26% (±13.02± 13.02) 67.07% (±14.91± 14.91) Ours (k-Shot) 62.25% (±14.20± 14.20) 68.06% (±16.56± 16.56) Method T0 vs. T3 T1 vs. T4 Thiam et al. [48] 76.29% (±14.62± 14.62) 76.72% (±15.02± 15.02) Gkikas et al. [13] 55.37% n/a Werner et al. [63] 56.50% n/a Gkikas et al. [13] 66.12% n/a Lopez et al. [38] 66.00% n/a Ours (Zero-Shot) 76.15% (±16.11± 16.11) 76.67% (±15.33± 15.33) Ours (k-Shot) 77.01% (±14.34± 14.34) 76.98% (±11.788± 11.788) SenseEmotion Method T0 vs. T1 T0 vs. T2 Thiam et al. [51] 52.74% (±7.64± 7.64) 60.91% (±12.69± 12.69) Ours (Zero-Shot) 52.46% 62.44% (±9.66± 9.66) Ours (k-Shot) 53.86% 63.89% (±7.96± 7.96) 4.2 Personalisation Benefits per Subject Fig 5: Personalisation benefits per subject. A vast majority of 91% to 98% of subjects benefit from personalisation in the BioVid full classification setting, i.e., using part of their samples to initialize the prototypes (see Panels A, B, D). Panel A shows a mean improvement in macro F1 is +0.097+0.097. Panel E shows the distribution of the improvements in the different k settings. To answer the second research question (Do the benefits of personalisation vary across individuals?), we analyse subject-level changes in classification performance on the BioVid dataset in Figure 5. The results in the 10-shot setting show that personalisation does not affect all held-out subjects equally: although almost all subjects improve, some experience lower macro-F1 in their respective LOSO runs, ranging from −0.03-0.03 to 0.330.33 with a mean of 0.0970.097, median of 0.0920.092, and a standard deviation of 0.060.06, as shown in Panel A of Figure 5. Panel D in Figure 5 further support the conclusion that 91% to 98% of subjects benefit from personalisation. However, the improvement varies with the number of support samples available. At k=1k=1, each class contributes only one labelled sample to the support statistics. Noisy or atypical support windows can therefore produce unrepresentative prototypes, leading to the lowest benefit. Once we add five or more samples, the fraction of subjects that benefits increases, as other, more representative samples may counterbalance noisy samples. The evaluation protocol introduces an additional source of variation. The Zero-Shot condition uses all held-out query samples once, whereas the k-Shot condition aggregates 500 sampled support/query episodes. It therefore estimates expected support-conditioned episodic performance rather than performance on the same fixed query set before and after adding support. Unfavourable support or query samples can lower a subject’s estimated k-Shot performance even when a different support set would be beneficial. In summary, personalisation improves mean macro-F1, but its benefit varies substantially across subjects. Persistent gain patterns and large random subject effects provide evidence of stable subject-level improvements, as supported by the analyses in Figure 5. Fig 6: Personalisation benefits per class on the BioVid dataset. Panels A and B show that the intermediate pain levels 1, 2, and 3 have the largest mean F1 gains from personalisation. Their respective F1 scores improve on average, indicating that personalisation contributes most for pain levels that vary only little in magnitude, compared with the extremes 0 and 4. Panels C and D show how subjects benefit on a per-class basis, indicating the same pattern of improvement in classes 1 to 3. Fig 7: Different settings of training for the BioVid (A+B) and the SenseEmotion (C+D) dataset. In all settings increasing the training task size (k,qk,q values) improves the results with a ceiling on k,q=10k,q=10 where we do not observe significantly higher results. All significant p-values are <0.001<0.001. 4.3 Personalisation Benefits per Class To answer the third research question (Do the benefits of personalisation vary across pain levels?), we analysed the average gain in the F1 score on a per-class basis in Figure 6. Classes 1, 2, and 3 have mean F1 gains of 0.1900.190, 0.1830.183, and 0.1740.174, respectively, whereas the baseline class 0 and the maximum pain level 4 have gains of −0.126-0.126 and 0.0610.061, respectively. This class-wise pattern is consistent with inter-subject variation being concentrated in the intermediate pain levels rather than at the two extremes. The negative change in classes 0 and 4 indicates that the model is moving some of its descriptive power from the extremes to the intermediate classes, facilitating a trade-off in which class-0 F1 decreases while intermediate-class F1 increases. In summary, the multi-class analyses show a consistent redistribution of performance across pain levels. Personalisation improves the hard intermediate classes but reduces F1 for class 0 across the inspected support sizes and, at small k, reduces F1 for the highest pain class. 4.4 Ablation Experiments Fig 8: Mean held-out performance across training and evaluation conditions for binary classification (top) and multi-class classification (bottom) on the SenseEmotion dataset. Columns show accuracy and macro-F1. The Zero-Shot condition (ke,qe)=(0,20)(k_e,q_e)=(0,20) uses learned prototype memory, whereas the remaining conditions use target-subject support. We have designed a set of ablation experiments to verify the stability and performance of our proposed method. We investigate the choice of signals used, and the number of support samples during evaluation and during training. 4.4.1 Training and Evaluation Task Setup In Figure 9 we evaluate the number of support and query samples during training, indicated as ktk_t and qtq_t, respectively in the personalised k-shot setting on the BioVid (9.A+9.B) and one the SenseEmotion (9.C+9.D) dataset. The mean accuracy and F1 score improve significantly up to kt,qt=5k_t,q_t=5, and the gains are smaller beyond that point. These results suggest that increasing the number of support samples during training helps the model extract more robust feature spaces, but the effect hits a ceiling after 10 samples. Figure 8 shows results of an ablation experiment on the SenseEmotion dataset that inspects the influence of the number of support samples used during evaluation. As expected, increasing the number of support samples improves average accuracy, but the effect occurs only on the personalised k-Shot settings – we will discuss this further in Figure 9. These results indicate that an increased number of support samples during the evaluation enables the model to find prototypes that are less noisy and more representative. Fig 9: Effect of training and evaluation task size on BioVid binary (A+B) and five-class (C+D) performance. Points represent held-out subjects, and boxes show the score distributions. Here, T and E denote the training and configured k-shot evaluation tasks, respectively. Additionally, we examined whether the support/query configuration used during training affected zero-shot and subject-adapted performance on BioVid – see Figure 9. In the binary task, the training configuration had virtually no effect on either zero-shot accuracy (Friedman test, Holm-adjusted p=1.000p=1.000, Kendall’s W=0.006W=0.006) or macro-F1 (p=1.000p=1.000, W=0.009W=0.009). In contrast, k-shot performance varied significantly across the training and evaluation settings for both accuracy (p<0.001p<0.001, W=0.336W=0.336) and macro-F1 (p<0.001p<0.001, W=0.332W=0.332). The corresponding phase-by-setting interactions were also significant (p<0.001p<0.001), indicating that episodic task size primarily affected the benefit obtained from subject-specific support rather than the model’s zero-shot capability. A similar, but more nuanced, pattern was observed in the five-class task. Zero-shot accuracy remained stable across training configurations (p=0.581p=0.581, W=0.018W=0.018), whereas k-shot accuracy showed a large setting effect (p<0.001p<0.001, W=0.609W=0.609). Macro-F1 varied across settings in both phases, although the effect was considerably larger for k-shot performance (p<0.001p<0.001, W=0.549W=0.549) than for zero-shot performance (p<0.001p<0.001, W=0.199W=0.199). Overall, these results suggest that the choice of episodic k and q mainly determines how effectively the model exploits target-subject support, while its unadapted accuracy remains largely insensitive to this choice, wehreas the F1-score is significantly impacted by this choice. 4.4.2 Choice of Signal Channels Previous studies argued that the EDA channel in combination with the ECG channel carries the most information about the perceived pain of a participant. Table 5 shows the results of all possible combinations of two modalities in the binary classification tasks of the BioVid and the SenseEmotion datasets. The results confirm our assumption, as the combination of EDA and ECG yields the highest performance. However, the difference is marginal and not statistically significant. BioVid SenseEmotion Modalities Zero-Shot k-Shot Zero-Shot k-Shot EMG+RSP N/A N/A 63.79% (±11.6)(± 11.6) 64.71% (±11.7)(± 11.7) ECG+RSP N/A N/A 64.60% (±11.3)(± 11.3) 67.51% (±12.2)(± 12.2) EDA+RSP N/A N/A 81.64% (±10.4)(± 10.4) 82.44% (±10.7)(± 10.7) EDA+EMG 85.52% (±9.31)(± 9.31) 85.68% (±9.31)(± 9.31) 81.52% (±9.31)(± 9.31) 81.99% (±10.7)(± 10.7) ECG+EMG 59.39% (±15.2)(± 15.2) 65.14% (±16.0)(± 16.0) 58.46% (±10.1)(± 10.1) 63.34% (±11.8)(± 11.8) EDA+ECG 85.75% (±13.5)(± 13.5) 86.25% (±14.2)(± 14.2) 82.37% (±10.9)(± 10.9) 83.43% (±11.2)(± 11.2) Table 5: Ablation study on the modalities used. In accordance with previous studies [39, 35], EDA+ECG achieves the highest classification accuracy in the binary (T0T_0 vs. T4T_4 and T0T_0 vs. T3T_3, respectively) LOSO setting. N/A indicates that the corresponding modality is not available in the dataset. We report accuracy and trained the models with k,q=10k,q=10. In summary, these ablation experiments suggest that the Few-Shot Subject-as-a-Task setup we devised in this work is enabling the model to learn robust and transferable feature maps. To examine the effect of the support size k, more experiments are needed where we keep q fixed and vary only k. 4.5 Experimental Setup We ran all our experiments on a single 16 GB consumer-grade GPU on Google Colab. We provide the hyper-parameters used for training and evaluation in Table 7 and describe our architecture in Table 6. The code for our implementation can be found under https://github.com/hhihn/FewShotPainAdaptation. Table 6: Compact architecture of the proposed CAN model. Stage Core configuration Output Input EDA and ECG windows with 1152 steps B×1152×2B× 1152× 2 Modality encoders Independent temporal convolutional frontends with pooling 2×(B×78×16)2×(B× 78× 16) CrossMod fusion Two 8-head self-attention layers followed by bidirectional cross-modal attention B×78×32B× 78× 32 Prototype memory Mslot=2M_slot=2 learned temporal prototype slots per class Bt×||Mslot×78×32B_t×|C|M_slot× 78× 32 Query encoding The same modality encoders and CrossMod fusion are applied to each query Bt×Q×78×32B_t× Q× 78× 32 CAN alignment Pair-conditioned bidirectional temporal attention and attended cosine similarity, τ=0.025τ=0.025 Bt×Q×||MslotB_t× Q×|C|M_slot Classification Log-mean-exp over slots followed by non-negative logit scaling Bt×Q×||B_t× Q×|C| Total Params. Binary 37.7K Five Classes 44.3K Table 7: Main hyperparameters used for the full LOSO experiment. Hyperparameter Setting Temporal frontend Filters 8/168/16; kernels 64/1664/16 Pooling / dropout / L2L_2 4,84,8 / 0.250.25 / 10−410^-4 CrossMod configuration 2 layers; 8 heads; hidden dim. 128 CAN configuration τ=0.025τ=0.025; meta hidden dim. 32 CAN support source Learned prototype memory Prototype memory 2 slots/class; 256 init. samples/class Learning rate / schedule 6×10−46× 10^-4 / cosine Training budget 1 epoch; 20,000 tasks; batch size 16 Data augmentation Gaussian noise 0.010.01; window shift Validation / held-out tasks 50 / 500; checkpoint by F1 5 Discussion This study investigated whether Few-Shot learning can support personalised automated pain assessment. With respect to the first research question, the Zero-Shot variant produced accuracies within the range of previously reported LOSO results, while the support-conditioned k-Shot variant produced higher mean accuracy than the Zero-Shot variant in every evaluated setting. The largest differences were observed in the multi-class tasks, for which the k-Shot model reached 40.06% accuracy on BioVid and 44.08% on SenseEmotion. These values were numerically higher than the best comparison values listed in Tables 1, 2, and 3, but they should not be interpreted as evidence of superiority over those methods. In contrast to the comparison methods, k-Shot inference uses labelled examples from the held-out subject, and the studies may also differ in preprocessing, model selection, and evaluation details. The results instead show the performance attainable when a small, balanced set of subject-specific labels is available. Additionally, any outperforming accuracy in the reported results in Tables 1, 2, and 3 should be treated with care as no previous study reports statistical tests results comparing their achievement with previous study and all differences are marginal compared to the reported standard deviation of the LOSO setting. Thus, we focus more an how the k-Shot personalisation affects subject- and class-based results compared to the Zero-Shot case. The subject-level analysis answers the second research question by showing that the association between personalisation and performance is heterogeneous. Most held-out subjects had higher estimated macro-F1 in the k-Shot condition, and the mean difference was positive, but a minority had no benefit or lower performance. The dependence on support-set size is consistent with the hypothesis that a single atypical or noisy support window can yield an unrepresentative class prototype, whereas several support samples provide a more stable estimate. This mechanism was not measured directly, however, and the reported differences do not constitute fixed-query estimates of the causal effect of adding support: Zero-Shot performance was computed on the complete held-out query set, whereas k-Shot performance was averaged over episodes containing sampled support and query sets. A paired analysis using identical query samples before and after adaptation is needed to isolate the effect of personalisation at subject level. The class-wise findings address the third research question. Personalisation was associated with the largest F1 gains for the intermediate BioVid pain levels, while class-0 F1 decreased and the maximum pain class showed a smaller gain. Thus, the improvement in macro-F1 reflects a redistribution of errors rather than a uniform improvement across pain levels. One possible explanation is that physiological responses to intermediate stimuli exhibit greater between-subject variation or overlap more strongly than responses at the extremes, making subject-specific prototypes particularly useful for these classes. The current experiments do not directly test this explanation. Relating class-wise gains to within- and between-subject physiological variability, prototype dispersion, and changes in the confusion matrix would help determine whether the observed pattern reflects improved subject calibration or a shift in the model’s decision boundaries that disadvantages the no-pain class. These findings extend earlier work on personalised pain assessment and Few-Shot adaptation. Prior approaches have used personalised physiological feature fusion and attention [30], source-free subject adaptation from neutral facial data [45], participant selection [52], and MAML-based adaptation of facial pain expressions [43]. The present results provide complementary evidence for a prototype-based approach using ECG and EDA, with each held-out subject treated as a new task. In particular, the prototype formulation permits adaptation without updating all model parameters. At the same time, the need for labelled examples from every target class makes the k-Shot setting more demanding than approaches that adapt from unlabelled data or from a neutral reference alone. 5.1 Limitations Several limitations remain. First, the Zero-Shot path uses transductive normalisation: its statistics are computed jointly from all query samples of the held-out subject. This gives the model access to the distribution of the complete, although unlabelled, test batch and may not represent deployment in which samples must be classified individually or arrive sequentially. Second, k-Shot personalisation requires labelled target-subject examples for every class; its annotation cost therefore grows as N×KN× K and may be substantial in clinical settings, particularly when balanced examples of multiple pain levels must be elicited. Third, the episodic estimates depend on randomly sampled support and query windows. Although results are aggregated across 500 episodes, sampling variance and the use of different query sets across conditions limit subject-level comparisons and prevent a fixed-query counterfactual interpretation. Fourth, training uses the tenfold augmentation procedure of Thiam et al. [50], but we did not evaluate the method without augmentation or with alternative augmentation schemes. The extent to which performance depends on this specific procedure is therefore unknown, and augmented observations should not be interpreted as independent participants. Fifth, the reported results do not quantify variation across independent training seeds, and the small numerical differences between methods in the benchmark tables were not tested within a common experimental pipeline. Finally, BioVid, SenseEmotion, and PainMonit Experimental Dataset comprise healthy participants exposed to controlled heat stimuli, and our experiments use only ECG and EDA. The labels therefore represent experimentally administered stimulus levels rather than clinical pain assessments or self-reported pain. Validation in clinical populations and under less controlled acquisition conditions is required before the findings can be generalised to other pain aetiologies, sensor configurations, or deployment environments. 5.2 Future Work Future work should first evaluate personalisation with a paired, fixed-query protocol and repeated training seeds. The methodological contribution can then be isolated through comparisons of multiple prototype slots with one prototype per class, the learned prototype bank with a population-mean prototype, and support-based normalisation with fixed training-population normalisation. Prototype selection and weighting could also be learned through hierarchical information fusion [21], while continual-learning mechanisms could update subject prototypes as new labelled observations become available [25, 23, 24]. For practical deployment, future studies should reduce the requirement for balanced labels from every pain level, support sequential rather than transductive inference, and evaluate calibration, macro-F1, and clinically relevant error costs in addition to accuracy. 5.3 Conclusion In summary, we introduced and evaluated subject-as-a-task Few-Shot learning for personalised classification of experimentally induced heat-pain levels. Under the present episodic protocol, subject-specific support was associated with higher mean performance, particularly in the multi-class tasks and for intermediate pain levels, but the benefit was not uniform across subjects or classes. The Zero-Shot variant requires no labelled target-subject samples, although its current transductive normalisation assumes access to an unlabelled batch from that subject. These findings support further investigation of prototype-based personalisation, but fixed-query comparisons and validation in clinical settings are needed before conclusions can be drawn about individualised pain monitoring in practice. Acknowledgements This work was financially supported by funds under the IU Incubator programme TAPAS: Tailored Automated Pain Assessment Systems. Author Contributions Conceptualization: Heinke Hihn Formal Analysis: Heinke Hihn Investigation: Heinke Hihn Resources: Heinke Hihn Software: Heinke Hihn, Ibrahim Eisawy Supervision: Friedhelm Schwenker, Hans A. Kestler Data curation: Heinke Hihn, Patrick Thiam Visualization: Heinke Hihn Funding acquisition: Heinke Hihn Writing - original draft: Heinke Hihn Writing - review and editing: Heinke Hihn, Ibrahim Eisawy, Patrick Thiam, Friedhelm Schwenker, Hans A. Kestler References [1] T. Akiba, S. Sano, T. Yanase, T. Ohta, and M. Koyama (2019) Optuna: a next-generation hyperparameter optimization framework. In The 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, p. 2623–2631. Cited by: §4. [2] S. An, S. Kim, P. Chikontwe, and S. H. Park (2023) Dual attention relation network with fine-tuning for few-shot eeg motor imagery classification. IEEE transactions on neural networks and learning systems 35 (11), p. 15479–15493. Cited by: §2.1. [3] A. M. Anter and Z. Zhang (2023) RLWOA-sofl: a new learning model-based reinforcement swarm intelligence and self-organizing deep fuzzy rules for fmri pain decoding. IEEE Transactions on Affective Computing 15 (2), p. 644–656. Cited by: §2.2, §2.2. [4] M. H. Aslam, C. Martinez, M. Pedersoli, A. L. Koerich, A. Etemad, and E. Granger (2025) Learning from stochastic teacher representations using student-guided knowledge distillation. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases, p. 235–253. Cited by: §3.1.1, §3.1.2, §3.1.3, Table 2. [5] S. Aziz, M. U. Khan, and R. F. Rojas (2024) MDNet: a lightweight multidomain 1-d cnn for embedded pain assessment using eda signals. IEEE Sensors Journal 24 (11), p. 17637–17646. External Links: Document Cited by: §3.1.1, §3.1.2, §3.1.3. [6] M. Belal, T. Hassan, A. Hassan, D. Velayudhan, N. Elhendawi, A. Aljarah, and I. Hussain (2025) FSID: a novel approach to human activity recognition using few-shot weight imprinting. Scientific Reports 15 (1), p. 20865. Cited by: §2.1. [7] D. Bourou, A. Pampouchidou, M. Tsiknakis, K. Marias, and P. Simos (2018) Video-based pain level assessment: feature selection and inter-subject variability modeling. In 2018 41st International Conference on Telecommunications and Signal Processing (TSP), p. 1–6. Cited by: §1. [8] L. Buzuti, G. Giraldi, T. Heiderich, M. Barros, R. Guinsburg, and C. Thomaz (2024) Generative ai for neonatal pain assessment: a sound approach to improve data-driven automatic recognition in intensive care unit. Available at SSRN 4994076. Cited by: §2.1. [9] F. Del Pup and M. Atzori (2023) Applications of self-supervised learning to biomedical signals: a survey. IEEE Access 11, p. 144180–144203. Cited by: §1. [10] O. El Othmani and S. Naouali (2026) PANDIA: personalized neuro-symbolic multimodal fusion for interpretable neonatal pain assessment. PLOS Digital Health 5 (5), p. e0001442. Cited by: §2.1. [11] R. Fang, R. Zhang, E. Hosseini, M. Orooji, H. Homayoun, S. M. Hosseini, M. Faghih, S. Rafatirad, and S. Rafatirad (2022) Atlas: an adaptive transfer learning based pain assessment system: a real life unsupervised pain assessment solution. In 2022 44th Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC), p. 1331–1337. Cited by: §2.3. [12] J. Farmani, G. Bargshady, S. Gkikas, M. Tsiknakis, and R. F. Rojas (2025) CrossMod-transformer: multi-modal pain detection through eda and ecg fusion. Scientific Reports 15 (1), p. 29467. External Links: Document Cited by: Fig 3, Fig 3, §3.1.1, §3.1.2, §3.1.3, §3.3, §4.1, Table 2. [13] S. Gkikas, C. Chatzaki, and M. Tsiknakis (2021) Multi-task neural networks for pain intensity estimation using electrocardiogram and demographic factors. In International Conference on Information and Communication Technologies for Ageing Well and e-Health, p. 324–337. Cited by: Table 4, Table 4, Table 4, Table 4. [14] S. Gkikas, I. Kyprakis, and M. Tsiknakis (2025) Efficient pain recognition via respiration signals: a single cross-attention transformer multi-window fusion pipeline. In Companion Proceedings of the 27th International Conference on Multimodal Interaction, p. 70–79. Cited by: §1, §3.4. [15] P. Gouverneur, A. Badura, F. Li, M. Bieńkowska, L. Luebke, W. M. Adamczyk, T. M. Szikszay, A. Myśliwiec, K. Luedtke, M. Grzegorzek, et al. (2024) An experimental and clinical physiological signal dataset for automated pain recognition. Scientific Data 11 (1), p. 1051. Cited by: §1, §1, §4. [16] P. Gouverneur, F. Li, W. M. Adamczyk, T. M. Szikszay, K. Luedtke, and M. Grzegorzek (2021) Comparison of feature extraction methods for physiological signals for heat-based pain recognition. Sensors 21 (14), p. 4838. Cited by: Table 3. [17] P. Gouverneur, F. Li, K. Shirahama, L. Luebke, W. M. Adamczyk, T. M. Szikszay, K. Luedtke, and M. Grzegorzek (2023) Explainable artificial intelligence (xai) in pain research: understanding the role of electrodermal activity for automated pain recognition. Sensors 23 (4), p. 1959. Cited by: Table 3, Table 3, Table 3. [18] N. Gozzi, G. Preatoni, F. Ciotti, M. Hubli, P. Schweinhardt, A. Curt, and S. Raspopovic (2024) Unraveling the physiological and psychosocial signatures of pain by machine learning. Med 5 (12), p. 1495–1509. Cited by: §1, §1. [19] J. Gui, T. Chen, J. Zhang, Q. Cao, Z. Sun, H. Luo, and D. Tao (2024) A survey on self-supervised learning: algorithms, applications, and future trends. IEEE Transactions on Pattern Analysis and Machine Intelligence 46 (12), p. 9052–9071. Cited by: §1. [20] G. A. Hawker, S. Mian, T. Kendzerska, and M. French (2011) Measures of adult pain: visual analog scale for pain (vas pain), numeric rating scale for pain (nrs pain), mcgill pain questionnaire (mpq), short-form mcgill pain questionnaire (sf-mpq), chronic pain grade scale (cpgs), short form-36 bodily pain scale (sf-36 bps), and measure of intermittent and constant osteoarthritis pain (icoap). Arthritis care & research 63 (S11), p. S240–S252. Cited by: §1. [21] H. Hihn and D. A. Braun (2020) Hierarchical expert networks for meta-learning. In 4th Lifelong Machine Learning Workshop at ICML 2020, Cited by: §1, §1, §5.2. [22] H. Hihn and D. A. Braun (2020) Specialization in hierarchical learning systems: a unified information-theoretic approach for supervised, unsupervised and reinforcement learning. Neural Processing Letters 52 (3), p. 2319–2352. Cited by: §1, §1. [23] H. Hihn and D. A. Braun (2023) Hierarchically structured task-agnostic continual learning. Machine Learning 112 (2), p. 655–686. Cited by: §1, §5.2. [24] H. Hihn and D. A. Braun (2024) Online continual learning through unsupervised mutual information maximization. Neurocomputing 578, p. 127422. Cited by: §1, §5.2. [25] H. Hihn and D. A. Braun (2021) Mixture-of-variational-experts for continual learning. In ICLR Workshop on Agent Learning in Open-Endedness, Cited by: §1, §5.2. [26] H. Hihn and F. Schwenker (2026) Efficient architecture search under leave-one-subject-out evaluation. arXiv. External Links: 2609.21457, Link Cited by: Table 2. [27] T. Hospedales, A. Antoniou, P. Micaelli, and A. Storkey (2021) Meta-learning in neural networks: a survey. IEEE transactions on pattern analysis and machine intelligence 44 (9), p. 5149–5169. Cited by: §1. [28] R. Hou, H. Chang, B. Ma, S. Shan, and X. Chen (2019) Cross attention network for few-shot classification. Advances in neural information processing systems 32. Cited by: §3.4, §3.4. [29] X. Ji, X. Chang, W. Li, and A. Y. Zomaya (2024) Unraveling pain levels: a data-uncertainty guided approach for effective pain assessment. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 38, p. 22167–22175. Cited by: §1, §1. [30] M. Jiang, R. Rosio, S. Salanterä, A. M. Rahmani, P. Liljeberg, D. S. da Silva, V. H. C. de Albuquerque, and W. Wu (2024) Personalized and adaptive neural networks for pain detection from multi-modal physiological features. Expert Systems with Applications 235, p. 121082. Cited by: §1, §1, §2.3, Table 2, §5. [31] M. Kächele, P. Thiam, M. Amirian, F. Schwenker, and G. Palm (2016) Methods for person-centered continuous pain intensity assessment from bio-physiological channels. IEEE Journal of Selected Topics in Signal Processing 10 (5), p. 854–864. Cited by: §1, §1. [32] V. Kessler, P. Thiam, M. Amirian, and F. Schwenker (2017) Multimodal fusion including camera photoplethysmography for pain recognition. In 2017 International Conference on Companion Technology (ICCT), p. 1–4. Cited by: Table 1. [33] M. A. Khan, R. G. Koh, D. Kumbhare, and T. E. Doyle (2026) Chronic pain as a continuum: unsupervised learning for identification and quantification of coexisting chronic pain mechanisms. IEEE Access. Cited by: §2.2, §2.2. [34] M. U. Khan, G. Chetty, R. Goecke, and R. Fernandez-Rojas (2025) A systematic review of multimodal signal fusion for acute pain assessment systems. ACM Computing Surveys 58 (2), p. 1–35. Cited by: §1. [35] J. Li, J. Luo, Y. Wang, Y. Jiang, X. Chen, and Y. Quan (2024) Automatic pain assessment based on physiological signals: application of multi-scale networks and cross-attention cross-attention. In Proceedings of the 2024 13th International Conference on Bioinformatics and Biomedical Science, p. 113–122. Cited by: §3.1.1, §3.1.2, §3.1.3, §3.4, Table 2, Table 5. [36] J. Li, X. Wang, Z. Tu, and M. R. Lyu (2021) On the diversity of multi-head attention. Neurocomputing 454, p. 14–24. Cited by: §3.3. [37] D. Lopez-Martinez and R. Picard (2017) Multi-task neural networks for personalized pain recognition from physiological signals. In 2017 Seventh International Conference on Affective Computing and Intelligent Interaction Workshops and Demos (ACIIW), p. 181–184. Cited by: §1. [38] D. Lopez-Martinez and R. Picard (2018) Continuous pain intensity estimation from autonomic signals with recurrent neural networks. In 2018 40th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC), p. 5624–5627. Cited by: Table 4, Table 4. [39] Z. Lu, B. Ozek, and S. Kamarthi (2023) Transformer encoder with multiscale deep learning for pain classification using physiological signals. Frontiers in Physiology 14, p. 1294577. External Links: Document Cited by: §3.1.1, §3.1.2, §3.1.3, Table 2, Table 5. [40] L. Luebke, P. Gouverneur, T. M. Szikszay, W. M. Adamczyk, K. Luedtke, and M. Grzegorzek (2023) Objective measurement of subjective pain perception with autonomic body reactions in healthy subjects and chronic back pain patients: an experimental heat pain study. Sensors 23 (19), p. 8231. Cited by: Table 3. [41] A. McCofie, A. Kandiyana, P. R. Mouton, Y. Sun, and D. Goldgof (2025) Few-shot prompting with vision language model for pain classification in infant cry sounds. In 2025 IEEE 38th International Symposium on Computer-Based Medical Systems (CBMS), p. 857–862. Cited by: §2.1. [42] F. Pouromran, S. Radhakrishnan, and S. Kamarthi (2021) Exploration of physiological sensors, features, and machine learning models for pain intensity estimation. PLOS ONE 16 (7), p. e0254108. External Links: Document Cited by: §1, §1. [43] N. Rathee, S. Pahal, and P. Sheoran (2022) Pain detection from facial expressions using domain adaptation technique. Pattern Analysis and Applications 25 (3), p. 567–574. Cited by: §2.1, §2.1, §5. [44] T. B. Ricken, P. Bellmann, S. Walter, and F. Schwenker (2023) Pain detection in biophysiological signals: knowledge transfer from short-term to long-term stimuli based on distance-specific segment selection. Computers 12 (4). External Links: Link, ISSN 2073-431X, Document Cited by: §2.2, §2.2. [45] M. Sharafi, E. Ollivier, M. O. Zeeshan, S. Belharbi, A. L. Koerich, M. Pedersoli, S. Bacon, and E. Granger (2025) Disentangled source-free personalization for facial expression recognition with neutral target data. In 2025 IEEE 19th International Conference on Automatic Face and Gesture Recognition (FG), p. 1–10. Cited by: §2.3, §5. [46] H. Shi, B. Chikhaoui, and S. Wang (2022) Tree-based models for pain detection from biomedical signals. In International conference on smart homes and health telematics, p. 183–195. Cited by: §3.1.1, §3.1.2, §3.1.3. [47] N.A.K. Steur and F. Schwenker (2025) Multimodal pain recognition based on contrastive adversarial autoencoder pretraining. Machine Learning and Knowledge Extraction 7, p. 165. External Links: Document Cited by: Table 2. [48] P. Thiam, P. Bellmann, H. A. Kestler, and F. Schwenker (2019) Exploring deep physiological models for nociceptive pain recognition. Sensors 19 (20), p. 4503. Cited by: §1, Table 2, Table 4, Table 4. [49] P. Thiam, H. Hihn, D. A. Braun, H. A. Kestler, and F. Schwenker (2021) Multi-modal pain intensity assessment based on physiological signals: a deep learning perspective. Frontiers in Physiology 12, p. 720464. Cited by: §1, Table 1. [50] P. Thiam, H. Hihn, D. A. Braun, H. A. Kestler, and F. Schwenker (2021) Multi-modal pain intensity assessment based on physiological signals: a deep learning perspective. Frontiers in Physiology 12, p. 720464. External Links: Document Cited by: §1, §3.1.1, Table 2, §4, §5.1. [51] P. Thiam, V. Kessler, M. Amirian, P. Bellmann, G. Layher, Y. Zhang, M. Velana, S. Gruss, S. Walter, H. C. Traue, et al. (2019) Multi-modal pain intensity recognition based on the senseemotion database. IEEE Transactions on Affective Computing 12 (3), p. 743–760. Cited by: Table 1, Table 4. [52] P. Thiam, V. Kessler, and F. Schwenker (2017) Hierarchical combination of video features for personalised pain level recognition.. In ESANN, p. 465–470. Cited by: §2.3, §5. [53] P. Thiam, H. A. Kestler, and F. Schwenker (2020) Two-stream attention network for pain recognition from video sequences. Sensors 20 (3), p. 839. Cited by: Table 1. [54] P. Thiam, F. Schwenker, and H. A. Kestler (2025) Dealing with class overlap through cluster-based sample weighting. Computers 14 (11), p. 457. Cited by: §3.1.1, §3.1.2, §3.1.3, Table 1, Table 2. [55] S. Thuseethan, S. Rajasegarar, and J. Yearwood (2021) Deep continual learning for emerging emotion recognition. IEEE Transactions on Multimedia 24, p. 4367–4380. Cited by: §1. [56] M. Velana, S. Gruss, G. Layher, P. Thiam, Y. Zhang, D. Schork, V. Kessler, S. Meudt, H. Neumann, J. Kim, et al. (2016) The senseemotion database: a multimodal database for the development and systematic validation of an automatic pain-and emotion-recognition system. In IAPR Workshop on Multimodal Pattern Recognition of Social Signals in Human-Computer Interaction, p. 127–139. Cited by: §1, Fig 2, Fig 2, §3.1.2, §4. [57] S. Walter, S. Gruss, H. Ehleiter, J. Tan, H. C. Traue, S. Crawcour, P. Werner, A. Al-Hamadi, A. O. Andrade, and G. M. da Silva (2013) The biovid heat pain database: data for the advancement and systematic validation of an automated pain recognition system. In 2013 IEEE International Conference on Cybernetics (CYBCO), p. 128–131. External Links: Document Cited by: §1, §1, Fig 2, Fig 2, §3.1.1, §4. [58] K. Wang, Y. Zhang, Y. Zhang, F. Zhang, J. Shen, and B. Hu (2026) MSFSNet: multi-source few-shot adaptation network for cross-subject depression recognition from eeg signals. IEEE Journal of Biomedical and Health Informatics. Cited by: §2.1. [59] L. Wang, X. Zhang, H. Su, and J. Zhu (2024) A comprehensive survey of continual learning: theory, method and application. IEEE transactions on pattern analysis and machine intelligence 46 (8), p. 5362–5383. Cited by: §1. [60] W. Wang, V. W. Zheng, H. Yu, and C. Miao (2019) A survey of zero-shot learning: settings, methods, and applications. ACM Transactions on Intelligent Systems and Technology (TIST) 10 (2), p. 1–37. Cited by: §3.5. [61] Y. Wang, Q. Yao, J. T. Kwok, and L. M. Ni (2020) Generalizing from a few examples: a survey on few-shot learning. ACM computing surveys (csur) 53 (3), p. 1–34. Cited by: §1, §3.2. [62] P. Werner, A. Al-Hamadi, K. Limbrecht-Ecklundt, S. Walter, S. Gruss, and H. C. Traue (2016) Automatic pain assessment with facial activity descriptors. IEEE Transactions on Affective Computing 8 (3), p. 286–299. Cited by: §1, §1. [63] P. Werner, A. Al-Hamadi, R. Niese, S. Walter, S. Gruss, and H. C. Traue (2014) Automatic pain recognition from video and biomedical signals. In 2014 22nd international conference on pattern recognition, p. 4582–4587. Cited by: Table 4, Table 4. [64] P. Werner, D. Lopez-Martinez, S. Walter, A. Al-Hamadi, S. Gruss, and R. W. Picard (2019) Automatic recognition methods supporting pain assessment: a survey. IEEE Transactions on Affective Computing 13 (1), p. 530–552. Cited by: §1, §1.